Abstract
In this paper we study the problem of delivering finished vehicles from a logistics yard to dealer locations at which they are sold. The requests for cars arrive dynamically and are not announced in advance to the logistics provider who is granted a certain time-span until which a delivery has to be fulfilled. In a real-world setting, the underlying network is relatively stable in time, since it is usually a rare event that a new dealership opens or an existing one terminates its service. Therefore, probabilities for incoming requests can be derived from historical data. The study explores the potential of using such probabilities to improve the day-to-day decision of sending out or postponing cars that are ready for delivery. Apart from the order selection, we elaborate a heuristic to optimize delivery routes for the selected vehicles, whereby special loading constraints are considered to meet the particular constraints of car transportation via road. In a case study, we illustrate the value of introducing probabilistic information to the planning process and compare the quality of different configurations of our approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Actually, \(\mathcal {O}\) is a multiset as a customer may order more than one car of the same type with the same deadline. However, to simplify the notation we use the term set instead of multiset in the following.
References
Agbegha G, Ballou R, Mathur K (1998) Optimizing auto-carrier loading. Transp Sci 32(2):174–188
Albareda-Sambola M, Fernández E, Laporte G (2014) The dynamic multiperiod vehicle routing problem with probabilistic information. Comput Oper Res 48:31–39
Angelelli E, Savelsbergh MWP, Speranza MG (2007a) Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Oper Res Lett 35(6):713–721
Angelelli E, Speranza MG, Savelsbergh MWP (2007b) Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4):308–317
Archetti C, Jabali O, Speranza M (2015) Multi-period vehicle routing problem with due dates. Comput Oper Res 61:122–134
Çoban O, Fandel G and Sönmez A (2014) Producitivity in turkish and german automotive industries. In: Proceedings of the 6th International Congress on Entrepreneurship ICE’14, pp. 344–354
Chen H-K (2016a) A heuristic algorithm for the auto-carrier loading problem. Int J Shipp Transp Logist 8(1):21–50
Chen H-K (2016b) Sequential auto carrier loading problem. Transp Res Rec J Transp Res Board 2548:53–61
Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581
Cordeau J-F, Dell’Amico M, Falavigna S, Iori M (2015) A rolling horizon algorithm for auto-carrier transportation. Transp Res Part B 76:68–80
Dell’Amico M, Falavigna S, Iori M (2014) Optimization of a real-world auto-carrier transportation problem. Transp Sci 49(2):402–419
Hu Z-H, Zhao Y, Tao S, Sheng Z-H (2015) Finished-vehicle transporter routing problem solved by loading pattern discovery. Ann Oper Res 234:37–56
Kara I, Laporte G, Bektas T (2004) A note on the lifted miller-tucker-zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur J Oper Res 158:793–795
Miller C, Tucker A, Zemlin R (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329
OICA (2017). Production statistics. http://www.oica.net/category/production-statistics. called on 2017-09-28
Pillac V, Gendreau M, Guéret C, Medaglia A (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11
Ritzinger U, Puchinger J, Hartl RE (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215–231
Tadei R, Perboli G, Croce FD (2002) A heuristic algorithm for the auto-carrier transportation problem. Transp Sci 36(1):55–62
Thompson P, Psaraftis H (1993) Cyclic transfer algorithm for multivehicle routing and scheduling problems. Oper Res 41(5):935–946
Toth P and Vigo D (eds) (2002) The vehicle routing problem. SIAM, Philadelphia, PA
Wen M, Cordeau J-F, Laporte G, Larsen J (2010) The dynamic multi-period vehicle routing problem. Comput Oper Res 37:1615–1623
Wensing T (2018) Social and environmental impact of advances in economically-driven transport optimization: case study in automobile distribution. In: Brandenburg M, Rebs T (eds) Social and environmental dimensions of organizations and supply chains. Springer, Cham, pp 195–210
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Billing, C., Jaehn, F. & Wensing, T. A multiperiod auto-carrier transportation problem with probabilistic future demands. J Bus Econ 88, 1009–1028 (2018). https://doi.org/10.1007/s11573-018-0904-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11573-018-0904-x