Abstract
Last mile delivery remains to be a focal point in the operations of logistics service providers. As more customers are willing to pay a premium price for receiving their parcel within a specific time window the Vehicle Routing Problem with Time Windows (VRPTW) has been an active research area. However, realistic problem features such as the existence of multiple working shifts and the meal breaks of the delivery personnel assigned to each shift have not received sufficient attention in the literature. The existence of these additional requirements gives rise to the VRPTW including Breaks and Shifts (VRPTW-BS) which is the main focus of the present study. The fact that the time windows of some customers overlap with several shifts brings additional complexity since the problem cannot be decomposed with respect to shifts. We develop three methods for the solution of the VRPTW-BS. The first method involves the formulation of a mixed-integer linear programming model, which can be solved to optimality for relatively small instances with up to 25 customers and with small optimality gaps up to 35 customers. The main use of this model is to assess the quality of the solutions obtained by the proposed two-phase heuristic that is based on generating an initial solution and improving it using local search methods. For larger instances with more than 1000 customers, we also devise another heuristic based on partitioning the customers into a number of clusters and then applying our heuristic for each cluster. The results obtained on instances of different size indicate that the proposed heuristic yields solutions of good quality within acceptable computation times.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
https://www.statista.com/statistics/379046/worldwide-retail-e-commerce-sales/ accessed on 26 Aug 2019.
- 2.
https://hostingfacts.com/internet-facts-stats/ accessed on 26 Aug 2019.
- 3.
https://www.fundalina.com/dijital-turkiye-2019-e-ticaret-raporu-aciklandi/ accessed on 26 Aug 2019.
References
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)
Coelho, L.C., Gagliardi, J.P., Renaud, J., Ruiz, A.: Solving the vehicle routing problem with lunch break arising in the furniture delivery industry. J. Oper. Res. Soc. 67(5), 743–751 (2016)
Toth, P., Vigo, D.: Vehicle Routing, Problems, Methods and Applications, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2014)
Buhrkal, K., Larsen, A., Ropke, S.: The waste collection vehicle routing problem with time windows in a city logistics context. Procedia Soc. Behav. Sci. 39, 241–254 (2012)
Sahoo, S., Kim, S., Kim, B.-I., Kraas, B., Popov, A.: Routing optimization for waste management. Interfaces 35, 24–36 (2005)
Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(1), 170–186 (1997)
Sze, S.-N.: A study on the multi-trip vehicle routing problem with time windows and meal break considerations. A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy, University of Sydney (2011)
Kim, B.-I., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Comput. Oper. Res. 33(12), 3624–3642 (2006)
Benjamin, A.M., Beasley, J.E.: Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput. Oper. Res. 37(12), 2270–2280 (2010)
Vidal, T., Crainic, T.G., Gesndreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658–673 (2014)
Markov, I., Varone, S., Bierlaire, M.:x Integrating a heterogeneous fixed fleet and flexible assignment of destination depots in the waste collection VRP with intermediate facilities. Transp. Res. B Methodol. 84, 256–274 (2019)
Keskin, M., Laporte, G., Çatay, B.: Electric vehicle routing problem with time-dependent waiting times at recharging stations. Comput. Oper. Res. 107, 77–94 (2019)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)
Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)
Ioannou, G., Kritikos, M., Prastacos, G.: A greedy look-ahead heuristic for the vehicle routing problem with time windows. J. Oper. Res. Soc. 52(5), 523–537 (2001)
Glover, F.: New ejection chain and alternating path methods for traveling salesman problems. In: Computer Science and Operations Research (pp. 491–509). Pergamon (1992)
Solak, S.: Advanced Multi-Stage Local Search Applications to Vehicle Routing Problem with Time Windows: A Review. Technical Report (2005)
MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1(14), pp. 281–297 (1967)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Karademir, Ç., Bilge, Ü., Aras, N., Akkuş, G.B., Öznergiz, G., Doğan, O. (2020). Solution of a Real-Life Vehicle Routing Problem with Meal Breaks and Shifts. In: Derbel, H., Jarboui, B., Siarry, P. (eds) Green Transportation and New Advances in Vehicle Routing Problems. Springer, Cham. https://doi.org/10.1007/978-3-030-45312-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-45312-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45311-4
Online ISBN: 978-3-030-45312-1
eBook Packages: Computer ScienceComputer Science (R0)