Transforming arc routing into node routing problems
Computers and Operations Research
The vehicle routing problem
A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
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
Lower and upper bounds for the mixed capacitated arc routing problem
Computers and Operations Research
An improved heuristic for the capacitated arc routing problem
Computers and Operations Research
GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
Applied Soft Computing
Survey: The vehicle routing problem: A taxonomic review
Computers and Industrial Engineering
Arc routing in a node routing environment
Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
Multiobjective capacitated arc routing problem
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs
Computers and Industrial Engineering
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
SIM-RandSHARP: a hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
The Capacitated Arc Routing Problem (CARP) is a combinatorial optimization problem similar to the well-known Capacitated Vehicle Routing Problem (CVRP). In the CARP, the customers' demands are located on the edges (arcs) of a general (not necessarily complete) graph. This is in contrast to the CVRP, where demand is located on the nodes of a complete graph. While the CVRP has been extensively studied over the past couple of decades, the number of articles and research results on the CARP is significantly lower. To partially fill this gap in the literature, a new heuristic and two new algorithms for the CARP are proposed and evaluated. Our Savings-based Heuristic for the ARP (SHARP) is inspired on the popular Clarke and Wright savings heuristic for the CVRP. The SHARP procedure outperforms the classical Path Scanning heuristic (PSH) and thus it can be integrated into most meta-heuristics to provide a ‘good’ and fast initial solution to medium-to-large size ARPs which cannot be solved using exact approaches. Using both SHARP and PSH as a base, two randomized algorithms are developed in this paper. These are multi-start algorithms which introduce a biased randomization process to each heuristic. This randomization process uses biased probability distributions, such as the geometric one, in order to induce some degree of randomness in the solution-construction stage while keeping most of the heuristic ‘common sense’. In order to state their efficiency, both randomized algorithms are compared and evaluated using a standard set of benchmarks. The results show that our randomized version of SHARP, RandSHARP, is quite competitive and far superior to the PSH-based randomized algorithm.