Algorithms for Large Directed Capacitated Arc Routing Problem Instances

DOI10.1007/978-3-540-70807-0_16MaRDI QIDQ3625023zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Vittorio Maniezzo, Matteo Roffilli

Publication date 7 May 2009

Published in Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70807-0_16

zbMATH Keywords

capacitated arc routingcombinatorial optimizationdata perturbationgarbage collectionmetaheuristicsproblem reduction

Mathematics Subject Classification ID

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

Recommendations

• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• Augment-insert algorithms for the capacitated arc routing problem
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• Competitive memetic algorithms for arc routing problems

Cited in

(2)

• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• GRASP with evolutionary path-relinking for the capacitated arc routing problem

This page was built for publication: Algorithms for Large Directed Capacitated Arc Routing Problem Instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625023)