Evolutionary algorithms for stochastic arc routing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3005, Issue , 2004, Pages 501-512

  Fleury, Gérard ^a   Lacomme, Philippe ^a   Prins, Christian ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COSTS; NETWORK ROUTING; OPTIMIZATION; STOCHASTIC SYSTEMS; WASTE MANAGEMENT;

ARC ROUTING PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; LIMITED CAPACITY; MATHEMATICAL EXPRESSIONS; MEMETIC ALGORITHMS; RANDOM FLUCTUATION; WASTE COLLECTION;

EVOLUTIONARY ALGORITHMS;

EID: 35048870799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24653-4_51     Document Type: Article

References (16)

1. A. Amberg and S. Voß. A hierarchical relaxations lower bound for the Capacitated Arc Routing Problem. In R.H. Sprague (Hrsg.), editor, 35th Annual Hawaii Int. Conf. on Systems Sciences, pages DTIST02:1-10, Piscataway, 2002. IEEE.
2. J.M. Belenguer and E. Benavent. A cutting plane algorithm for the Capacitated Arc Routing Problem. Computers and Operations Research, 30(5):705-728, 2003.
3. 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, 147(3) :629-643, 2003.
4. J. Branke. Creating robust solutions by means of evolutionary algorithms. In A.E. Eiben et al., editor, Parallel Problem Solving from Nature V, Lecture Notes in Computer Science 1498, pages 119-128. Springer, 1998.
5. G. Fleury, P. Lacomme, C. Prins, and W. Ramdane-Chérif. Improving robustness of solutions to arc routing problems. J. Oper. Res. Soc., 2004. To appear.
6. B.L. Golden, J.S. DeArmon, and E.K. Baker. Computational experiments with algorithms for a class of routing problems. Comp. Oper. Res., 10(1):47-59, 1983.
7. B.L. Golden and R.T. Wong. Capacitated arc routing problems. Networks, 11:305315, 1981.
8. P. Greistorfer. A tabu-scatter search metaheuristic for the arc routing problem. Computers and Industrial Engineering, 44(2):249-266, 2003.
9. A. Hertz, G. Laporte, and M. Mittaz. A tabu search heuristic for the Capacitated Arc Routing Problem. Operations Research, 48(1):129-135, 2000.
10. P. Lacomme, C. Prins, and W. Ramdane-Chérif. A genetic algorithm for the CARP and its extensions. In E.J.W. Boers et al., editor, Applications of evolutionnary computing-EvoWorkshops 2001, Lecture Notes in Computer Science 2037, pages 473-483. Springer, 2001.
11. P. Lacomme, C. Prins, and W. Ramdane-Chérif. Competitive memetic algorithms for arc routing problems. Annals of Operations Research, 2004. To appear.
12. G. Laporte M. Gendreau and R. Séguin. Stochastic vehicle routing. European Journal of Operational Research, 88:3-12, 1996.
13. P. Moscato. Memetic algorithms: a short introduction. In D. Corne et al., editor, New ideas in optimization, pages 219-234. McGraw-Hill, 1999.
14. Y. Saruwatari R. Hirabayashi and N. Nishida. Tour construction algorithm for the carp. Asia-Pacific Journal of Oper. Res., 9:155-175, 1992.
15. S. Tsutsui and A. Gosh. Genetic algorithms with a robust solution searching scheme. IEEE Transactions on Evolutionary Computations, 1:201-208, 1997.
16. G. Ulusoy. The fleet size and mix problem for capacitated arc routing. European Journal of Operational Research, 22:329-337, 1985.