Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm

Applied Soft Computing Journal

Volumn 10, Issue 4, 2010, Pages 1096-1107

  Ghoseiri, Keivan ^a,b   Ghannadpour, Seyed Farid ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Genetic algorithm; Goal programming (gp); Multiple objective optimization; Pareto ranking; Vehicle routing problem with time; Windows (vrptw)

Indexed keywords

DECISION MAKING; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; LINEAR PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; PARETO PRINCIPLE; ROUTING ALGORITHMS; VEHICLES;

EFFICIENT GENETIC ALGORITHMS; GOAL PROGRAMMING; MULTI-OBJECTIVE PROBLEM; MULTIPLE-OBJECTIVE OPTIMIZATION; PARETO RANKING; PUSH FORWARD INSERTION HEURISTIC; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 78049241435     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2010.04.001     Document Type: Article

References (54)

1. A. Chames, W.W. Cooper, R. Ferguson, Optimal estimation of executive compensation by linear programming. Management Science 1 (1955) 138-151.
2. A. Chames, W.W. Cooper, Management Models and Industrial Applications of Linear Programming, Wiley, New York, 1961.
3. B. Crevier, J.F. Cordeau, G. Laporte, The multi-depot vehicle routing problem with inter-depot routes, European Journal of Operational Research 176 (2007) 756-773. (Pubitemid 44537609)
4. B. De Backer. V. Furnon, P. Shaw, P. Kilby. P. Prosser, Solving vehicle routing problems using constraint programming and metaheuristics, Journal of Heuristics 6 (2000) 501-523.
5. B.I. Kim, S. Kim, S. Sahoo, Waste collection vehicle routing problem with time windows, Computers 8> Operations Research 33 (2006) 3624-3642.
6. B.L. Golden, A.A. Assad, Vehicle Routing: Methods and Studies, North Holland, Amsterdam, 1988.
7. B. Ombuki. B. Ross, F. Hanshar, Multi-objective genetic algorithm for vehicle routing problem with time windows, Applied Intelligence 24 (2006) 17-30. (Pubitemid 43130238)
8. B. Ombuki, M. Nakamura, O. Maeda, A hybrid search based on genetic algorithms and tabu search for vehicle routing, in: A.B. Banff, H. Leung (Eds.), Proceedings of the 6th IASTED International Conference On Artificial Intelligence and Soft Computing (ASC 2002), ACTA Press, 2002, pp. 176-181.
9. C. Romero, Handbook of Critical Issues in Goal Programming, Pergamon Press, Oxford, 1991.
10. D. Pisinger, S. Ropke. A General Heuristic for Vehicle Routing Problem, Department of Computer Science, University of Copenhagen, 2005.
11. D.F. Jones. M. Tamiz, Coal programming in the period 1990-2000, in: M. Ehrgott, X. Gandibleux (Eds.), in Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys, Kluwer, 2002, pp. 129-170.
12. E.D. Taillard. P. Badeau, M. Gendreau, F. Gueritin. J.-Y. Potvi, A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science 31 (1997) 170-186. (Pubitemid 127597092)
13. F. Li, B. Golden, E. Wasil, very large scale vehicle routing: new test problems algorithms and results, Computers & Operations Research 32 (2005) 1165-1179.
14. G.B Alvarenga, G.R. Mateus, G. de Tomi, A genetic and set partitioning twophase approach for the vehicle routing problem with time windows, Computers & Operation Research 34 (2007) 1561-1584. (Pubitemid 44556982)
15. G. Laporte, F. Semet, Classical Heuristics for the Vehicle Routing Problem, Les Cahiers du CERAD, G98-54, Croup for Research in Decision Analysis, Montreal, Canada, 1999.
16. H.I. Calvete. C. Galé, MJ. Oliveros, B.S. Valverde, A goal programming approach to vehicle routing problems with soft time windows, European Journal of Operational Research 117 (2007) 1720-1733. (Pubitemid 44709444)
17. H. Ishibashi, H. Aguirre, K. Tanaka, T. Sugimura, Multi-objective optimization with improved genetic algorithm, in: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC), Nashville, 2000, pp. 3852-3857.
18. J. Berger, M. Barkaoui, O. Bräysy, A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows, Working paper, Defense Research Establishment Valcartier, Canada, 2001.
19. J. Berger, M. Barkaoui, A hybrid genetic algorithm for the capacitated vehicle routing problem, in: E. Cantu-Paz (Ed.), CECCO03. LNCS 2723, Springer-Verlag, Chicago, 2003.
20. J. Cerda, R. Dondo, A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows, European Journal of Operational Research 176 (2007) 1478-1507. (Pubitemid 44573667)
21. J.F. Cordeau. G. Larporte, A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows, Journal of the Operational Research Society 52 (2001) 928-936. (Pubitemid 32720268)
22. J.D. Knowles, D.W. Corne, Approximating the nondominated front using Pareto archived evolutionary strategy, Evolutionary Computation 8 (2000) 149-172.
23. J. Desrosier, Y. Dumas, M. Solomon, F. Soumis, in: M. Ball (Ed.), Time Constraint Routing and Scheduling, Handbooks in Operations Research and Management Science 8: Network Routing, Elsevier Science Publisher, Amsterdam, 1995, pp. 35-139.
24. J.H. Holland, Adaptation in Natural and Artificial System, The University of Michigan Press, Ann Arbor, Michigan, 1975.
25. J.L. Blanton Jr., R.L. Wainwright, Multiple vehicles routing with time and capacity constraints using genetic algorithms, in: Proceedings of the Fifth International Conference on Genetic Algorithms, 1993, pp. 452-459.
26. J. Larsen, Parallelization of the vehicle routing problem with time windows, Ph.D. thesis. IMM-PHS-1999-62, Department of Mathematical Modelling, Technical University of Denmark, Lynghy, Denmark, 1999.
27. J. Louis. X. Yin, Z.Y. Yuan, Multiple Vehicle Routing Problem With Time Windows Using Genetic Algorithm, Genetic Adaptive System LAB, Department of Computer Science, University of Nevada, Reno, 1999.
28. J.P. Ignizio, Coal Programming and Extensions, Lexington Books, Lexington, MA, 1976.
29. J.Y. Potvin, S. Bengio, The vehicle routing problem with time windows. Part II. Genetic search, INFORMS Journal of Computing 8 (1996) 165-172. (Pubitemid 126681528)
30. K.C. Tan, L.H. Lee, K.Q. Zhu, K. Qu, Heuristic methods for vehicle routing problem with time windows, Artificial Intelligence in Engineering 15 (2001) 281-295. (Pubitemid 33039202)
31. K.C. Tan, Y.H. Chew, L.H. Lee, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Computational Optimization and Applications 34 (2006) 115-151. (Pubitemid 43723965)
32. K.C. Tan, L.L. Hay. O. Ke., A hybrid genetic algorithm for solving vehicle routing problems with time window constraints, Asia-Pacific Journal of Operational Research 18 (2001) 121-130. (Pubitemid 32618426)
33. K.C. Tan, C.Y. Cheong, C.K. Goh, Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation, European Journal of Operational Research 177 (2007) 139-813.
34. K.C. Tan, T.H. Lee, E.F. Khor, Evolutionary algorithm with dynamic population size and local exploration for multiobjective optimization, IEEE Transactions on Evolutionary Computation 5 (2001) 565-588.
35. L.M. Gambardella, E. Taillard, G. Agazzi, MACS-VRPT.W. A multiple ant colony system for vehicle routing problems with time windows, in: David Come, Marco Dorigo, Fred Glover (Eds.), New Ideas in Optimization, McGraw-Hill, London, 1999, pp. 63-76.
36. M. Dorigo, L.M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation 1 (1997) 53-66.
37. M. Desrochers.J. Desrosiers, M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operational Research 40 (1992) 342-354.
38. M. Gendreau, G. Laporte, J.Y. Potvin, Metaheuristics for the vehicle routing problem, Technical Report CRT-963, Centre de Recherche sur les Transports, Université de Montréal, 1999.
39. M.J. Scniederjans, Goal Programming Methodology and Applications, Kluwer publishers. Boston, 1995.
40. M.M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research 35 (1987) 254-265.
41. N. Achutan, L. Caccettal, S. Hill, An improved branch-and-cut algorithm for the capacitated vehicle routing problem, Transportation Science 37 (2003) 153-169.
42. N. Kohl. Exact methods for time constrained routing and related scheduling problems, Ph.D. Thesis, Department of Mathematical Modeling, Technical University of Denmark, 1995.
43. O. Bräysy, M. Gendreau, Metaheuristics for the Vehicle Routing Problem with Time Windows, SINTEF Applied Mathematics Research Council of Norway, 2001.
44. P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in: M. Mäher, J.-F. Puget (Eds.), in Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming, Springer-Verlag. 1998, pp. 417-431.
45. S. Irnich. B. Funke, T. Crunert, Sequential search and its application to vehicle routing problems, Computer 8i Operations Research 33 (2006) 2405-2429.
46. S. Lin, Computer solutions for traveling salesman problem, Bell System Technical Journal 44 (1965) 2245-2269.
47. S.M. Lee, Goal Programming for Decision Analysis, Auerback, Philadelphia, 1972.
48. S.R. Thangiah, A hybrid genetic algorithms, simulated annealing and tabu search heuristic for vehicle routing problems with time windows, in: L. Chambers (Ed.), Practical Handbook of Genetic Algorithms Complex Structures, vol. 3, CRC Press, 1999, pp. 347-381.
49. S. Thangiah, Vehicle routing with time windows using genetic algorithms, in: Applications Handbook of Genetic Algorithms: New Frontiers, vol. II, CRC Press, Boca Raton. 1995, pp. 253-277.
50. W.C Chiang, Russell, Simulated annealing metaheuristic for the vehicle routing problem with time windows, Annals of Operations Research 63 (1996) 3-27.
51. Y. Rochat, E.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1 (1995) 147-167.
52. Z.J. Czech, P. Czarnas, Parallel simulated annealing for the vehicle routing problem with time windows, in: Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, 2002, pp. 376-383.
53. Z. Michalewicz, Genetic Algorithms + Data Structures - Evolution Programs, 3rd ed., Springer-Verlag, New York, 1998.
54. http://web.cba.neu.edu/~msolomon/problems.htm.