Advertisement

Journal of Heuristics

, Volume 16, Issue 3, pp 417–439 | Cite as

The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms

  • Manar I. HosnyEmail author
  • Christine L. Mumford
Article

Abstract

The single vehicle pickup and delivery problem with time windows is an important practical problem, yet only a few researchers have tackled it. In this research, we compare three different approaches to the problem: a genetic algorithm, a simulated annealing approach, and a hill climbing algorithm. In all cases, we adopt a solution representation that depends on a duplicate code for both the pickup request and its delivery. We also present an intelligent neighborhood move, that is guided by the time window, aiming to overcome the difficult problem constraints efficiently. Results presented herein improve upon those that have been previously published.

Keywords

Pickup and delivery problem with time windows Dial-a-ride Vehicle routing Genetic algorithms Simulated annealing Hill climbing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blanton, J., Wainwright, R.: Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Proceedings of the 5th International Conference on Genetic Algorithms, pp. 452–459, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc. (1993) Google Scholar
  2. Bruggen, L.J.J.V.D., Lenstra, J., Schuur, P.: Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transp. Sci. 27(3), 298–311 (1993) zbMATHCrossRefGoogle Scholar
  3. Desrosiers, J., Dumas, Y., Soumis, F.: A dynamic programming solution of the large-scale single vehicle dial-a-ride problem with time windows. Am. J. Math. Manag. Sci. 6, 3–4 (1986) Google Scholar
  4. Diana, M., Dessouky, M.: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp. Res. Part B: Methodol. 38(6), 539–557 (2004) CrossRefGoogle Scholar
  5. Dorband, J., Mumford, C., Wang, P.: Developing an ace solution for two-dimensional strip packing. In: 18th International Parallel and Distributed Processing Symposium Workshop on Massively Parallel Processing, Santa Fe, New Mexico (2004) Google Scholar
  6. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison–Wesley, Boston (1989) zbMATHGoogle Scholar
  7. Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 83(1), 83–104 (1995) zbMATHCrossRefGoogle Scholar
  8. Hosny, M.I., Mumford, C.L.: Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators. In: GECCO ’07: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation, pp. 2489–2496, New York, NY, USA. ACM Press (2007) Google Scholar
  9. Jih, W., Hsu, Y.: Dynamic vehicle routing using hybrid genetic algorithms. In: Proceedings of the 1999 IEEE International Conference on Robotics and Automation, vol. 1, pp. 453–458, Detroit, Michigan (1999) Google Scholar
  10. Jih, W., Hsu, Y.: A family competition genetic algorithm for the pickup and delivery problems with time window. Bull. Coll. Eng. N.T.U. 90, 89–98 (2004) Google Scholar
  11. Jørgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58, 1321–1331 (2007) zbMATHCrossRefGoogle Scholar
  12. Kirkpatrick, S., Gelatt, C.D. Jr., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983) CrossRefMathSciNetGoogle Scholar
  13. Landrieu, A., Mati, Y., Binder, Z.: A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. J. Intell. Manuf. 12(5), 497–508 (2001) CrossRefGoogle Scholar
  14. Lau, H., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. In: Proceedings of the 13th International Conference on Tools with Artificial Intelligence, pp. 333–340 (2001) Google Scholar
  15. Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, pp. 160–167, Dallas, TX, USA (2001) Google Scholar
  16. Lu, Q., Dessouky, M.M.: A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. Eur. J. Oper. Res. 175(2), 672–687 (2006) zbMATHCrossRefGoogle Scholar
  17. Man, K., Tang, K., Kwong, S.: Genetic algorithms: concepts and applications [in engineering design]. Ind. Electron. IEEE Trans. 43(5), 519–534 (1996) CrossRefGoogle Scholar
  18. Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. Part B: Methodol. 34(2), 107–121 (2000) CrossRefGoogle Scholar
  19. Psaraftis, H.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp. Sci. 17(3), 351–357 (1983) CrossRefGoogle Scholar
  20. Renaud, J., Boctor, F.F., Quenniche, J.: A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 27(9), 905–916 (2000) zbMATHCrossRefMathSciNetGoogle Scholar
  21. Rutenbar, R.: Simulated annealing algorithms: an overview. Circ. Devices Mag. IEEE 5(1), 19–26 (1989) CrossRefGoogle Scholar
  22. Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17–29 (1995) zbMATHCrossRefGoogle Scholar
  23. Tam, V., Tseng, L.C.: Effective heuristics to solve pickup and delivery problems with time windows. In: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, pp. 184–188 (2003) Google Scholar
  24. Transport-Statistics: Road freight statistics 2005. A national statistics publication produced for the department of transport, UK (2006). www.dft.gov.uk/transtat
  25. Wall, M.: Galib: A C++ library of genetic algorithm components. Mechanical Engineering Department, MIT (1996). http://lancet.mit.edu/ga

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Cardiff School of Computer ScienceCardiff UniversityCardiffUK

Personalised recommendations