Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics

DOI10.1007/s10479-018-2777-3zbMath1411.90342MaRDI QIDQ1730649

Angel A. Juan, Jesica De Armas, Seán McGarraghy, Peter B. Keenan

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-2777-3

zbMATH Keywords

metaheuristics; simulated annealing; capacitated arc routing problem; biased randomisation; time-based capacities

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• Algorithm 97