A parallel insert method for the capacitated arc routing problem

DOI10.1016/0167-6377(84)90049-XzbMath0541.90091OpenAlexW2070561727MaRDI QIDQ794931

Luc Chapleau, Jacques A. Ferland, Jean-Marc Rousseau, Guy Lapalme

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(84)90049-x

zbMATH Keywords

algorithmheuristicarc routingComputational resultsapproximate solution strategycapacitated versioninsertion procedureroute selection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Related Items

An efficiency-based path-scanning heuristic for the capacitated arc routing problem, A capacitated general routing problem on mixed networks, A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal, Routing problems: A bibliography, Approximate solutions for the capacitated arc routing problem, The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases, Road network monitoring: algorithms and a case study, Augment-insert algorithms for the capacitated arc routing problem, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Solving capacitated arc routing problems using a transformation to the CVRP, The fleet size and mix problem for capacitated arc routing, The arc partitioning problem

Cites Work

• Approximate Traveling Salesman Algorithms
• Capacitated arc routing problems
• Implementing vehicle routing algorithms
• Computer Solutions of the Traveling Salesman Problem