Lower bounds and heuristics for the windy rural postman problem

DOI10.1016/J.EJOR.2005.09.021MaRDI QIDQ852946zbMATHOpenAlexFDO

Authors Enrique Benavent, Alessandro Carrotta, Ángel Corberán, Daniele Vigo, José M. Sanchis

Publication date 15 November 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.09.021

zbMATH Keywords

heuristicscutting planesroutingWindy Rural Postman Problem

Mathematics Subject Classification ID

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

Recommendations

• New heuristic algorithms for the windy rural postman problem
• Algorithms for the windy postman problem
• A branch & cut algorithm for the windy general routing problem and special cases
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A cutting plane algorithm for the windy postman problem

Cites work

• scientific article; zbMATH DE number 4068590 (Why is no real title available?)
• scientific article; zbMATH DE number 3724496 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• scientific article; zbMATH DE number 1568943 (Why is no real title available?)
• A cutting plane algorithm for the general routing problem
• A cutting plane algorithm for the windy postman problem
• A polyhedral approach to the rural postman problem
• Algorithms for the windy postman problem
• An algorithm for the Rural Postman problem on a directed graph
• Arc Routing Problems, Part II: The Rural Postman Problem
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• New inequalities for the general routing problem
• Odd Minimum Cut-Sets and b-Matchings
• On the windy postman problem
• On the windy postman problem on Eulerian graphs
• The Chinese Postman Problem for Mixed Networks
• The general routing polyhedron: A unifying framework
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra

Cited in

(22)

• A scatter search algorithm for time-dependent prize-collecting arc routing problems
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• New heuristic algorithms for the windy rural postman problem
• An open-source desktop application for generating arc-routing benchmark instances
• Plowing with precedence in polynomial time
• The generalized arc routing problem
• A branch-and-cut algorithm for the windy profitable location rural postman problem
• On the windy postman problem
• Solving the close-enough arc routing problem
• The single robot line coverage problem: Theory, algorithms, and experiments
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• A cutting plane algorithm for the windy postman problem
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
• Recent results on arc routing problems: an annotated bibliography
• New results on the windy postman problem
• Heuristics for a dynamic rural postman problem
• Min-Max \(K\)-vehicles windy rural postman problem
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
• A branch & cut algorithm for the windy general routing problem and special cases
• A branch-and-price algorithm for the windy rural postman problem
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem

This page was built for publication: Lower bounds and heuristics 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 Q852946)