Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
From MaRDI portal
Publication:964850
DOI10.1007/s10732-008-9097-8zbMath1188.90264OpenAlexW2059958986MaRDI QIDQ964850
Demetrio Laganà, Francesco Mari, Gianpaolo Ghiani, Gilbert Laporte
Publication date: 21 April 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-008-9097-8
ant colony optimizationcapacitated arc routing problemcapacity and distance restrictionsIntermediate facilities
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
New large-scale data instances for CARP and new variations of CARP, Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities, Solving vehicle routing problems with intermediate stops using VRPSolver models, Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles, Capacitated arc routing problem with deadheading demands, A memetic algorithm for the orienteering problem with hotel selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
- A guided local search heuristic for the capacitated arc routing problem
- The capacitated arc routing problem with intermediate facilities
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- On general routing problems
- The Arc Routing and Scheduling Problem with Transshipment
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- A Tabu Search Heuristic for the Capacitated arc Routing Problem