An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand
From MaRDI portal
Publication:5301129
DOI10.1287/opre.1120.1154zbMath1267.90016OpenAlexW2110620774MaRDI QIDQ5301129
Jean-François Cordeau, Enrico Bartolini, Gilbert Laporte
Publication date: 2 July 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1154
Related Items (7)
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ An approach to the asymmetric multi-depot capacitated arc routing problem ⋮ Lane covering with partner bounds in collaborative truckload transportation procurement ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Robust drone selective routing in humanitarian transportation network assessment
This page was built for publication: An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand