Solution of real-world postman problems

DOI10.1016/J.EJOR.2007.06.002MaRDI QIDQ2482818zbMATH OpenOpenAlexFDO

Authors Stefan Irnich

Publication date 24 April 2008

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

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

zbMATH Keywords

postman problemsarc-routingtransformation into TSP

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• The Directed Rural Postman Problem with Turn Penalties
• The Rural Postman Problem on mixed graphs with turn penalties
• Finding postal carrier walk paths in mixed graphs
• Algorithms for the windy postman problem
• Multi-depot rural postman problems

Cites work

• scientific article; zbMATH DE number 4068590 (Why is no real title available?)
• scientific article; zbMATH DE number 2064413 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 1568945 (Why is no real title available?)
• A GRASP heuristic for the mixed Chinese postman problem
• A Note on Postman Problems with Zigzag Service
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Construction heuristics for the asymmetric TSP.
• Fast local search algorithms for the handicapped persons transportation problem
• Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
• Implementation of a linear time algorithm for certain generalized traveling salesman problems
• Large-step Markov chains for the TSP incorporating local search heuristics
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
• On finding minimum routes in a network with turn penalties
• On the complexity of edge traversing
• On the windy postman problem
• Sequential search and its application to vehicle-routing problems
• Solving arc routing problems with turn penalties
• The Chinese Postman Problem for Mixed Networks
• The Directed Rural Postman Problem with Turn Penalties
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• Transforming asymmetric into symmetric traveling salesman problems
• Variable neighborhood search: Principles and applications

Cited in

(16)

• Heuristics for vehicle routing problems: sequence or set optimization?
• scientific article; zbMATH DE number 1179832 (Why is no real title available?)
• A two-stage solution approach for the directed rural postman problem with turn penalties
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• Arc routing problems: A review of the past, present, and future
• A concise guide to existing and emerging vehicle routing problem variants
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• Large multiple neighborhood search for the clustered vehicle-routing problem
• Small and large neighborhood search for the park-and-loop routing problem with parking selection
• Lower bounds for the mixed capacitated arc routing problem
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem
• A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
• Recent results on arc routing problems: an annotated bibliography
• A Note on Postman Problems with Zigzag Service
• Traveling salesman problem at the post of Slovenia
• The windy rural postman problem with a time-dependent zigzag option

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Solution of real-world postman problems

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