A guided local search procedure for the multi-compartment capacitated arc routing problem

DOI10.1016/j.cor.2009.12.014zbMath1189.90213OpenAlexW1994236851MaRDI QIDQ2270452

Luc Muyldermans, G. Pang

Publication date: 18 March 2010

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

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

zbMATH Keywords

meta-heuristicsguided local searchco-collectionseparate collectionmulti-compartment capacitated arc routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ Arc routing problems: A review of the past, present, and future ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vehicle routing with compartments: applications, modelling and heuristics
• Competitive memetic algorithms for arc routing problems
• A heuristic for the multi-period petrol station replenishment problem
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
• Routeing winter gritting vehicles
• Solving a fuel delivery problem by heuristic and exact approaches.
• A decision support system for a real vehicle routing problem.
• Scheduling deliveries in vehicles with multiple compartments
• Guided local search and its application to the traveling salesman problem
• A guided local search heuristic for the capacitated arc routing problem
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• A Decade of Capacitated Arc Routing
• Capacitated arc routing problems
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
• Computer Solutions of the Traveling Salesman Problem