Augment-insert algorithms for the capacitated arc routing problem
From MaRDI portal
Publication:2276892
DOI10.1016/0305-0548(91)90089-AzbMath0723.90082OpenAlexW2071463225MaRDI QIDQ2276892
Publication date: 1991
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(91)90089-a
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Heuristic method for a mixed capacitated arc routing problem: A refuse collection application ⋮ 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. III: Vehicle routing and depot location for spreading ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Routing problems: A bibliography ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ A deterministic tabu search algorithm for the capacitated arc routing problem ⋮ Approximate solutions for the maximum benefit chinese postman problem ⋮ The open capacitated arc routing problem ⋮ Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees ⋮ 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 ⋮ Districting for salt spreading operations
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
