Hybrid genetic algorithm for vehicle routing and scheduling problem

Journal of Applied Sciences

Volumn 9, Issue 1, 2009, Pages 79-87

  Ghoseiri, Keivan ^a   Ghannadpour, S F ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

interchange mechanism; Genetic algorithm; Push forward insertion heuristic; Vehicle routing problem with time windows

Indexed keywords

HYBRID GENETIC ALGORITHMS; INTEGER REPRESENTATION; INTERCHANGE MECHANISM; META-HEURISTIC METHODS; PUSH FORWARD INSERTION HEURISTIC; VEHICLE ROUTING AND SCHEDULING; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

FLEET OPERATIONS; GENETIC ALGORITHMS; HEURISTIC METHODS; SALES; VEHICLE ROUTING;

INTERCHANGES;

EID: 63049098765     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2009.79.87     Document Type: Article

References (28)

1. Achutan, N., L. Caccettal and S. Hill, 2003. An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transport. Sci., 37: 153-169.
2. Alvarenga G.B., G.R. Mateus and G. de Tomi, 2007. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Operat. Res., 34: 1561-1584.
3. Berger, J. and M. Barkaoui, 2003. A hybrid genetic algorithm for the capacitated vehicle routing problem. Genetic and Evolutionary Computation Conference (GECCO03), LNCS 2723, January 01, Springer-Verlag, Chicago, pp: 646-656.
4. Blanton, J.L., Jr. and R.L. Wainwright, 1993. Multiple vehicles routing with time and capacity constraints using genetic algorithms. Proceedings of the 5th International Conference on Genetic Algorithms, June 1993, USA., pp: 452-459.
5. Bräysy, O. and M. Gendreau, 2002. Tabu search heuristics for the vehicle routing problem with time windows. TOP., 10: 211-237.
6. Bräysy, O. and M. Gendreau, 2005. Vehicle routing problem with time windows, Part II: Metaheuristics. Transport. Sci., 39: 119-139.
7. Cerda, J. and R. Dondo, 2007. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Operat. Res., 176: 1478-1507.
8. Correa, E.S., M.T.A. Steiner, A.A. Freitas and C. Carnieri, 2001. A genetic algorithm for the P-median problem. Genetic and Evolutionary Computation Conference (GECCO2001), July, San Francisco, California, USA., pp: 1268-1275.
9. Crevier, B., J.F. Cordeau and G. Laporte, 2007. The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Operat. Res., 176: 756-773.
10. Czech, Z.J. and P. Czarnas, 2002. Parallel simulated annealing for the vehicle routing problem with time windows. 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, January 9-11, Canary Islands, Spain, pp: 376-383.
11. De Backer, B., V. Furnon, P. Shaw, P. Kilby and P. Prosser, 2000. Solving vehicle routing problems using constraint programming and metaheuristics. J. Heuristics, 6: 501-523.
12. Gambardella, L.M., E. Taillard and G. Agazzi, 1999. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: New Ideas in Optimization, David, C., M. Dorigo and F. Glover (Eds.). McGraw-Hill, London, ISBN: 0-07-709506-5, pp: 63-76.
13. Holland, J.H., 1992. Adaptation in Natural and Artificial System. 2nd Edn., University of Michigan Press, Ann Arbor, Michigan, ISBN: 0-262-58111-6.
14. Irnich, S., B. Funke and T. Grunert, 2006. Sequential search and its application to vehicle routing problems. Comput. Operat. Res., 33: 2405-2429.
15. Kim, B.I., S. Kim and S. Sahoo, 2006. Waste collection vehicle routing problem with time windows. Comput. Operat. Res., 33: 3624-3642.
16. Laporte, G. and F. Semet, 2001. Classical Heuristics for Capacitated VRP. 1st Edn., Society for Industrial and Applied Mathematics, Philadelphia, PA, USA., ISBN: 0-89871-498-2, pp: 109-128.
17. Li, F., B. Golden and E. Wasil, 2005. Very large scale vehicle routing: new test problems algorithms and results. Comput. Operat. Res., 32: 1165-1179.
18. Ombuki, B., B. Ross and F. Hanshar, 2006. Multi-objective genetic algorithm for vehicle routing problem with time windows. Applied Intell, 24: 17-30.
19. Petch, R.J. and S. Salhi, 2003. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Math., 133: 69-92.
20. Pisinger, D. and S. Ropke, 2005. A general heuristic for vehicle routing problems. Comput. Operat. Res., 34: 2403-2435.
21. Rochat, Y. and E.D. Taillard, 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics, 1: 147-167.
22. 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, January 01, Springer-Verlag, pp: 417-431.
23. Solomon, M.M., 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operat. Res., 35: 254-265.
24. Tan, K.C., L.H. Lee, K.Q. Zhu and K. Qu, 2001. Heuristic methods for vehicle routing problem with time windows. Artificial Intell. Eng., 15: 281-295.
25. Tan, K.C., Y.H. Chew and L.H. Lee, 2006. A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl, 34: 115-151.
26. Tan, K.C., C.Y. Cheong and C.K. Goh, 2007. Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. Eur. J. Operat. Res., 177: 813-839.
27. Thangiah, S.R., 1999. A Hybrid Genetic Algorithms, Simulated Annealing and Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. In: In Practical Handbook of Genetic Algorithms, Complex Structures, Chambers, L. (Ed.). Vol. 3, CRC Press, New York, ISBN-10: 0849325390, pp: 347-381.
28. Wren, A., 1971. Computers in Transport Planning and Operation. 1st Edn, Ian Allan Shepperton, London, ISBN: 711002355.