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)
Related Items (17)
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ Solving the time varying postman problems with timed automata ⋮ 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 ⋮ Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations ⋮ Heuristics for a dynamic rural postman problem ⋮ An ILP-refined tabu search for the directed profitable rural postman problem ⋮ The parking warden tour problem ⋮ Solving an urban waste collection problem using ants heuristics ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects ⋮ The Rural Postman Problem on mixed graphs with turn penalties ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time ⋮ The time-dependent rural postman problem: polyhedral results ⋮ The aircraft maintenance base location problem
Cites Work
- 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
- An optimal algorithm for the mixed Chinese postman problem
This page was built for publication: Modeling and solving several classes of arc routing problems as traveling salesman problems