Solution of real-world postman problems

DOI10.1016/j.ejor.2007.06.002zbMath1146.90331OpenAlexW1966045773MaRDI QIDQ2482818

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)

Related Items

A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows, 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, A concise guide to existing and emerging vehicle routing problem variants, Arc routing problems: A review of the past, present, and future, Small and large neighborhood search for the park-and-loop routing problem with parking selection, Heuristics for vehicle routing problems: sequence or set optimization?, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A two-stage solution approach for the directed rural postman problem with turn penalties, The windy rural postman problem with a time-dependent zigzag option, Large multiple neighborhood search for the clustered vehicle-routing problem, Recent results on Arc Routing Problems: An annotated bibliography, Lower bounds for the mixed capacitated arc routing problem

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transforming asymmetric into symmetric traveling salesman problems
• On the windy postman problem
• Large-step Markov chains for the TSP incorporating local search heuristics
• Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
• A GRASP heuristic for the mixed Chinese postman problem
• Sequential search and its application to vehicle-routing problems
• Fast local search algorithms for the handicapped persons transportation problem
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• The Chinese Postman Problem for Mixed Networks
• On the complexity of edge traversing
• Implementation of a linear time algorithm for certain generalized traveling salesman problems
• Solving arc routing problems with turn penalties
• Arc Routing Problems, Part I: The Chinese Postman Problem
• The Directed Rural Postman Problem with Turn Penalties
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• On finding minimum routes in a network with turn penalties
• Construction heuristics for the asymmetric TSP.
• Variable neighborhood search: Principles and applications
• A Note on Postman Problems with Zigzag Service