A mathematical model for the route optimization of service vehicles
Article Sidebar
Main Article Content
Abstract
The route planning of service vehicles is an important issue for large-scale enterprises which have hundreds of employee. Especially for the flexible shift system which brings about uncertainty for the drivers, the route plans have to be formed daily by the managers. This study addresses the route optimization problem of an automotive company which aims to minimize total transportation cost of the service fleet and proposes a mixed integer mathematical model to solve problem. The objective of the mathematical model is to minimize fixed and transportation cost of the fleet by considering vehicle capacities and travelling time constraints. The mathematical model is tested on a randomly generated problem set which consist of different sized instances for homogeneous service fleet. The computational results obtained by the Gurobi solver show that the proposed mathematical model is capable to find route plans for the real-life service vehicles routing decisions that can minimize total transportation cost of the fleet.
Keywords: Vehicle routing, service systems, mathematical modelling
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
The Global Journal of Business Economics and Management: Current Issues is an open-access journal. The copyright holder is the author or authors. Licensee: Birlesik Dunya Yenilik Arastirma ve Yayincilik Merkezi, North Nicosia, Cyprus. All articles can be downloaded free of charge. Articles published in the Journal are Open-Access articles distributed under the CC-BY license [Attribution 4.0 International (CC BY 4.0)].
References
BektaÅŸ, T., & ElmastaÅŸ, S. (2007). Solving school bus routing problems through integer programming. Journal of the Operational Research Society, 58(12), 1599-1604.
Bowerman, R., Hall, B., & Calamai, P. (1995). A multi-objective optimization approach to urban school bus routing: Formulation and solution method. Transportation Research Part A: Policy and Practice, 29(2), 107-123.
Canen, A. G., & Pizzolato, N. D. (1994). The vehicle routing problem: A managerial report. Logistics Information Management, 7(1), 11-13.
Fügenschuh, A. (2009). Solving a school bus scheduling problem with integer programming. European Journal of Operational Research, 193(3), 867-884.
Gavish, B., & Shlifer, E. (1979). An approach for solving a class of transportation scheduling problems. European Journal of Operational Research, 3(2), 122-134.
Kara, I., & BektaÅŸ, T. (2006). Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research, 174(3), 1449-1458.
Kim, B.-I., Kim, S., & Park, J. (2012). A school bus scheduling problem. European Journal of Operational Research, 218(2), 577-585.
Lahyani, R., Khemakhem, M., & Semet, F. (2015). Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research, 241(1), 1-14.
Newton, R. M., & Thomas, W. H. (1969). Design of school bus routes by computer. Socio-Economic Planning Sciences, 3(1), 75-85.
Park, J., & Kim, B.-I. (2010). The school bus routing problem: A review. European Journal of Operational Research, 202(2), 311-319.
Schittekat, P., Sevaux, M., & Sörensen, K. (2006). A mathematical formulation for a school bus routing problem. Proceeding of the International Conference on Service Systems and Service Management, Troyes, France.
Swersey, A. J., & Ballard, W. (1984). Scheduling school buses. Management Science, 30(7), 844-853.
Tan, K. C., Lee, L. H., Zhu, Q. L., & Ou, K. (2001). Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering, 15(3), 281-295.
White, G. P. (1982). An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems. European Journal of Operational Research, 9(2), 190-193.