An improved heuristic for the capacitated arc routing problem

DOI10.1016/j.cor.2008.11.005zbMath1179.90038OpenAlexW2055882545MaRDI QIDQ1010273

J. Martínez

Publication date: 3 April 2009

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

Full work available at URL: http://hdl.handle.net/10316/9989

zbMATH Keywords

heuristicsvehicle routingcapacitated arc routing problem

Mathematics Subject Classification ID

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

Related Items

An efficiency-based path-scanning heuristic for the capacitated arc routing problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities, Modeling and solving the mixed capacitated general routing problem, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems, Crossover iterated local search for SDCARP, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, The open capacitated arc routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive memetic algorithms for arc routing problems
• Approximate solutions for the capacitated arc routing problem
• A cutting plane algorithm for the capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• Geometric Approaches to Solving the Traveling Salesman Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem