Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
From MaRDI portal
Publication:1755810
DOI10.1016/j.orl.2016.06.001zbMath1408.90045OpenAlexW2464265702MaRDI QIDQ1755810
Johan W. Joubert, Elias J. Willemse
Publication date: 11 January 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2263/56379
capacitated arc routing problemwaste collectionintermediate facilitiesmixed networksplitting procedures
Related Items (6)
Solving vehicle routing problems with intermediate stops using VRPSolver models ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities ⋮ A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
Cites Work
- Unnamed Item
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Competitive memetic algorithms for arc routing problems
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- The fleet size and mix problem for capacitated arc routing
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- Lower and upper bounds for the mixed capacitated arc routing problem
- The capacitated arc routing problem with intermediate facilities
- Recent results on Arc Routing Problems: An annotated bibliography
This page was built for publication: Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
