A Cargo Vehicle Packing Approach with Delivery Route Considerations

  • Uğur Eliiyi
  • Mert Bulan
  • Emre Külahlı
Conference paper


Our focus in this study is the vehicle dispatching, routing and packing problem of a cargo company branch in Izmir, Turkey. The daily problem involves determining which parcels or packages should be distributed in which vehicle, determining the order in which these packages will be deployed, determining the route through which the vehicles will make the distribution, and finally determining how the packages should be placed in the vehicles. Thus, the whole daily distribution process of the cargo branch is of focus. We develop a web-based decision support tool to handle this hard-to-tackle problem. Within the decision support system (DSS), we handle the problem in stages. By developing an intuitive algorithm, the delivery route-based three-dimensional packing is solved very quickly. The results are shared with the user through a user-friendly interface.


Three-dimensional packing Clustering Vehicle loading Decision support system Optimization Heuristics 



This study is carried out as a senior design project in the Department of Computer Science in Dokuz Eylül University, İzmir. Turkey.


  1. 1.
    Eliiyi U, Eliiyi DT (2009) Applications of bin packing models through the supply chain. Int J Bus Manag 1:11–19Google Scholar
  2. 2.
    Scheithauer G (1991) A three-dimensional bin packing algorithm. J Inf Process Cybern 27:263–271zbMATHGoogle Scholar
  3. 3.
    Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48:256–267MathSciNetCrossRefGoogle Scholar
  4. 4.
    Lim A, Rodrigues B, Wang Y (2003) A multi-faced buildup algorithm for three-dimensional packing problems. Omega 31:471–481CrossRefGoogle Scholar
  5. 5.
    Davies AP, Bischoff EE (1999) Weight distribution considerations in container loading. Eur J Oper Res 114:509–527CrossRefGoogle Scholar
  6. 6.
    Castro Silva JL, Soma NY, Maculan N (2003) A greedy search for the three-dimensional bin packing problem: the packing static stability case. Int Trans Oper Res 10:141–153MathSciNetCrossRefGoogle Scholar
  7. 7.
    Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168:952–966CrossRefGoogle Scholar
  8. 8.
    Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109–1130CrossRefGoogle Scholar
  9. 9.
    Zhao X, Bennell JA, Bektaş T, Dowsland K (2016) A comparative review of 3D container loading algorithms. Int Trans Oper Res 23:287–320MathSciNetCrossRefGoogle Scholar
  10. 10.
    Wu Y, Li W, Goh M (2010) Three-dimensional bin packing problem with variable bin height. Eur J Oper Res 202:347–355MathSciNetCrossRefGoogle Scholar
  11. 11.
    Crainic TG, Perboli G, Tadei R (2008) Extreme point-based heuristics for three-dimensional bin packing. INFORMS J Comput 20:368–384MathSciNetCrossRefGoogle Scholar
  12. 12.
    He Y, Wu Y, de Souza R (2012) A global search framework for practical three-dimensional packing with variable carton orientations. Comput Oper Res 39:2395–2414CrossRefGoogle Scholar
  13. 13.
    Nurcahyo GW, Alias RA, Shamsuddin SM, Sap MNM (2002) Sweep algorithm in vehicle routing problem for public transport. Asia-Pac J Inf Technol Multimed 2:51–64Google Scholar
  14. 14.
    Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21:498–516MathSciNetCrossRefGoogle Scholar
  15. 15.
    Applegate D, Bixby R, Chvátal V, Cook W (2006) Concorde TSP Solver.
  16. 16.
    GitHub (2018) Python wrapper around the Concorde TSP solver
  17. 17.
    Flask (2018) A microframework for Python.

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceDokuz Eylül UniversityİzmirTurkey

Personalised recommendations