Transforming arc routing into node routing problems
Computers and Operations Research
Augment-insert algorithms for the capacitated arc routing problem
Computers and Operations Research
The Capacitated Arc Routing Problem: Valid Inequalities and Facets
Computational Optimization and Applications
Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
A cutting plane algorithm for the capacitated arc routing problem
Computers and Operations Research
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 3 - Volume 3
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming: Series A and B
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
A parallel insert method for the capacitated arc routing problem
Operations Research Letters
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Computers and Operations Research
Memetic algorithm with extended neighborhood search for capacitated arc routing problems
IEEE Transactions on Evolutionary Computation
Computers and Operations Research
Computers and Operations Research
The open capacitated arc routing problem
Computers and Operations Research
A branch-cut-and-price algorithm for the capacitated arc routing problem
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
An integer programming approach for the rural postman problem with time dependent travel times
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
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
Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
Efficient solution of capacitated arc routing problems with a limited computational budget
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Improved bounds for large scale capacitated arc routing problem
Computers and Operations Research
GRASP with evolutionary path-relinking for the capacitated arc routing problem
Computers and Operations Research
Location-arc routing problem: Heuristic approaches and test instances
Computers and Operations Research
Hi-index | 0.01 |
A well-known transformation by Pearn, Assad and Golden reduces a capacitated arc routing problem (CARP) into an equivalent capacitated vehicle routing problem (CVRP). However, that transformation is regarded as unpractical, since an original instance with r required edges is turned into a CVRP over a complete graph with 3r+1 vertices. We propose a similar transformation that reduces this graph to 2r+1 vertices, with the additional restriction that a previously known set of r pairwise disconnected edges must belong to every solution. Using a recent branch-and-cut-and-price algorithm for the CVRP, we observed that it yields an effective way of attacking the CARP, being significantly better than the exact methods created specifically for that problem. Computational experiments obtained improved lower bounds for almost all open instances from the literature. Several such instances could be solved to optimality. Scope and purpose The scope of this paper is transforming arc routing problems into node routing problems. The paper shows that this approach can be effective and, in particular, that the original instances may generate node routing instances that behave as if the size is not increased. This result is obtained by slightly modifying the well-known transformation by Pearn, Assad and Golden from capacitated arc routing problem (CARP) to the capacitated vehicle routing problem (CVRP), that is regarded as unpractical. The paper provides a computational experience using a recent branch-and-cut-and-price algorithm for the CVRP. The results are significantly better than the exact methods created specifically for that problem, improving lower bounds for almost all open instances from the literature. Several such instances could be solved to optimality.