Vehicle routing problems with time windows using simulated annealing

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn 1, Issue , 2006, Pages 645-650

  Lin, S W ^a   Ying, K C ^a   Lee, Z J ^a   Chen, H S ^a  

^a HUAFAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; PROBLEM SOLVING; SIMULATED ANNEALING; SUPPLY CHAIN MANAGEMENT; VEHICLE LOCATING SYSTEMS;

SOLOMONS BENCHMARK; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW);

STREET TRAFFIC CONTROL;

EID: 34548119542     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2006.384458     Document Type: Conference Paper

References (44)

1. M. Savelsbergh, "Local search for routing problems with time windows," Annals of Operations Research, vol. 4, 1985, pp. 285-305.
2. A. W. J. Kolen, A. H. G.R. Kan, and H. W. J. M. Trienekens, "Vehicle routing with time windows," Operations Research, vol.35, pp.266-273.
3. M. Desrochers, J. Desrosiers, and M. Solomon, "A new optimization algorithm for the vehicle routing problem with time windows," Operations Research, vol. 40, 1992, pp. 342-354.
4. M. Fisher, K. Jörnsten, and O. Madsen, "Vehicle routing with time windows: Two optimization algorithms," Operations Research, vol. 45, 1997, pp. 488-492.
5. G. Clarke and J. W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points," Operations Research, vol. 12, pp. 568-581, 1964.
6. B. Gillett and L. Miller, "A heuristic algorithm for the vehicle dispatch problem," Operations Research, vol. 22, pp. 340-349, 1974.
7. M. M. Solomon, "Algorithms for the vehicle routing and scheduling problems with time windows constraints," Operations Research, vol. 35, 1987, pp. 254-265.
8. R. A. Russell, "An effective heuristic for the m-tour traveling salesman problem with some side conditions," Operations Research, vol. 25, 1977, pp. 517-524.
9. T. Cook and R. A Russell, "A simulation and statistical analysis of stochastic vehicle routing with timing constraints," Decision Science, vol.9, 1978, pp. 673-687.
10. E. Baker and J. Schaffer, "Computational experience with branch exchange heuristics for vehicle routing problems with time window constraints," American Journal of Mathematical and Management Sciences, vol. 6, 1986, pp. 261-300.
11. W. Chiang, and R. Russell, "Simulated annealing metaheuristics for the vehicle routing problem with time windows," Annals of Operations Research, vol. 63, 1996, pp. 3-27.
12. I. H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems," Annals of Operations Research, vol.42, 1993b, pp. 421-451.
13. L. Haibing and L. Andrew, "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, vol. 150, 2003, pp. 115-127.
14. E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J. Y. Potvin, "A tabu search heuristic for the vehicle routing problem with soft time windows," Transportation Science, vol. 31, 1997, pp.170-186.
15. J. Y. Potvin, T. Kervahut, B. L. Garcia, and J. M. Rousseau, "The vehicle routing problem with time windows Part I: Tabu Search," Informs Journal on Computing, vol. 8, 1996, pp. 158-164.
16. H. Gehring and J. Hornberger, "A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows," In Proc. of EUROGEN99, University of Jyväskylä, Jyväskylä, Finland, pp. 57-64.
17. H. Gehring and J. Hornberger, "Parallelization of a two phase metaheuristic for routing problems with time windows," Asia-Pacific Journal of Operational Research, vol. 18, 2001, 35-47.
18. J. Blanton and R. Wainwright, "Multiple vehicle routing with time and capacity constraints using genetic algorithms," In Proc. 5th International Conf. Genetic Algorithms, San Francisco, Morgan Kaufmann, 1993. p. 452-459.
19. O. Bräysy, J. Berger, and M. Barkaoui, "A new hybrid evolutionary algorithm for the vehicle routing problem with time windows," Presented in Route 2000 Workshop, Skodsborg, Denmark, 2000.
20. L. Gambardella, E. Taillard, and G. Agazzi, "MACSVRPTW: A multiple ant colony system for vehicle routing problems with time windows," IDSIA, Lugano, Switzerland, Tech. Rep. IDSIA-06-99, 1999.
21. J. Y. Potvin and S. Bengio, "The vehicle routing problem with time windows Part II: Genetic Search," Informs Journal on Computing, vol. 8, 1996, pp.165-172.
22. K. C. Tan, L.H. Lee, and K. Ou, "Artificial intelligence heuristics in solving vehicle routing problems with time window constraints, "Engineering Applications of Artificial Intelligence, vol. 14, 2001, pp. 825-837.
23. S. Kirkpatrick, C. D. Gelatt, and J. M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, 1983, pp. 671-680.
24. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, "Equations of state calculations by fast computing machines," Journal of Chemical Physics, vol.21, 1953, pp. 1087-1092.
25. F.-H. Liu and S.-Y. Shen, "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, vol.118, 1999, pp. 485-504.
26. H. Gehring and J. Hornberger, "Parallelization of a two phase metaheuristic for routing problems with time windows," Asia-Pacific Journal of Operational Research, vol. 18, 2001, 35-47.
27. L.-M. Rousseau, M. Gendreau, and G. Pesant, "Using constraint-based operators to solve the vehicle routing problem with time windows," Journal of Heuristics, vol. 8, 2002, pp. 43-58.
28. J. Berger, M. Barkaoui, and O. Bräysy, "A route-directed hybrid genetic approach for the vehicle routing problem with time windows," Information Systems and Operations Research, vol. 41, 2003, pp. 179-194.
29. H. Li, A. Lim, and J. Huang, "Local search with annealing like restarts to solve the VRPTW," European Journal of Operational Research, vol.150, 2003, pp. 115-127.
30. K. C. Tan, L. L. Hay, and O. Ke, "A hybrid genetic algorithm for solving vehicle routing problems with time window constraints," Asia-Pacific Journal of Operational Research, vol. 18, 2001, pp. 121-130.
31. K. Q. Zhu, "A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows," in Proceedings of the 15th IEEE International Conference on Tools for Artificial Intelligence, 2003, pp. 176-183.
32. O. Beatrice, J. R. Brian and F. Hanshar, "Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows," Springer Science Business Media, Inc. Manufactured in The Netherlands. Applied Intelligence 24, 2006, pp. 17-30.
33. R. Bent and P. V. Hentenryck, "A two-stage hybrid local search for the vehicle routing problem with time windows," Department of Computer Science, Brown University, Tech. Rep. CS-01-06, 2001.
34. J. Berger and M. Barkaoui, "A parallel hybrid genetic algorithm for the vehicle routing problem with time windows," Computers & Operations Research, vol. 31, 2004, pp. 2037-2053.
35. Z. J. Czech and P. Czarnas, "A parallel simulated annealing for the vehicle routing problem with time windows," in Proc. 10th Euromicro Workshop on Parallel, 2002, pp. 376-383.
36. J. F. Cordeau, G. Larporte, and A. Mercier. "A unified tabu search heuristic for vehicle routing problems with time windows," Journal of the Operational Research Society, vol. 52, 2001, pp. 928-936.
37. J. Hornberger and H. Gehring, "Two evolutionary metaheuristics for the vehicle routing problem with time windows," INFOR, vol. 37, 1999, pp. 297-318.
38. J. Hornberger, "Verteilt-parallele metaheuristiken zur tourenplanung," Gaber, Wiesbaden, 2000.
39. T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura, "Effective local search algorithms for routing and scheduling problems with general time window constraints," Transportation Science, vol. 39, 2005, pp. 206-232.
40. D. Mester, "An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions," In Conf. Mathematical and Population Genetics, Univ. of Haifa, Israel, 2002.
41. Y. Rochat and E.D. Taillard, "Probabilistic diversification and intensification in local search for vehicle routing," Journal of Heuristics, vol. 1, 1995, pp. 147-167.
42. G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, and G. Dueck, "Record breaking optimization results using the ruin and recreate principle," Journal of Computational Physics, vol. 159, 2000, pp.139-171.
43. P. Shaw, "A new local search algorithm providing high quality solutions to vehicle routing problems," Department of Computer Sciences, University of Strathclyde, Glasgow, Scottland, Tech. Rep, APES group, 1997.
44. P. Shaw, "Using constraint programming and local search methods to solve vehicle routing problems," in Proc. of the Fourth International Conf. Principles and Practice of Constraint Programming, New York, 1998, pp. 417-431.