The capacitated arc routing problem. A heuristic algorithm

MaRDI QIDQ5323400zbMATH OpenFDO

Authors Enrique Benavent, Vicente Campos, Ángel Corberán, Enrique Mota

Publication date 23 July 2009

Full work available at URL https://eudml.org/doc/40301, http://www.idescat.cat/sort/questiio/questiiopdf/14.1,2,3.6.lopez.pdf

zbMATH Keywords

distributionheuristicsrouting

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximation algorithm for the capacitated arc routing problem
• The Capacitated Arc Routing Problem: Lower bounds
• Approximate solutions for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem

Cited in

(22)

• An improved heuristic for the capacitated arc routing problem
• The fleet size and mix problem for capacitated arc routing
• Approximate solutions for the capacitated arc routing problem
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• Constant-factor approximations for capacitated arc routing without triangle inequality
• Bounds and heuristics for the shortest capacitated paths problem
• A cutting plane algorithm for the capacitated arc routing problem
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
• The sector design and assignment problem for snow disposal operations
• Road network monitoring: algorithms and a case study
• scientific article; zbMATH DE number 6699823 (Why is no real title available?)
• An approximation algorithm for the capacitated arc routing problem
• A heuristic method for the capacitated arc routing problem with refill points and multiple loads
• Bounds and Heuristics for Capacitated Routing Problems
• The Capacitated Arc Routing Problem: Lower bounds
• scientific article; zbMATH DE number 1054960 (Why is no real title available?)
• scientific article; zbMATH DE number 764424 (Why is no real title available?)
• Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
• A deterministic tabu search algorithm for the capacitated arc routing problem
• The undirected capacitated arc routing problem with profits

This page was built for publication: The capacitated arc routing problem. A heuristic algorithm

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