A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Computers and Operations Research
Lower bounds for the mixed capacitated arc routing problem
Computers and Operations Research
Computers and Operations Research
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Improved memetic algorithm for capacitated arc routing problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Memetic algorithm with extended neighborhood search for capacitated arc routing problems
IEEE Transactions on Evolutionary Computation
Computers and Operations Research
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic
Transportation Science
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem
Computers and Operations Research
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands
Operations Research Letters
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
Improved bounds for large scale capacitated arc routing problem
Computers and Operations Research
Location-arc routing problem: Heuristic approaches and test instances
Computers and Operations Research
Hi-index | 0.00 |
This article proposes a new transformation of undirected arc-routing problems into equivalent node-routing problems, with emphasis on the transformation of Capacitated Arc Routing Problems (CARP) into Capacitated Vehicle Routing Problems (CVRP). For this last case, an analogue transformation has already been proposed in Pearn et al., where each required CARP edge is mapped onto a triplet of CVRP nodes. In our case, only two CVRP nodes are needed for every CARP required edge. The transformed instances have a structure and a dimension that make most CARP benchmarks solvable by state of the art CVRP techniques. We thus propose a general purpose transformation of arc into node-routing problems and new results on lower bounds and exact methods for CARP instances. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 52–60 2006