Improving robustness of solutions to arc routing problems

Journal of the Operational Research Society

Volumn 56, Issue 5, 2005, Pages 526-538

  Fleury, G ^a   Lacomme, P ^a   Prins, C ^b   Ramdane Cherif W ^c  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^c Campus Scientifique ^*  (France)

Author keywords

Genetic algorithms; Optimisation; Robustness; Sensitivity analysis; Stochastic capacitated arc routing problem; Vehicle routeing

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); ROUTERS; SENSITIVITY ANALYSIS;

ARC ROUTING; HYBRID GENETIC ALGORITHMS (HGA); STOCHASTIC CAPACITATED ARC ROUTING PROBLEM; VEHICLE ROUTING;

GROUND VEHICLES;

EID: 17644408719     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601822     Document Type: Article

References (17)

1. Xiaohong X (1999). A spatial decision support system for designing solid waste collection routes in rural countries. Master's thesis, University of Tennessee, Knoxville.
2. Eglese RW (1994). Routeing winter gritting vehicles. Dis Appl Math 48: 231-244.
3. Li LYO and Eglese RW (1996). An interactive algorithm for vehicle routeing for winter-gritting. J Opl Res Soc 47: 217-228.
4. Lenstra JK and Rinnooy Kan AHG (1976). On general routing problems. Networks 6: 273-280.
5. Lacomme P, Prins C and Ramdane-Cherif W (2001). A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers EJW (ed). Applications of Evolutionary Computing, Lecture Notes in Computer Science, No. 2037. Springer, Berlin, pp 473-483.
6. Oliver IM, Smith DJ and Holland JRC (1987). A study of permutation crossover operators on the traveling salesman problem. In: Grefenstette JJ (ed). Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Erlbaum: Hillsdale, NJ, pp 224-230.
7. Hertz A, Laporte G and Mittaz M (2000). A tabu search heuristic for the capacitated arc routing problem. Opns Res 48: 129-135.
8. Gendreau M, Laporte G and Séguin R (1995). An exact algorithm for the Vehicle Routing Problem with stochastic customers and demands. Transp Sci 29: 143-155.
9. Laporte G and Louveaux FV (1998). Solving stochastic routing problems with the integer L-shaped method. In: Crainic TG and Laporte G (eds). Fleet Management and Logistics. Kluwer Academic Publishers, Boston, pp 159-167.
10. Verweij B, Ahmed S, Kleywegt A, Nemhauser G and Shapiro A (2001). The sample average approximation method applied to stochastic routing problems: a computational study. Technical report, The Logistic Institute, Georgia Tech.
11. Fleury G (1993). Méthodes stochastiques et déterministes pour les problèmes NP-Difficiles. PhD thesis, University Blaise Pascal, Clermont-Ferrand, France.
12. Tsutsui A and Ghosh A (1997). Genetic algorithms with a robust solution searching scheme. IEEE Trans Evol Comput 1: 201-208.
13. Branke J (1998). Creating robust solutions by means of evolutionary algorithms. In: Eiben AE, Back T, Schoenauer M and Schwefel HP (eds). Parallel Problem Solving from Nature (PPSN'98), Lecture Notes in Computer Science, No. 1498. Springer, Berlin, pp 119-128.
14. Belenguer JM and Benavent E (2003). A cutting plane algorithm for the capacitated arc routing problem. Comput Opns Res 30(5): 705-728.
15. Eglese RW and Li LYO (1996). A tabu search based heuristic for arc routing with a capacity constraint and time deadline. In: Osman IH and Kelly JP (eds). Metaheuristics: Theory and Applications. Kluwer Academic Publishers, Boston, MA, pp 633-650.
16. DeArmon JS (1981). A comparison of heuristics for the capacitated Chinese postman problem. Master's thesis, The University of Maryland at College Park, MD, USA.
17. Cerf R (1994). Une théorie asymptotique des algorithmes génétiques PhD thesis, University of Montpellier II, France.