Advertisement

Journal of Scheduling

, Volume 11, Issue 2, pp 149–161 | Cite as

A heuristic method for the vehicle routing problem with mixed deliveries and pickups

  • Niaz A. Wassan
  • Gábor Nagy
  • Samad Ahmadi
Article

Abstract

The vehicle routing problem with deliveries and pickups is a challenging extension to the vehicle routing problem that lately attracted growing attention in the literature. This paper investigates the relationship between two versions of this problem, called “mixed” and “simultaneous”. In particular, we wish to know whether a solution algorithm designed for the simultaneous case can solve the mixed case. To this end, we implement a metaheuristic based on reactive tabu search. The results suggest that this approach can yield good results.

Keywords

Vehicle routing Deliveries and pickups Heuristic Reactive tabu search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdullah, S., Ahmadi, S., Burke, E. K., & Dror, M. (2007a). Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling. OR Spectrum, 29, 351–372. CrossRefGoogle Scholar
  2. Abdullah, S., Ahmadi, S., Burke, E. K., Dror, M., & McCollum, B. (2007b). Tabu based large neighbourhood search for the capacitated examination timetabling problem. Journal of the Operational Research Society, 58, 1494–1502. CrossRefGoogle Scholar
  3. Ahmadi, S., & Osman, I. H. (2005). Greedy random adaptive memory programming search for the capacitated clustering problem. European Journal of Operational Research, 162, 30–44. CrossRefGoogle Scholar
  4. Anily, S., & Mosheiov, G. (1994). The travelling salesman problem with delivery and backhauls. Operations Research Letters, 16, 11–18. CrossRefGoogle Scholar
  5. Battiti, R., & Tecchioli, G. (1994). Reactive tabu search. ORSA Journal on Computing, 6, 126–140. Google Scholar
  6. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: a classification scheme and survey. TOP, 15, 1–31. CrossRefGoogle Scholar
  7. Chen, J.-F., & Wu, T.-H. (2006). Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society, 57, 579–587. CrossRefGoogle Scholar
  8. Crispim, J., & Brandão, J. (2005). Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society, 56, 1296–1302. CrossRefGoogle Scholar
  9. Dethloff, J. (2001). Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, 23, 79–96. CrossRefGoogle Scholar
  10. Dethloff, J. (2002). Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. Journal of the Operational Research Society, 53, 115–118. CrossRefGoogle Scholar
  11. Gendreau, M., Laporte, G., & Vigo, D. (1999). Heuristics for the travelling salesman problem with pickup and delivery. Computers & Operations Research, 26, 699–714. CrossRefGoogle Scholar
  12. Gillett, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 22, 340–349. Google Scholar
  13. Glover, F., & Laguna, M. (1997). Tabu search. New York: Kluwer. Google Scholar
  14. Goetschalckx, M., & Jacobs-Blecha, C. (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42, 39–51. CrossRefGoogle Scholar
  15. Halse, K. (1992). Modelling and solving complex vehicle routing problems. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby. Google Scholar
  16. Montané, F. A. T., & Galvão, R. D. (2006). A tabu search algorithm for the vehicle routing problems with simultaneous pickup and delivery service. Computers and Operations Research, 33, 595–619. CrossRefGoogle Scholar
  17. Mosheiov, G. (1994). The travelling salesman problem with pick-up and delivery. European Journal of Operational Research, 79, 299–310. CrossRefGoogle Scholar
  18. Mosheiov, G. (1995). The pickup delivery location problem on networks. Networks, 26, 243–251. CrossRefGoogle Scholar
  19. Nagy, G. (1996). Heuristic methods for the many-to-many location-routing problem. PhD thesis, School of Mathematics and Statistics, The University of Birmingham, Birmingham. Google Scholar
  20. Nagy, G., & Salhi, S. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162, 126–141. CrossRefGoogle Scholar
  21. Osman, I. H., & Wassan, N. A. (2002). A reactive tabu search meta-heuristic for the vehicle routing problem with backhauls. Journal of Scheduling, 5, 263–285. CrossRefGoogle Scholar
  22. Salhi, S., & Nagy, G. (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society, 50, 1034–1042. CrossRefGoogle Scholar
  23. Toth, P., & Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31, 372–385. CrossRefGoogle Scholar
  24. Toth, P., & Vigo, D. (2002). VRP with backhauls. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (pp. 195–224). Philadelphia: Society for Industrial and Applied Mathematics. Google Scholar
  25. Wade, A. C. (2002). Constructive and ant system heuristics for a class of vehicle routing problems with backhauls. PhD thesis, School of Mathematics and Statistics, The University of Birmingham, Birmingham. Google Scholar
  26. Wade, A. C., & Salhi, S. (2002). An investigation into a new class of vehicle routing problem with backhauls. Omega, 30, 479–487. CrossRefGoogle Scholar
  27. Wade, A. C., & Salhi, S. (2003). An ant system algorithm for the mixed vehicle routing problem with backhauls. In M. G. Resende & J. P. de Sousa (Eds.), Metaheuristics: computer decision-making (pp  699–719). New York: Kluwer. Google Scholar
  28. Wassan, N. A. (2006). A reactive tabu search for the vehicle routing problem. Journal of the Operational Research Society, 57, 111–116. CrossRefGoogle Scholar
  29. Wassan, N. A. (2007). Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. Journal of the Operational Research Society, 58, 1630–1641. CrossRefGoogle Scholar
  30. Wassan, N. A., & Osman, I. H. (2002). Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society, 53, 768–782. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Centre for Heuristic Optimisation, Kent Business SchoolThe University of KentCanterburyUK
  2. 2.School of ComputingDe Montfort UniversityLeicesterUK

Personalised recommendations