Augment-insert algorithms for the capacitated arc routing problem
Computers and Operations Research
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
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Transportation Science
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
Lower and upper bounds for the mixed capacitated arc routing problem
Computers and Operations Research
New lower bound for the capacitated arc routing problem
Computers and Operations Research
Heuristics for a dynamic rural postman problem
Computers and Operations Research
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
Infeasible/feasible search trajectories and directional rounding in integer programming
Journal of Heuristics
An improved heuristic for the capacitated arc routing problem
Computers and Operations Research
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
Lower bounds for the mixed capacitated arc routing problem
Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Computers and Operations Research
The open capacitated arc routing problem
Computers and Operations Research
Path-relinking intensification methods for stochastic local search algorithms
Journal of Heuristics
Hi-index | 0.01 |
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found.