Optimized crossover genetic algorithm for vehicle routing problem with time windows

American Journal of Applied Sciences

Volumn 7, Issue 1, 2010, Pages 95-101

  Nazif, H ^a   Lee, L S ^a  

^a UNIVERSITY PUTRA MALAYSIA   (Malaysia)

Author keywords

Genetic algorithm; Time windows; Vehicle routing problem

Indexed keywords

EID: 77953735424     PISSN: 15469239     EISSN: 15543641     Source Type: Journal    
DOI: 10.3844/ajassp.2010.95.101     Document Type: Article

References (32)

1. Aggarwal, C.C., J.B. Orlin and R.P. Tai, 1997. Optimized crossover for the independent set problem. Operat. Res., 45: 226-234. DOI: 10.1287/opre.45.2.226
2. Bent, R. and P. Van Hentenryck, 2004. A two-stage hybrid local search for the vehicle routing problem with time windows. Transport. Sci., 38: 515-530. DOI: 10.1287/trsc.1030.0049
3. Berger, J. and M. Barkaoui, 2000. An improved hybrid genetic algorithm for the vehicle routing problem with time windows. Proceeding of the International ICSC Symposium on Computational Intelligence, Part of the International ICSC Congress on Intelligent Systems and Applications, Dec. 11-15, University of Wollongong, Wollongong, Australia. http:///www.proceedings.com/00444.html
4. Berger, J. and M. Barkaoui, 2004. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Comput. Operat. Res., 31: 2037-2053. DOI: 10.1016/S0305-0548(03)00163-1
5. Berger, J., M. Salois and R. Begin, 1998. A hybrid genetic algorithm for the vehicle routing problem with time windows. Lecture Notes Artifi. Intell., 1418: 114-127. DOI: 10.1007/3-540-64575-6_44
6. Berger, J., M. Sassi and M. Salois, 1999. A hybrid genetic algorithm for the vehicle routing problem with time windows and itinerary constraints. Proceedings of the Conference on Genetic and Evolutionary Computation, July 13-17, Orlando, USA., pp: 44-51. http:///www.alibris.com/search/books/isbn/1558606114
7. th International Conference on Genetic Algorithms, June 1993, Morgan Kaufmann, San Francisco, pp. 452-459. ISBN: 1-55860-299-2. http://portal.acm.org/citation.cfm?id=645513.657758.
8. Bräysy, O. and M. Gendreau, 2005. Vehicle routing problem with time windows, Part II: Metaheuristics. Transport. Sci., 39: 119-139. DOI: 10.1287/trsc.1030.0057
9. Bräysy, O., J. Berger and M. Barkaoui, 2000. A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. Proceedings of the International Workshop on Vehicle Routing and Related Areas, Aug. 16-19, Skodsborg, Denmark. http://74.125.155.132/scholar?q=cache:05I0XxcO08UJ:scholar.google.com/+Berger,+J.+and+M.+Barkaoui,+2000&hl=en&as_sdt=2000
10. Chiang, W.C. and R.A. Russell, 1997. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. Inform. J. Comput., 9: 417-430. DOI: 10.1287/ijoc.9.4.417
11. Cordeau, J.F., G. Desaulniers, J. Desrosiers, M.M. Solomon and F. Soumis, 2002. The VRP with Time Windows. In: The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Toth, P. and D. Vigo (Eds.). Philadelphia, USA., ISBN: 0-89871-498-2, pp: 157-193.
12. Cordeau, J.F., G. Laporte and A. Mercier, 2001. A unified tabu search heuristic for vehicle routing problem with time windows. J. Operat. Res. Soc., 52: 928-936. DOI: 10.1057/palgrave.jors.2601163
13. Czarnas, P., Z.J. Czech and P. Gocyła, 2004. Parallel simulated annealing for bicriterion optimization problems. Lecture Notes Comput. Sci., 3019: 233-240. DOI: 10.1007/b97218
14. Czech, Z.J. and P. Czarnas, 2002. A parallel simulated annealing for the vehicle routing problem with time windows. Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, Jan. 2002, Canary Island, Spain, pp: 376-383. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.100.8805&rep=rep1&type=pdf
15. Desrosiers, J., Y. Dumas, M.M. Solomon and F. Soumis, 1995. Time Constrained Routing and Scheduling. In: Handbooks in Operations Research and Management Science, Network Routing, Ball, M.O., T.L. Magnanti, C.L. Monma and G.L. Nemhauser (Eds.). Amsterdam, North-Holland, ISBN: 10: 0444821414, pp: 35-139.
16. Gambardella, L.M., É. Taillard, and G. Agazzi, 1999. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: New Ideas in Optimization, Corne, D., M. Dorigo and F. Glover (Eds.). McGraw-Hill, London, ISBN: 0-07-709506-5, pp: 63-76.
17. Gehring, H. and J. Homberger, 2002. Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heurist., 8: 251-276. DOI: 10.1023/A:1015053600842
18. Holland, J.H., 1975. Adaptations in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, ISBN: 0-262-58111-6.
19. Ibaraki, T., M. Kubo, T. Masuda, T. Uno and M. Yagiura, 2001. Effective local search algorithms for the vehicle routing problem with general time windows. Working Paper, Department of Applied Mathematics and Physics, Kyoto University, Japan.http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.6.3356&rep=rep1&type=pdf
20. Liu, F.H. and S.Y. Shen, 1999. A route-neighborhood-based metaheuristic for vehicle routing problems with time windows. Eur. J. Operat. Res., 118: 485-504. DOI: 10.1016/S0377-2217(98)00315-4
21. Mester, D., 2002. An Evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions. Working Paper, Institute of Evolution, University of Haifa, Israel. http:///www.top.sintef.no/vrp/bknown8.html
22. Potvin, J.Y. and S. Bengio, 1996. The vehicle routing problem with time windows, Part II: Genetic search. Inform. J. Comput., 8: 165-172. DOI: 10.1287/ijoc.8.2.165
23. Rochat, Y. and É. Taillard, 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heurist., 1: 147-167. DOI: 10.1007/BF02430370
24. Rousseau, L.M., M. Gendreau and G. Pesant, 1999. Using constraint-based operators with variable neighborhood search to solve the vehicle routing problem with time windows. Proceedings of the 1st Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Feb. 1999, University of Ferrara, Italy. http://citeseer.ist.psu.edu/old/406681.html
25. Schrimpf, G., J. Schneider, H. Stamm Wilbrandt and G. Dueck, 2000. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys., 159: 139-171. DOI: 10.1006/JCPH.1999.6413
26. Shaw, P., 1997. A new local search algorithm providing high quality solutions to vehicle routing problems. Working Paper, University of Strathclyde, Glasgow, Scotland. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.51.1273&rep=rep1&type=pdf
27. Shaw, P., 1998. Using constraint programming and local search methods to solve vehicle routing problems. Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, Oct. 26-30, Springer- Veelag, Berlin/Heidelberg, London, UK., pp. 417-431. http://portal.acm.org/citation.cfm?id=726320
28. Solomon, M.M., 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operat. Res., 35: 254-265. DOI: 10.1287/opre.35.2.254
29. Taillard, É., P. Badeau, M. Gendreau, F. Guertin and J.Y. Potvin, 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportat. Sci., 31: 170-186. DOI:10.1287/trsc.31.2.170
30. Tan, K.C., L.H. Lee and K. Ou, 2001. Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacif. J. Operat. Res., 18: 121-130.http://direct.bl.uk/bld/PlaceOrder.do?UIN=097067636&ETOC=RN&from=searchengine
31. Tan, K.C., L.H. Lee, Q.L. Zhu and K. Ou, 2001. Heuristic method for vehicle routing problem with time windows. Artifi. Intel. Eng., 15: 281-295. DOI: 10.1016/S0954-1810(01)00005-X
32. Thangiah, S., 1995. Vehicle Routing with Time Windows Using Genetic Algorithms. In: Application Handbook of Genetic Algorithms: New Frontiers, Chambers, L. (Ed.). CRC Press, Boca Raton, ISBN: 0849325196, pp: 253-277.