Arabian Journal for Science and Engineering

, Volume 44, Issue 3, pp 2641–2651 | Cite as

Vehicle Routing Problem in Reverse Logistics with Split Demands of Customers and Fuel Consumption Optimization

  • Alireza EydiEmail author
  • Hadi Alavi
Research Article - Systems Engineering


One of the important issues in transportation and logistics systems is vehicle routing problem which in general involves a set of problems including the number of vehicles located in depot are expected to meet and service a set of customers, each requiring a certain amount of demands. On the other hand, regarding the increasing environmental concerns, economic problems and pressure of laws, green logistics and reverse logistics have received increasing attention during recent years. In this regard, this study investigates a vehicle routing problem in reverse logistics with split demand of customers in which the demand of different points can be divided among vehicles and fuel consumption optimization. In this paper, fuel cost of vehicles was assumed to be dependent on their traveled path and load. For this problem, a mixed integer linear programming model was proposed. Finally, to validate the proposed model, some examples were solved by GAMS software. As the problem was NP-hard and its solution time increased exponentially, a simulated annealing algorithm was proposed to solve the problem in large-sized cases. Computational results and related comparisons showed algorithm efficiency.


Vehicle routing Green logistics Reverse logistics Split demand Fuel consumption Simulated annealing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dantzig, G.B.; Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Dror, M.; Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23, 141–145 (1989)zbMATHGoogle Scholar
  3. 3.
    Dror, M.; Trudeau, P.: Split delivery routing. Nav. Res. Logist. (NRL) 37(3), 383–402 (1990)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Lin, C.; Choy, K.L.; Ho, G.T.; Chung, S.H.; Lam, H.Y.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4), 1118–1138 (2014)Google Scholar
  5. 5.
    Farahani, R.Z.; Rezapour, S.; Kardar, L.: Logistics Operations and Management: Concepts and Models. Elsevier, Amsterdam (2011). Chapter 13Google Scholar
  6. 6.
    Beltrami, E.J.; Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4(1), 65–94 (1974)zbMATHGoogle Scholar
  7. 7.
    Sculli, D.; Mok, K.C.; Cheung, S.H.: Scheduling vehicles for refuse collection. J. Oper. Res. Soc. 38, 233–239 (1987)Google Scholar
  8. 8.
    Mansini, R.; Speranza, M.G.: A linear programming model for the separate refuse collection service. Comput. Oper. Res. 25(7), 659–673 (1998)zbMATHGoogle Scholar
  9. 9.
    Ramos, T.R.P.; Oliveira, R.C.: Delimitation of service areas in reverse logistics networks with multiple depots. J. Oper. Res. Soc. 62(7), 1198–1210 (2011)Google Scholar
  10. 10.
    Mar-Ortiz, J.; Adenso-Diaz, B.; González-Velarde, J.L.: Design of a recovery network for WEEE collection: the case of Galicia, Spain. J. Oper. Res. Soc. 62(8), 1471–1484 (2011)Google Scholar
  11. 11.
    Schultmann, F.; Zumkeller, M.; Rentz, O.: Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry. Eur. J. Oper. Res. 171(3), 1033–1050 (2006)zbMATHGoogle Scholar
  12. 12.
    Le Blanc, I.; van Krieken, M.; Krikke, H.; Fleuren, H.: Vehicle routing concepts in the closed-loop container network of ARN—a case study. OR Spectr. 28(1), 53–71 (2006)zbMATHGoogle Scholar
  13. 13.
    Kim, H.; Yang, J.; Lee, K.D.: Vehicle routing in reverse logistics for recycling end-of-life consumer electronic goods in South Korea. Transp. Res. Part D Transp. Environ. 14(5), 291–299 (2009)Google Scholar
  14. 14.
    Kim, H.; Yang, J.; Lee, K.D.: Reverse logistics using a multi-depot VRP approach for recycling end-of-life consumer electronic products in South Korea. Int. J. Sustain. Transp. 5(5), 289–318 (2011)Google Scholar
  15. 15.
    Kara, I.; Kara, B.Y.; Yetis, M.K.: Energy minimizing vehicle routing problem. In: Dress, A., Xu, Y., Zhu, B. (eds.) Combinatorial Optimization and Applications, pp. 62–71. Springer, Berlin (2007)Google Scholar
  16. 16.
    Kuo, Y.: Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput. Ind. Eng. 59(1), 157–165 (2010)Google Scholar
  17. 17.
    Suzuki, Y.: A new truck-routing approach for reducing fuel consumption and pollutants emission. Transp. Res. Part D Transp. Environ. 16(1), 73–77 (2011)Google Scholar
  18. 18.
    Xiao, Y.; Zhao, Q.; Kaku, I.; Xu, Y.: Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput. Oper. Res. 39(7), 1419–1431 (2012)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Kucukoglu, I.; Ene, S.; Aksoy, A.; Ozturk, N.: Green capacitated vehicle routing problem fuel consumption optimization model. Comput. Eng. Res. 3, 16–23 (2013)Google Scholar
  20. 20.
    Kucukoglu, I.; Ene, S.; Aksoy, A.; Öztürk, N.: A memory structure adapted simulated annealing algorithm for a green vehicle routing problem. Environ. Sci. Pollut. Res. 22(5), 3279–3297 (2015)Google Scholar
  21. 21.
    Kopfer, H.W.; Schönberger, J.; Kopfer, H.: Reducing greenhouse gas emissions of a heterogeneous vehicle fleet. Flex. Serv. Manuf. J. 26(1–2), 221–248 (2014)Google Scholar
  22. 22.
    Zachariadis, E.E.; Tarantilis, C.D.; Kiranoudis, C.T.: The load-dependent vehicle routing problem and its pick-up and delivery extension. Transp. Res. Part B Methodol. 71, 158–181 (2015)Google Scholar
  23. 23.
    Shimizu, Y.: Generalized vehicle routing problem for reverse logistics aiming at low carbon transportation. Ind. Eng. Manag. Syst. 12(2), 161–170 (2013)Google Scholar
  24. 24.
    Ho, S.C.; Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947–1964 (2004)zbMATHGoogle Scholar
  25. 25.
    Tavakkoli-Moghaddam, R.; Safaei, N.; Kah, M.M.O.; Rabbani, M.: A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. J. Frankl. Inst. 344(5), 406–425 (2007)MathSciNetzbMATHGoogle Scholar
  26. 26.
    Yoshizaki, H.T.Y.; Belfiore, P.: Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. Eur. J. Oper. Res. 199(3), 750–758 (2009)zbMATHGoogle Scholar
  27. 27.
    Gulczynski, D.; Golden, B.; Wasil, E.: The split delivery vehicle routing problem with minimum delivery amounts. Transp. Res. Part E Logist. Transp. Rev. 46(5), 612–626 (2010)zbMATHGoogle Scholar
  28. 28.
    Salani, M.; Vacca, I.: Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Eur. J. Oper. Res. 213(3), 470–477 (2011)MathSciNetzbMATHGoogle Scholar
  29. 29.
    Tang, J.; Ma, Y.; Guan, J.; Yan, C.: A max–min ant system for the split delivery weighted vehicle routing problem. Expert Syst. Appl. 40(18), 7468–7477 (2013)Google Scholar
  30. 30.
    Gulczynski, D.J.; Golden, B.; Wasil, E.: Recent developments in modeling and solving the split delivery vehicle routing problem. Tutor. Oper. Res. 8, 170–180 (2008)Google Scholar
  31. 31.
    Aarts, E.; Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)zbMATHGoogle Scholar
  32. 32.
    Gillett, B.E.; Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340–349 (1974)zbMATHGoogle Scholar
  33. 33.
    Christofides, N.; Eilon, S.: An algorithm for the vehicle-dispatching problem. Oper. Res. Q. 20(3), 309–318 (1969)Google Scholar

Copyright information

© King Fahd University of Petroleum & Minerals 2018

Authors and Affiliations

  1. 1.Faculty of EngineeringUniversity of KurdistanSanandajIran
  2. 2.MSC of Industrial EngineeringUniversity of KurdistanSanandajIran

Personalised recommendations