{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T16:00:56Z","timestamp":1762444856775,"version":"build-2065373602"},"reference-count":43,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2018,12,15]],"date-time":"2018-12-15T00:00:00Z","timestamp":1544832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Freight transportation is becoming an increasingly critical activity for enterprises in a global world. Moreover, the distribution activities have a non-negligible impact on the environment, as well as on the citizens\u2019 welfare. The classical vehicle routing problem (VRP) aims at designing routes that minimize the cost of serving customers using a given set of capacitated vehicles. Some VRP variants consider traveling times, either in the objective function (e.g., including the goal of minimizing total traveling time or designing balanced routes) or as constraints (e.g., the setting of time windows or a maximum time per route). Typically, the traveling time between two customers or between one customer and the depot is assumed to be both known in advance and static. However, in real life, there are plenty of factors (predictable or not) that may affect these traveling times, e.g., traffic jams, accidents, road works, or even the weather. In this work, we analyze the VRP with dynamic traveling times. Our work assumes not only that these inputs are dynamic in nature, but also that they are a function of the structure of the emerging routing plan. In other words, these traveling times need to be dynamically re-evaluated as the solution is being constructed. In order to solve this dynamic optimization problem, a learnheuristic-based approach is proposed. Our approach integrates statistical learning techniques within a metaheuristic framework. A number of computational experiments are carried out in order to illustrate our approach and discuss its effectiveness.<\/jats:p>","DOI":"10.3390\/a11120208","type":"journal-article","created":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T02:15:59Z","timestamp":1545099359000},"page":"208","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["On the Use of Learnheuristics in Vehicle Routing Optimization Problems with Dynamic Inputs"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7922-7125","authenticated-orcid":false,"given":"Quim","family":"Arnau","sequence":"first","affiliation":[{"name":"IN3\u2014Computer Science Department, Open University of Catalonia, 08018 Barcelona, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1392-1776","authenticated-orcid":false,"given":"Angel A.","family":"Juan","sequence":"additional","affiliation":[{"name":"IN3\u2014Computer Science Department, Open University of Catalonia, 08018 Barcelona, Spain"},{"name":"Euncet Business School, 08225 Terrassa, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2465-8574","authenticated-orcid":false,"given":"Isabel","family":"Serra","sequence":"additional","affiliation":[{"name":"Centre de Recerca Matem\u00e0tica, 08193 Bellaterra, Spain"},{"name":"Barcelona Supercomputing Center, 08034 Barcelona, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2018,12,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/j.ejor.2013.12.033","article-title":"A review of recent research on green road freight transportation","volume":"237","author":"Demir","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","unstructured":"Reyes, L., Calvet, L., Juan, A., Faulin, J., and Bove, L. (2018). Sustainable urban freight transport: A multi-depot vehicle routing problem considering different cost dimensions. J. Heuristics."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Faulin, J., Grasman, S., Juan, A., and Hirsch, P. (2018). Sustainable Transportation and Smart Logistics: Decision-Making Models and Solutions, Elsevier.","DOI":"10.1016\/B978-0-12-814242-4.00001-6"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Juan, A.A., Mendez, C.A., Faulin, J., de Armas, J., and Grasman, S.E. (2016). Electric vehicles in logistics and transportation: A survey on emerging environmental, strategic, and operational challenges. Energies, 9.","DOI":"10.3390\/en9020086"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Demartini, M., Pinna, C., Aliakbarian, B., Tonelli, F., and Terzi, S. (2018). Soft Drink Supply Chain Sustainability: A Case Based Approach to Identify and Explain Best Practices and Key Performance Indicators. Sustainability, 10.","DOI":"10.3390\/su10103540"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Demartini, M., Orlandi, I., Tonelli, F., and Anguitta, D. (2017, January 26\u201328). A manufacturing value modeling methodology (MVMM): A value mapping and assessment framework for sustainable manufacturing. Proceedings of the International Conference on Sustainable Design and Manufacturing, Bologna, Italy.","DOI":"10.1007\/978-3-319-57078-5_10"},{"key":"ref_7","unstructured":"Eurostat (2015). Sustainable Development in the European Union: 2015 Monitoring Report of the EU Sustainable Development Strategy, European Union."},{"key":"ref_8","first-page":"32","article-title":"Rich vehicle routing problem: A survey","volume":"47","author":"Arias","year":"2015","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Cassettari, L., Demartini, M., Mosca, R., Revetria, R., and Tonelli, F. (2018). A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints. Algorithms, 11.","DOI":"10.3390\/a11050069"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Dutkiewicz, L., Kucharska, E., Raczka, K., and Grobler-Debska, K. (2016). ST method-based algorithm for the supply routes for multilocation companies problem. Knowledge, Information and Creativity Support Systems: Recent Trends, Advances and Solutions, Springer.","DOI":"10.1007\/978-3-319-19090-7_10"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T., and Tibshirani, R. (2001). The Elements of Statistical Learning, Springer.","DOI":"10.1007\/978-0-387-21606-5"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Gendreau, M., and Potvin, J.Y. (2010). Handbook of Metaheuristics, Springer.","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.cie.2016.01.016","article-title":"Combining statistical learning with metaheuristics for the multi-depot vehicle routing problem with market segmentation","volume":"94","author":"Calvet","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1515\/math-2017-0029","article-title":"Learnheuristics: Hybridizing metaheuristics with machine learning for optimization with dynamic inputs","volume":"15","author":"Calvet","year":"2017","journal-title":"Open Math."},{"key":"ref_15","unstructured":"Wilson, N., Sussman, J., and Wong, H. (1971). Scheduling Algorithms for a Dial-a-Ride System, Massachusetts Institute of Technology, Urban Systems Laboratory. PB 201 808."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","article-title":"Vehicle dispatching with time-dependent travel times","volume":"144","author":"Ichoua","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1016\/j.cor.2011.05.027","article-title":"Vehicle routing under time-dependent travel times: The impact of congestion avoidance","volume":"39","author":"Kok","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1287\/trsc.1050.0114","article-title":"Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching","volume":"40","author":"Ichoua","year":"2006","journal-title":"Transp. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.dss.2012.06.007","article-title":"An event-driven optimization framework for dynamic vehicle routing","volume":"54","author":"Pillac","year":"2012","journal-title":"Decis. Support Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1287\/trsc.1030.0062","article-title":"Time-Varying Travel Times in Vehicle Routing","volume":"38","author":"Fleischmann","year":"2004","journal-title":"Transp. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1016\/j.ejor.2007.03.012","article-title":"Vehicle routing with dynamic travel times: A queueing approach","volume":"186","author":"Kerbache","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3412","DOI":"10.1016\/j.cor.2007.01.025","article-title":"Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering","volume":"35","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.eswa.2016.01.038","article-title":"A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery","volume":"53","author":"Avci","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.21628","article-title":"Dynamic Vehicle Routing Problems: Three Decades and Counting","volume":"67","author":"Psaraftis","year":"2016","journal-title":"Networks"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10479-015-2034-y","article-title":"Combining metaheuristics with mathematical programming, constraint programming and machine learning","volume":"240","author":"Talbi","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Jourdan, L., Dhaenens, C., and Talbi, E.G. (2006). Using Datamining Techniques to Help Metaheuristics: A Short Survey, Springer. Hybrid Metaheuristics.","DOI":"10.1007\/11890584_5"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/j.ejor.2012.03.039","article-title":"Synergies between operations research and data mining: The emerging use of multi-objective approaches","volume":"221","author":"Corne","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/MCI.2011.942584","article-title":"Evolutionary computation meets machine learning: A survey","volume":"6","author":"Zhang","year":"2011","journal-title":"IEEE Computat. Intell. Mag."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Lozano, J.A., Mendiburu, A., and Hernando, L. (2016). Multi-start methods. Handbook of Heuristics, Springer.","DOI":"10.1007\/978-3-319-07153-4_1-1"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of Vehicles from a Central Depot to a Number of Delivery Points","volume":"12","author":"Clarke","year":"1964","journal-title":"Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1111\/j.1475-3995.2008.00640.x","article-title":"The ALGACEA-1 method for the capacitated vehicle routing problem","volume":"15","author":"Faulin","year":"2008","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.asoc.2009.07.003","article-title":"The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem","volume":"10","author":"Juan","year":"2010","journal-title":"Appl. Soft Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1111\/itor.12070","article-title":"A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations","volume":"21","author":"Dominguez","year":"2014","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1111\/itor.12101","article-title":"Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem","volume":"22","author":"Juan","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10479-014-1551-4","article-title":"Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet","volume":"236","author":"Dominguez","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ejor.2016.05.002","article-title":"A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls","volume":"255","author":"Dominguez","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.eswa.2018.01.020","article-title":"Modeling and solving the non-smooth arc routing problem with realistic soft constraints","volume":"98","author":"Ferrer","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1111\/itor.12028","article-title":"Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues","volume":"21","author":"Juan","year":"2014","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.eswa.2015.09.011","article-title":"A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs","volume":"44","author":"Ferrer","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ejor.2016.02.045","article-title":"A multi-agent based cooperative approach to scheduling and routing","volume":"254","author":"Martin","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.cie.2017.06.019","article-title":"Biased Randomization of Heuristics using Skewed Probability Distributions: A survey and some applications","volume":"110","author":"Grasas","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_42","unstructured":"Keith, T.Z. (2014). Multiple Regression and Beyond: An Introduction to Multiple Regression and Structural Equation Modeling, Routledge."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1109\/TEVC.2004.831262","article-title":"Statistical exploratory analysis of genetic algorithms","volume":"8","author":"Czarn","year":"2004","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/12\/208\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:34:17Z","timestamp":1760196857000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/12\/208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,15]]},"references-count":43,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2018,12]]}},"alternative-id":["a11120208"],"URL":"https:\/\/doi.org\/10.3390\/a11120208","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2018,12,15]]}}}