A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
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
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
Lower and upper bounds for the mixed capacitated arc routing problem
Computers and Operations Research
Computers and Operations Research
A web spatial decision support system for vehicle routing using Google Maps
Decision Support Systems
The open capacitated arc routing problem
Computers and Operations Research
Multi-cellular-ant algorithm for large scale capacity vehicle route problem
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem
Computers and Operations Research
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
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”
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
GRASP with evolutionary path-relinking for the capacitated arc routing problem
Computers and Operations Research
Hi-index | 0.01 |
The capacitated arc routing problem (CARP) is an important and practical problem in the OR literature. In short, the problem is to identify routes to service (e.g., pickup or deliver) demand located along the edges of a network such that the total cost of the routes is minimized. In general, a single route cannot satisfy the entire demand due to capacity constraints on the vehicles. CARP belongs to the set of NP-hard problems; consequently numerous heuristic and metaheuristic solution approaches have been developed to solve it. In this paper an ''ellipse rule'' based heuristic is proposed for the CARP. This approach is based on the path-scanning heuristic, one of the mostly used greedy-add heuristics for this problem. The innovation consists basically of selecting edges only inside ellipses when the vehicle is near the end of each route. This new approach was implemented and tested on three standard datasets and the solutions are compared against: (i) the original path-scanning heuristic; (ii) two other path-scanning heuristics and (iii) the three best known metaheuristics. The results indicate that the ''ellipse rule'' approach lead to improvements over the three path-scanning heuristics, reducing the average distance to the lower bound in the test problems by about 44%.