Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

A Geometrical Center based Two-way Search Heuristic Algorithm for Vehicle Routing Problem with Pickups and Deliveries

  • Shin, Kwang-Cheol (Dept. of Information and Communications Engineering, Korea Advanced Institute of Science and Technology)
  • Published : 2009.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

The classical vehicle routing problem (VRP) can be extended by including customers who want to send goods to the depot. This type of VRP is called the vehicle routing problem with pickups and deliveries (VRPPD). This study proposes a novel way to solve VRPPD by introducing a two-phase heuristic routing algorithm which consists of a clustering phase and uses the geometrical center of a cluster and route establishment phase by applying a two-way search of each route after applying the TSP algorithm on each route. Experimental results show that the suggested algorithm can generate better initial solutions for more computer-intensive meta-heuristics than other existing methods such as the giant-tour-based partitioning method or the insertion-based method.

Keywords

References

  1. Dantzig GB and Ramser JH (1959). The truck dispatching problem. Manage Sci 6: 80-91. https://doi.org/10.1287/mnsc.6.1.80
  2. Toth P and Vigo D (1997). An exact algorithm for the vehicle routing problem with backhauls. Transport Sci 31: 372-385. https://doi.org/10.1287/trsc.31.4.372
  3. Mingozzi A, Giorgi S and Baldacci R (1999). An exact method for the vehicle routing problem with backhauls. Transport Sci 33:315-329. https://doi.org/10.1287/trsc.33.3.315
  4. Deif I and Bodin L (1984). Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed). Proceedings of the Babson conference on software uses in transportation and logistic management, Babson Park, FL, USA, pp 75-96.
  5. Goetschalckx M and Jacobs-Blecha C (1989). The vehicle routing problem with backhauls. Eur J Oper Res 42:39-51. https://doi.org/10.1016/0377-2217(89)90057-X
  6. Thangiah SR, Potvin J-Y and Sun T (1996). Heuristicapproaches to vehicle routing with backhauls and time windows. Comput Oper Res 23:1043-1057. https://doi.org/10.1016/0305-0548(96)00018-4
  7. Duhamel C, Potvin J-Y and Rousseau J-M (1997). A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transport Sci 31:49-59. https://doi.org/10.1287/trsc.31.1.49
  8. Toth P and Vigo D (1999). A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113:528-543. https://doi.org/10.1016/S0377-2217(98)00086-1
  9. Brandão J (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. Eur J Oper Res 173:540-555. https://doi.org/10.1016/j.ejor.2005.01.042
  10. Min H (1989). The multiple the vehicle routing problem with simultaneous delivery and pick-up points. Transport Res Part A 5:377-386. https://doi.org/10.1016/0191-2607(89)90085-X
  11. Dethloff J (2001). Vehicle routing and reverse logistics:the vehicle routing problem with simultaneous delivery and pick-up. Oper Res Spektrum 23:79-96. https://doi.org/10.1007/PL00013346
  12. Dethloff J (2002). Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pickup applied to the vehicle routing problem with backhauls. J Oper Res Soc 53:115-118. https://doi.org/10.1057/palgrave/jors/2601263
  13. Angelelli E and Mansini R (2002). The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Klose A, Speranza MG, Van Wassenhove LN (Eds). Quantitative Approaches to Distribution Logistics and Supply Chain Management, Springer-Verlag, Berlin, pp. 249-267.
  14. Tang FA and Galvao RD (2002). Vehicle routing problems with simultaneous pick-up and delivery service. Opsearch 39:19-33. https://doi.org/10.1007/BF03398667
  15. Tang FA and Galvão RD (2006). A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comp Opns Res 33:595-619. https://doi.org/10.1016/j.cor.2004.07.009
  16. Nagy G and Salhi S (1998). The many-to-many location-routing problem. TOP 6:261-275. https://doi.org/10.1007/BF02564791
  17. Nagy G and Salhi S (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Opl Res 162:126-141. https://doi.org/10.1016/j.ejor.2002.11.003
  18. Chen JF and Wu TH (2006). Vehicle routing problem with simultaneous deliveries and pickups. J Opl Res Soc 57:579 - 587. https://doi.org/10.1057/palgrave.jors.2602028
  19. Lin S and Kernighan B (1973). An effective heuristic algorithm for the traveling salesman problem. Opns Res 21: 498-516. https://doi.org/10.1287/opre.21.2.498
  20. Augerat P (1995). Approche polyèdrale du problème de tournées de véhicules. PhD thesis, Institut National Polytechnique de Grenoble-Inpg. http://www.branchandcut.org/VRP/data/, accessed 1 April 2009.
  21. Salhi S, Sari M, Saidi D and Touati N (1992). Adaptation of some vehicle fleet mix heuristics. Omega 20, 653-660. https://doi.org/10.1016/0305-0483(92)90009-V
  22. Mosheiov G (1994). The travelling salesman problem with pick-up and delivery. Eur J Oper Res 79:299-310. https://doi.org/10.1016/0377-2217(94)90360-3
  23. Clarke G and Wright J (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581. https://doi.org/10.1287/opre.12.4.568
  24. Nagy G and Salhi S (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Opl Res Soc 50: 1034-1042. https://doi.org/10.1057/palgrave.jors.2600808

Cited by

  1. An Efficient Broadcast Technique for Vehicular Networks vol.7, pp.2, 2011, https://doi.org/10.3745/JIPS.2011.7.2.221