Advertisement

An Open Vehicle Routing Problem for Daily Shipment Plan of a Local Bedding Company in Turkey

  • Bartu Arslan
  • Özlem Erdin
  • Deniz Gülce Dağıstanlıoğlu
  • Ozan Bolel
  • Çağlar Su
  • Banu Y. Ekren
  • Cansu YurtsevenEmail author
Conference paper
Part of the Lecture Notes in Mechanical Engineering book series (LNME)

Abstract

This study deals with a daily shipment plan for a bedding company in Turkey. We develop a decision support system optimizing total travel distance of vehicles completing daily shipment plans. In detail, the developed models both assign the shipment goods to capacitated vehicles as well as minimize the total travel distance of these vehicles by considering an open vehicle routing algorithm. The decision support system is coded by using the MS excel-macro and a user friendly tool is developed for users’ convenience. In the developed tool, there are two different solution approaches: a mixed integer mathematical programming and a heuristic solution approaches. For the small size plans (i.e. less than 25 demand points) mathematical modelling guaranteeing the optimal solution can be utilized. For the large size cases the heuristic algorithm providing a near-optimal result promptly can be utilized. The macro-based tool is designed such a flexible way that the user can make any revisions on the provided plan whenever necessary.

Keywords

Open vehicle routing Daily shipment plan Capacitated vehicle routing Optimization Decision support system 

Notes

Acknowledgment

We would like to thank our colleagues Batuhan Taş and Atakan Türkyılmaz, and our company supervisor Süleyman Çolak for their kind support and contribution to this study.

References

  1. 1.
    Joubert, J.W.: The Vehicle Routing Problem: Origins and Variants. PhD Thesis, University of Pretoria etd, South Africa (2007)Google Scholar
  2. 2.
    Gajpal, Y.: Algorithms for vehicle routing problem with pickup and delivery, PhD Thesis, McMaster University, Hamilton, Ontario, May 2008Google Scholar
  3. 3.
    Fisher, M.L., Jaikumar, R.: A Generalized Assıgnment Heuristic for Vehicle Routing, August 1979Google Scholar
  4. 4.
    Picka, K.H., Ashjari, B., Ziaeifar, A., Nickbeen, P.: Open vehicle routing problem optimization under realistic assumptions. Int. J. Res. Ind. Eng. 3, 46–55 (2014)CrossRefGoogle Scholar
  5. 5.
    Pisinger, D., Røpke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403–2435 (2007)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Galić, A., Carić, T., Fosin, J.: The case study of implementing the delivery optimization system at a fast-moving consumer goods distributor. Promet Traffic Transp. 25(6), 595–603 (2013)Google Scholar
  7. 7.
    Şeker, Ş., Güneri, A.F., Ermiş, G.: Solving the multi depot vehicle routing problem with assignment algorithm. In: 13th International Research/Expert Conference “Trends in the Development of Machinery and Associated Technology”, Hammamet, pp. 225–228, October 2009Google Scholar
  8. 8.
    Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2002)CrossRefGoogle Scholar
  9. 9.
    Daanish, A.R., Naick, B.K.: Implementation of charging station based electric vehicle routing problem using nearest neighbour search algorithm. In: 2nd IEEE International Conference on Intelligent Transportation Engineering (ICITE), September 2017Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Bartu Arslan
    • 1
  • Özlem Erdin
    • 1
  • Deniz Gülce Dağıstanlıoğlu
    • 1
  • Ozan Bolel
    • 1
  • Çağlar Su
    • 1
  • Banu Y. Ekren
    • 1
  • Cansu Yurtseven
    • 1
    Email author
  1. 1.Industrial EngineeringYasar UniversityIzmirTurkey

Personalised recommendations