Augment-insert algorithms for the capacitated arc routing problem

DOI10.1016/0305-0548(91)90089-AzbMath0723.90082MaRDI QIDQ2276892

Wen Lea Pearn

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

capacitated arc routing; heuristic procedures; rural postman

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Approximate solutions for the maximum benefit chinese postman problem, The open capacitated arc routing problem, A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading, A deterministic tabu search algorithm for the capacitated arc routing problem, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Districting for salt spreading operations, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, A capacitated general routing problem on mixed networks, Routing problems: A bibliography, A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing, Solving capacitated arc routing problems using a transformation to the CVRP

Cites Work

• A parallel insert method for the capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Transforming arc routing into node routing problems
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• The Capacitated Canadian Postman Problem
• Capacitated arc routing problems