Augment-insert algorithms for the capacitated arc routing problem
Computers and Operations Research
Routing winter gritting vehicles
CO89 Selected papers of the conference on Combinatorial Optimization
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Improving Street Based Routing Using Building Block Mutations
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Solving a Real World Routing Problem Using Multiple Evolutionary Agents
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A cutting plane algorithm for the capacitated arc routing problem
Computers and Operations Research
New heuristic algorithms for the windy rural postman problem
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Lower and upper bounds for the mixed capacitated arc routing problem
Computers and Operations Research
A tabu search algorithm for the min-max k-Chinese postman problem
Computers and Operations Research
A genetic algorithm for a bi-objective capacitated arc routing problem
Computers and Operations Research
Speeding up evolutionary algorithms through asymmetric mutation operators
Evolutionary Computation
Solving an urban waste collection problem using ants heuristics
Computers and Operations Research
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
Computers and Operations Research
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
New heuristic algorithms for the windy rural postman problem
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
A guided local search procedure for the multi-compartment capacitated arc routing problem
Computers and Operations Research
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
New upper bounds for the multi-depot capacitated arc routing problem
International Journal of Metaheuristics
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
Engineering Applications of Artificial Intelligence
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”
SIM-RandSHARP: a hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands
Proceedings of the Winter Simulation Conference
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
The double layer optimization problem to express logistics systems and its heuristic algorithm
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The NP-hard Capacitated Arc Routing Problem (CARP) allows to model urban waste collection or road gritting, for instance. Exact algorithms are still limited to small problems and metaheuristics are required for large scale instances. The paper presents the first genetic algorithm (GA) published for the CARP. This hybrid GA tackles realistic extensions like mixed graphs or prohibited turns. It displays excellent results and outperforms the best metaheuristics published when applied to two standard sets of benchmarks: the average deviations to lower bounds are 0.24 % and 0.69 % respectively, a majority of instances are solved to optimality, and eight best known solutions are improved.