The capacitated arc routing problem with refill points
From MaRDI portal
Publication:2643817
DOI10.1016/J.ORL.2005.12.009zbMath1278.90413OpenAlexW2030322691MaRDI QIDQ2643817
Martin Trépanier, Alberto Amaya, André Langevin
Publication date: 27 August 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.12.009
capacitated arc routing probleminteger linear modelmulti-trip rural postman problemreplenishment pointsroad marking
Related Items (12)
A survey of recent research on location-routing problems ⋮ The mixed capacitated arc routing problem with non-overlapping routes ⋮ The synchronized arc and node routing problem: application to road marking ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ Location arc routing problem with inventory constraints ⋮ Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities ⋮ A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method ⋮ A Decade of Capacitated Arc Routing ⋮ An adaptive VNS algorithm for vehicle routing problems with intermediate stops ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Linear formulations for the vehicle routing problem with synchronization constraints ⋮ Lower bounds for the mixed capacitated arc routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The capacitated arc routing problem: Valid inequalities and facets
- A branch-and-cut algorithm for the undirected rural postman problem
- The capacitated arc routing problem with intermediate facilities
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Eulerian location problems
This page was built for publication: The capacitated arc routing problem with refill points
