Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities

DOI10.1016/J.COR.2019.02.002zbMath1458.90151OpenAlexW2913640856MaRDI QIDQ1722978

Elias J. Willemse, Johan W. Joubert

Publication date: 19 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.02.002

zbMATH Keywords

local searchtime restrictionswaste managementcapacitated arc routing problemintermediate facilitiesmixed 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 (5)

A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ 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 ⋮ 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid metaheuristic approach for the capacitated arc routing problem
• 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
• Lower bounds for the mixed capacitated arc routing problem
• Two phased hybrid local search for the periodic capacitated arc routing problem
• Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
• A guided local search heuristic for the capacitated arc routing problem
• Sequential search and its application to vehicle-routing problems
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• Lower and upper bounds for the mixed capacitated arc routing problem
• Recent results on Arc Routing Problems: An annotated bibliography
• Capacitated arc routing problems
• Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension

This page was built for publication: Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities