Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Eliiyi U, Eliiyi DT (2009) Applications of bin packing models through the supply chain. Int J Bus Manag 1:11–19
Scheithauer G (1991) A three-dimensional bin packing algorithm. J Inf Process Cybern 27:263–271
Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48:256–267
Lim A, Rodrigues B, Wang Y (2003) A multi-faced buildup algorithm for three-dimensional packing problems. Omega 31:471–481
Davies AP, Bischoff EE (1999) Weight distribution considerations in container loading. Eur J Oper Res 114:509–527
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–153
Bischoff EE (2006) Three-dimensional packing of items with limited load bearing strength. Eur J Oper Res 168:952–966
Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109–1130
Zhao X, Bennell JA, Bektaş T, Dowsland K (2016) A comparative review of 3D container loading algorithms. Int Trans Oper Res 23:287–320
Wu Y, Li W, Goh M (2010) Three-dimensional bin packing problem with variable bin height. Eur J Oper Res 202:347–355
Crainic TG, Perboli G, Tadei R (2008) Extreme point-based heuristics for three-dimensional bin packing. INFORMS J Comput 20:368–384
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–2414
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–64
Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21:498–516
Applegate D, Bixby R, Chvátal V, Cook W (2006) Concorde TSP Solver. http://www.math.uwaterloo.ca/tsp/concorde/
GitHub (2018) Python wrapper around the Concorde TSP solver https://github.com/jvkersch/pyconcorde
Flask (2018) A microframework for Python. http://flask.pocoo.org
Acknowledgment
This study is carried out as a senior design project in the Department of Computer Science in Dokuz Eylül University, İzmir. Turkey.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Eliiyi, U., Bulan, M., Külahlı, E. (2019). A Cargo Vehicle Packing Approach with Delivery Route Considerations. In: Durakbasa, N., Gencyilmaz, M. (eds) Proceedings of the International Symposium for Production Research 2018. ISPR 2018. Springer, Cham. https://doi.org/10.1007/978-3-319-92267-6_66
Download citation
DOI: https://doi.org/10.1007/978-3-319-92267-6_66
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92266-9
Online ISBN: 978-3-319-92267-6
eBook Packages: EngineeringEngineering (R0)