BRKGA algorithm for the Capacitated Arc Routing Problem

Electronic Notes in Theoretical Computer Science

Volumn 281, Issue , 2011, Pages 69-83

  Martinez, C ^a   Loiseau, I ^b   Resende, M G C ^c   Rodriguez, S ^a  

^a UNIVERSIDAD NACIONAL DE SALTA   (Argentina)

^b UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

BRKGA; CARP; metaheuristics; vehicle routing

Indexed keywords

BRKGA; CAPACITATED ARC ROUTING PROBLEM; CARP; COMPUTATIONAL TIME; LOCAL SEARCH; META HEURISTICS; METAHEURISTIC; METER READINGS; OBJECTIVE FUNCTION VALUES; RANDOM KEYS; REAL-WORLD SCENARIO; STREET SWEEPING; URBAN WASTES;

COMPUTER SCIENCE; VEHICLE ROUTING;

ALGORITHMS;

EID: 84855272538     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2011.11.026     Document Type: Conference Paper

References (30)

1. J. Bean Genetic algorithms and random keys for sequencing and optimization ORSA Journal on Computing 6 1994 154 160
2. J. Belenguer, and E. Benavent A Cutting Plane algorithm for the capacitated arc routing problem Computers and Operations Research 30 2003 705 720
3. E. Benavent, V. Campos, A. Corberán, and E. Mota The capacitated arc routing problem: lower bounds Networks 22 1992 669 690
4. P. Beullens, L. Muyldermans, D. Cattrysse, and D. Van Oudheusden A Guided Local Search heuristic for the capacitated arc routing problem European Journal of Operational Research-Discrete Optimization 147 2003 629 643
5. J. Brandão, and R. Eglese A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP) Computers and Operations Research 35 4 2008 1112 1126 (Pubitemid 47558960)
6. A. Del Pia, and C. Filippi A Variable Neighborhood Descent algorithm for a real waste collection problem with mobile depots International transactions in Operational Research 13 2006 125 141 (Pubitemid 43405835)
7. M. Dorigo, and T. Stützle Ant Colony Optimization 1st Ed. 2004 MIT Press Massachusetts
8. R. Eglese Routing winter gritting vehicles Discrete applied mathematics 48 3 1994 231 244
9. M. Ericsson, M. Resende, and P. Pardalos A genetic algorithm for the weight setting problem in OSPF routing Journal of Combinatorial Optimization 6 2002 299 333 (Pubitemid 34474871)
10. D. Goldberg Genetic algorithms in search, optimization and machine learning 1st Ed. 1989 Addison-Wesley Massachusetts
11. B. Golden, J. DeArmon, and E. Baker Computational experiments with algorithms for a class of routing problems Computers and Operations Research 10 1 1983 47 59 (Pubitemid 13493950)
12. B. Golden, and R. Wong Capacitated arc routing problems Networks 11 1981 305 315
13. J.F. Gonçalves A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem European Journal of Operational Research 183 2007 1212 1229 (Pubitemid 47030736)
14. J.F. Gonçalves, and J. Almeida A hybrid genetic algorithm for assembly line balancing Journal of Heuristics 8 2002 629 642 (Pubitemid 35338030)
15. J.F. Gonçalves, and M.G.C. Resende An evolutionary algorithm for manufacturing cell formation Computers and Industrial Engineering 47 2004 247 273
16. J.F. Gonçalves, and M.G.C. Resende Biased random-key genetic algorithms for combinatorial optimization Journal of Heuristics 17 2011 487 525
17. Gonçalves, J. F.; M. Resende, and J. Almeida, A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem, Journal of Heuristics published Online (2010).
18. M. Haimovich, and A. Kan Bounds and heuristics for capacitated routing problems Mathematics of Operations Research 10 1985 527 542 (Pubitemid 15600819)
19. A. Hertz, G. Laporte, and M. Mittaz A Tabu Search heuristic for the capacitated arc routing problem Operations Research 48 2000 129 135
20. A. Hertz, and M. Mittaz A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem Transportation Science 35 4 2001 425 434 (Pubitemid 34125359)
21. R. Hirabayashi, Y. Saruwatari, and N. Nishida Tour construction algorithm for the capacitated arc routing problem Asia-Pacific Journal of Operational Research 9 1992 155 175
22. H. Hoos, and T. Stützle Stochastic Local Search Foundations and Applications 1st Ed. 2005 McGraw-Hill San Francisco
23. P. Lacomme, C. Prins, and A. Tanguy First Competitive Ant Colony Scheme for the CARP Lecture Notes in Computer Science 3172 2004 426 427 (Pubitemid 39210744)
24. Maniezzo, V.; Algorithms for large directed CARP instances: urban solid waste collection operational support, University of Bologna, Department of Computer Science, Technical Report UBLCS-2004-16.
25. L. Muydelrmans, D. Cattrysse, D. Van Oudheusden, and T. Lotan Districting for salt spreading operations European Journal of Operational Research 139 2002 521 532 (Pubitemid 34249630)
26. F. Samanlioglu, W. Ferrell, and M. Kurz A memetic random-key genetic algorithm for a symmetric multi-objective salesman problem Computers and Industrial Engineering 55 2008 439 449
27. L. Snyder, and M. Daskin A random key genetic algorithm for the generalized traveling salesman problem European Journal of Operational Research 174 2006 38 53 (Pubitemid 44883185)
28. Spears, W.; and K. DeJong, On the Virtues of Parameterized Uniform Crossover, Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego-USA (1991), 230-236.
29. G. Ulusoy The fleet size and mixed problem for capacitated arc routing European Journal of Operational Research 22 1985 329 337 (Pubitemid 15602978)
30. Zhu, Z.; X. Li, Y. Yang, X. Deng, M. Xia, and Z. Xie, A hybrid genetic algorithm for the multiple depot capacitated arc routing problem, Proceedings of the IEEE International Conference on Automation and Logistics, Jinan-China (2007), 2252-2258.