New heuristic algorithms for the windy rural postman problem

DOI10.1016/J.COR.2004.04.007MaRDI QIDQ2387296zbMATH OpenOpenAlexFDO

Authors Enrique Benavent, Estefanía Piñana, Isaac Plana, Ángel Corberán, José M. Sanchis

Publication date 2 September 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10251/94488

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Lower bounds and heuristics for the windy rural postman problem
• Algorithms for the windy postman problem
• scientific article; zbMATH DE number 2156293
• A branch-and-price algorithm for the windy rural postman problem
• A branch-and-cut algorithm for the profitable windy rural postman problem

Cites work

• A cutting plane algorithm for the windy postman problem
• A GRASP heuristic for the mixed Chinese postman problem
• Algorithms for the windy postman problem
• An algorithm for the Rural Postman problem on a directed graph
• Approximation Algorithms for Some Postman Problems
• Arc Routing Problems, Part II: The Rural Postman Problem
• Fundamentals of scatter search and path relinking
• scientific article; zbMATH DE number 1703887 (Why is no real title available?)
• scientific article; zbMATH DE number 4068590 (Why is no real title available?)
• scientific article; zbMATH DE number 1187150 (Why is no real title available?)
• scientific article; zbMATH DE number 3724496 (Why is no real title available?)
• Improvement Procedures for the Undirected Rural Postman Problem
• Lower bounds and heuristics for the windy rural postman problem
• On the windy postman problem
• On the windy postman problem on Eulerian graphs
• Scatter search. Methodology and implementation in C. With CD-ROM.
• The Chinese Postman Problem for Mixed Networks
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(16)

• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• A new view on rural postman based on Eulerian extension and matching
• OAR lib: an open source arc routing library
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
• A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
• Recent results on arc routing problems: an annotated bibliography
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• Improvement Procedures for the Undirected Rural Postman Problem
• A branch-and-price algorithm for the windy rural postman problem
• Plowing with precedence in polynomial time
• The single robot line coverage problem: Theory, algorithms, and experiments
• Aesthetic considerations for the min-max K-windy rural postman problem
• Time-dependent windy rural postman problem: mathematical formulation and adaptive metaheuristic
• On the windy postman problem
• Lower bounds and heuristics for the windy rural postman problem
• A metaheuristic for the min-max windy rural postman problem with K vehicles

Describes a project that uses

Uses Software

• TSPLIB
• Scatter Search

This page was built for publication: New heuristic algorithms for the windy rural postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387296)