Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities

DOI10.1016/j.cor.2015.10.010zbMath1349.90178OpenAlexW1877579279MaRDI QIDQ342292

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

zbMATH Keywords

constructive heuristicstime restrictionsbenchmark instancescapacitated arc routing problemwaste collectionintermediate facilitiesminimise fleet sizemixed network

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

An improved multi-objective framework for the rich arc routing problem, Solving vehicle routing problems with intermediate stops using VRPSolver models, Fast upper and lower bounds for a large‐scale real‐world arc routing problem, 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, Arc routing for parking enforcement officers: exact and heuristic solutions, Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The mixed capacitated arc routing problem with non-overlapping routes
• 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
• Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
• An improved heuristic for the capacitated arc routing problem
• Lower bounds for the mixed capacitated arc routing problem
• Heuristic methods for the sectoring arc routing problem
• The fleet size and mix problem for capacitated arc routing
• Approximate solutions for the capacitated arc routing problem
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• A cutting plane algorithm for the capacitated arc routing problem
• 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-bounding and heuristic methods for a refuse collection vehicle routing problem
• Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
• A guided local search procedure for the multi-compartment capacitated arc routing problem
• Solving an urban waste collection problem using ants heuristics
• Lower and upper bounds for the mixed capacitated arc routing problem
• A scatter search for the periodic capacitated arc routing problem
• The capacitated arc routing problem with intermediate facilities
• Recent results on Arc Routing Problems: An annotated bibliography
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• The Arc Routing and Scheduling Problem with Transshipment
• Network service scheduling and routing
• 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
• Experimental evaluation of heuristic optimization algorithms: A tutorial