Abstract
Studies dealing with route optimization have received considerable attention in recent years due to the increased demand for transportation services. For decades, scholars have developed robust algorithms designed to solve various Vehicle Routing Problems (VRP). In most cases, the focus is to present an algorithm that can overcome the shortest distances reported in other studies. On the other hand, execution time is also an important parameter that may limit the feasibility of the utilization in real scenarios for some applications. For this reason, in this work, a Guided Local Search (GLS) metaheuristic available in open-source OR-Tools will be tested to solve the Augerat instances of Capacitated Vehicle Routing Problems (CVRP). The stop criterion used here is the execution time, going from 1 s (standard) to 10 s, with a last run of 360 s. The numerical results demonstrate that increasing the execution time returns significant improvement in distance optimization. However, the optimization found considering high execution times can be expensive in terms of time, and not feasible for situations demanding faster algorithms, such as in Dynamic Vehicle Routing Problems (DVRP). Nonetheless, the GLS has proven to be a versatile algorithm for use where distance optimization is the main priority (high execution times) and in cases where faster algorithms are required (low execution times).
This work has been supported by FCT - Fundação para a Ciência e Tecnologia within the R&D Units Project Scope: UIDB/05757/2020, UIDP/05757/2020, UIDB/00690/2020, UIDB/50 020/2020, and UIDB/00319/2020. Adriano Silva was supported by Doctoral Grant SFRH/BD/151346/2021 financed by the Portuguese Foundation for Science and Technology (FCT), and with funds from NORTE 2020, under MIT Portugal Program.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdelatti, M.F., Sodhi, M.S.: An improved GPU-accelerated heuristic technique applied to the capacitated vehicle routing problem. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 663–671 (2020). https://doi.org/10.1145/3377930.3390159
Augerat, P., Naddef, D., Belenguer, J., Benavent, E., Corberan, A., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem (1995)
Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Indust. Eng. 99, 300–313 (2016). https://doi.org/10.1016/j.cie.2015.12.007
Breed, A.K., Speth, D., Plötz, P.: \(\text{ CO}_{{2}}\) fleet regulation and the future market diffusion of zero-emission trucks in Europe. Energy Policy 159, 112640 (2021). https://doi.org/10.1016/j.enpol.2021.112640
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80–91 (1959). https://doi.org/10.1287/mnsc.6.1.80
Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6), 1388–1405 (2016). https://doi.org/10.1287/opre.2016.1535
Dhanya, K.M., Kanmani, S., Hanitha, G., Abirami, S.: Hybrid crow search-ant colony optimization algorithm for capacitated vehicle routing problem. In: Zelinka, I., Senkerik, R., Panda, G., Lekshmi Kanthan, P.S. (eds.) ICSCS 2018. CCIS, vol. 837, pp. 46–52. Springer, Singapore (2018). https://doi.org/10.1007/978-981-13-1936-5_5
Dohn, A., Rasmussen, M.S., Larsen, J.: The vehicle routing problem with time windows and temporal dependencies. Networks 58(4), 273–289 (2011). https://doi.org/10.1002/net.20472
Dubois, F., Renaud-Goud, P., Stolf, P.: Capacitated vehicle routing problem under deadlines: an application to flooding crisis. IEEE Access 10, 45629–45642 (2022). https://doi.org/10.1109/ACCESS.2022.3170446
Haghani, A., Jung, S.: A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32(11), 2959–2986 (2005). https://doi.org/10.1016/j.cor.2004.04.013
Hannan, M., Akhtar, M., Begum, R., Basri, H., Hussain, A., Scavino, E.: Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. Waste Manag. 71, 31–41 (2018). https://doi.org/10.1016/j.wasman.2017.10.019. https://www.sciencedirect.com/science/article/pii/S0956053X17307675
Jia, Y.H., Mei, Y., Zhang, M.: Confidence-based ant colony optimization for capacitated electric vehicle routing problem with comparison of different encoding schemes. IEEE Trans. Evol. Comput. 26(6), 1394–1408 (2022). https://doi.org/10.1109/TEVC.2022.3144142
Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293–309 (2008). https://doi.org/10.1016/j.ejor.2007.05.055
Mehmood, T.: Does information technology competencies and fleet management practices lead to effective service delivery? Empirical evidence from e-commerce industry. Int. J. Technol. Innov. Manag. (IJTIM) 1(2), 14–41 (2021). https://doi.org/10.54489/ijtim.v1i2.26
Mohammed, M.A., et al.: Solving vehicle routing problem by using improved k-nearest neighbor algorithm for best solution. J. Comput. Sci. 21, 232–240 (2017). https://doi.org/10.1016/j.jocs.2017.04.012
Montoya, A., Guéret, C., Mendoza, J.E., Villegas, J.G.: The electric vehicle routing problem with nonlinear charging function. Transport. Res. Part B: Methodol. 103, 87–110 (2017). https://doi.org/10.1016/j.trb.2017.02.004
Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013). https://doi.org/10.1016/j.ejor.2012.08.015
Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007). https://doi.org/10.1016/j.cor.2005.09.012
Praveen, V., Keerthika, P., Sivapriya, G., Sarankumar, A., Bhasker, B.: Vehicle routing optimization problem: a study on capacitated vehicle routing problem. Mater. Today: Proceed. 64, 670–674 (2022). https://doi.org/10.1016/j.matpr.2022.05.185
Silva, A.S., et al.: Solving a capacitated waste collection problem using an open-source tool. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A.M.A.C., Garau, C. (eds.) Computational Science and Its Applications - ICCSA 2022 Workshops. ICCSA 2022. Lecture Notes in Computer Science, vol. 13378, pp. 140–156. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-10562-3_11
Silva, A.S., et al.: Dynamic urban solid waste management system for smart cities. In: Simos, D.E., Rasskazova, V.A., Archetti, F., Kotsireas, I.S., Pardalos, P.M. (eds.) Learning and Intelligent Optimization. LION 2022. Lecture Notes in Computer Science, vol. 13621, pp. 178–190. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-24866-5_14
Silva, A.S., et al.: Capacitated waste collection problem solution using an open-source tool. Computers 12(1), 15 (2023). https://doi.org/10.3390/computers12010015. https://www.mdpi.com/2073-431X/12/1/15
Siskos, P., Moysoglou, Y.: Assessing the impacts of setting \(\text{ CO}_{{2}}\) emission targets on truck manufacturers: a model implementation and application for the EU. Transport. Res. Part A: Policy Pract. 125, 123–138 (2019). https://doi.org/10.1016/j.tra.2019.05.010
Tian, J., Yang, D., Zhang, H., Liu, L.: Classification method of energy efficiency and \(\text{ CO}_{{2}}\) emission intensity of commercial trucks in china’s road transport. Procedia Eng. 137, 75–84 (2016). https://doi.org/10.1016/j.proeng.2016.01.236. Green Intelligent Transportation System and Safety
Toth, P., Vigo, D.: The vehicle routing problem. SIAM (2002). https://doi.org/10.1137/1.9780898718515
Vidal, T., Laporte, G., Matl, P.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2), 401–416 (2020). https://doi.org/10.1016/j.ejor.2019.10.010
Voudouris, C., Tsang, E.P., Alsheddy, A.: Guided local search. In: Gendreau, M., Potvin, JY. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 321–361. Springer, MA (2010). https://doi.org/10.1007/978-1-4419-1665-5_11
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Silva, A.S., Lima, J., Pereira, A.I., Silva, A.M.T., Gomes, H.T. (2023). Execution Time Experiments to Solve Capacitated Vehicle Routing Problem. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2023 Workshops. ICCSA 2023. Lecture Notes in Computer Science, vol 14111. Springer, Cham. https://doi.org/10.1007/978-3-031-37126-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-031-37126-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-37125-7
Online ISBN: 978-3-031-37126-4
eBook Packages: Computer ScienceComputer Science (R0)