References
- Xiaohong X (1999). A spatial decision support system for designing solid waste collection routes in rural countries. Master's thesis, University of Tennessee, Knoxville.
- EgleseRWRouteing winter gritting vehiclesDis Appl Math19944823124410.1016/0166-218X(92)00003-5
- LiLYOEgleseRWAn interactive algorithm for vehicle routeing for winter-grittingJ Opl Res Soc19964721722810.1057/jors.1996.56
- LenstraJKRinnooy KanAHGOn general routing problemsNetworks1976627328010.1002/net.3230060305
- LacommePPrinsCRamdane-CherifWA genetic algorithm for the capacitated arc routing problem and its extensionsApplications of Evolutionary Computing2001473483
- 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.
- HertzALaporteGMittazMA tabu search heuristic for the capacitated arc routing problemOpns Res20004812913510.1287/opre.48.1.129.12455
- GendreauMLaporteGSéguinRAn exact algorithm for the Vehicle Routing Problem with stochastic customers and demandsTransp Sci19952914315510.1287/trsc.29.2.143
- LaporteGLouveauxFVSolving stochastic routing problems with the integer L-shaped methodFleet Management and Logistics1998159167
- 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.
- Fleury G (1993). Méthodes stochastiques et déterministes pour les problèmes NP-Difficiles. PhD thesis, University Blaise Pascal, Clermont-Ferrand, France.
- TsutsuiAGhoshAGenetic algorithms with a robust solution searching schemeIEEE Trans Evol Comput1997120120810.1109/4235.661550
- BrankeJCreating robust solutions by means of evolutionary algorithmsParallel Problem Solving from Nature (PPSN’98)1998119128
- BelenguerJMBenaventEA cutting plane algorithm for the capacitated arc routing problemComput Opns Res200330570572810.1016/S0305-0548(02)00046-1
- EgleseRWLiLYOA tabu search based heuristic for arc routing with a capacity constraint and time deadlineMetaheuristics: Theory and Applications1996633650
- 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.
- Cerf R (1994). Une théorie asymptotique des algorithmes génétiques PhD thesis, University of Montpellier II, France.