Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
DOI10.1016/J.COR.2015.10.010zbMATH Open1349.90178OpenAlexW1877579279MaRDI QIDQ342292FDOQ342292
Elias J. Willemse, Johan W. Joubert
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.10.010
benchmark instancestime restrictionscapacitated arc routing problemwaste collectionconstructive heuristicsintermediate facilitiesminimise fleet sizemixed network
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Recent results on Arc Routing Problems: An annotated bibliography
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Lower bounds for the mixed capacitated arc routing problem
- Heuristic methods for the sectoring arc routing problem
- Approximate solutions for the capacitated arc routing problem
- A cutting plane algorithm for the capacitated arc routing problem
- Solving an urban waste collection problem using ants heuristics
- Lower and upper bounds for the mixed capacitated arc routing problem
- The capacitated arc routing problem with intermediate facilities
- The mixed capacitated arc routing problem with non-overlapping routes
- The fleet size and mix problem for capacitated arc routing
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Competitive memetic algorithms for arc routing problems
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- An improved heuristic for the capacitated arc routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- A scatter search for the periodic capacitated arc routing problem
- The Arc Routing and Scheduling Problem with Transshipment
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- Network service scheduling and routing
- Experimental evaluation of heuristic optimization algorithms: A tutorial
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
Cited In (11)
- Waste collection routing: a survey on problems and methods
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- An improved multi-objective framework for the rich arc routing problem
- An updated annotated bibliography on arc routing problems
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- Arc routing for parking enforcement officers: exact and heuristic solutions
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
This page was built for publication: Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342292)
