BRKGA Algorithm for the Capacitated Arc Routing Problem

Authors:
C. Martinez;I. Loiseau;M. G. C. Resende;S. Rodriguez
Affiliations:
Departamento de Informática, Facultad de Ciencias Exactas Universidad Nacional de Salta, Argentina;Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina;AT&T Labs Research, Florham Park - NJ, USA;Departamento de Informática, Facultad de Ciencias Exactas Universidad Nacional de Salta, Argentina
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 12
Cited 0

Routing winter gritting vehicles

CO89 Selected papers of the conference on Combinatorial Optimization
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Hybrid Genetic Algorithm for Assembly Line Balancing

Journal of 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
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

Transportation Science
Ant Colony Optimization

Ant Colony Optimization
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
An evolutionary algorithm for manufacturing cell formation

Computers and Industrial Engineering
A deterministic tabu search algorithm for the capacitated arc routing problem

Computers and Operations Research
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem

Computers and Industrial Engineering
Biased random-key genetic algorithms for combinatorial optimization

Journal of Heuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a new algorithm for the Capacitated Arc Routing Problem (CARP). Our motivation to deal with this problem is related to its application in several real world scenarios such as street sweeping, urban waste collection and electric meter reading just to mention a few. Based on BRKGA metaheuristic, our algorithm introduces a new random key encoding for CARP, mutation to random keys strings, a restart phase to avoid stagnation and local search. The algorithm was tested with several well-known instances from the literature. The results obtained were competitive in terms of objective function value and required computational time.