A heuristic method for the capacitated arc routing problem with refill points and multiple loads

DOI10.1057/jors.2009.58zbMath1193.90150OpenAlexW1984148644MaRDI QIDQ3585716

C. A. Amaya, André Langevin, Martin Trépanier

Publication date: 2 September 2010

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.2009.58

zbMATH Keywords

optimizationheuristicsvehicle routinglogisticscapacitated arc routing problemnetworks and graphs

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)

Related Items (2)

The synchronized arc and node routing problem: application to road marking ⋮ Arc routing problems: A review of the past, present, and future

This page was built for publication: A heuristic method for the capacitated arc routing problem with refill points and multiple loads