Modeling and solving several classes of arc routing problems as traveling salesman problems
From MaRDI portal
Publication:1374032
DOI10.1016/S0305-0548(97)00013-0zbMath0889.90146MaRDI QIDQ1374032
Publication date: 2 December 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
traveling salesman; arc routing; low density graphs; Mixed Rural Postman Problems; Stacker Crane Problems
90C35: Programming involving graphs or networks
Related Items
The Rural Postman Problem on mixed graphs with turn penalties, A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal, Lower bounds and heuristics for the windy rural postman problem, Heuristics for a dynamic rural postman problem, Solving an urban waste collection problem using ants heuristics, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for the Rural Postman problem on a directed graph
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Capacitated arc routing problems
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
