{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T15:54:42Z","timestamp":1781625282957,"version":"3.54.5"},"reference-count":41,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:00:00Z","timestamp":1673308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"DIIES\u2014Universit\u00e0 di Reggio Calabria","award":["ARS01_01100"],"award-info":[{"award-number":["ARS01_01100"]}]},{"name":"the project \u201cLa Mobilit\u00e0 per i passeggeri come Servizio\u2013MyPasS\u201d","award":["ARS01_01100"],"award-info":[{"award-number":["ARS01_01100"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Given two pick-up and delivery points, the best path chosen does not necessarily follow the criteria of minimum travel time or generalized minimum cost evaluated with a deterministic approach. Given a criterion, the perceived cost is not deterministic for many reasons (congestion, incomplete information on the state of the system, inexact prediction of the system state, etc.). The same consideration applies to the best-chosen route, assuming that the route is an ordered list of network nodes to visit. The paths and routes perceived and chosen (drivers or companies) could follow different criteria (i.e., minizmum congested travel time for the path and minimum monetary cost for the route). In this context, the paths chosen between two pick-up and delivery points, studied with the path choice problem (PCP), influence the best route, studied with the vehicle routing problem (VRP). This paper reports some considerations on the importance of modelling the path choice behavior in the VRP; the influence of the PCP on the VRP is studied. The considerations are supported by a numerical example in a small network in which the results obtained by adopting the deterministic or probabilistic models for the PCP are compared. To validate the reported thesis, the models are applied in a small test system, and it allows the reader to follow the numerical results step by step.<\/jats:p>","DOI":"10.3390\/a16010047","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:40:35Z","timestamp":1673408435000},"page":"47","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Importance of Modeling Path Choice Behavior in the Vehicle Routing Problem"],"prefix":"10.3390","volume":"16","author":[{"given":"Antonino","family":"Vitetta","sequence":"first","affiliation":[{"name":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 degli Studi Mediterranea di Reggio Calabria, delle Infrastrutture e dell\u2019Energia Sostenibile, 89122 Reggio Calabria, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,10]]},"reference":[{"key":"ref_1","first-page":"325","article-title":"Some Theoretical Aspects of Road Traffic Research","volume":"1","author":"Wardrop","year":"1952","journal-title":"Proc. Inst. Civ. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0041-1647(71)90012-8","article-title":"A probabilistic multipath traffic assignment algorithm which obviates path enumeration","volume":"5","author":"Dial","year":"1971","journal-title":"Transp. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.11.3.253","article-title":"On Stochastic Models of Traffic Assignment","volume":"11","author":"Daganzo","year":"1977","journal-title":"Transp. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00133443","article-title":"The structure of random utility models","volume":"8","author":"Manski","year":"1977","journal-title":"Theory Decis."},{"key":"ref_5","unstructured":"Volmuller, J., and Hamerslag, R. (1984, January 11\u201313). Modelling inter urban route choice behaviour. Proceedings of the Ninth International Symposium on Transportation and Traffic Theory, Delft, The Netherlands."},{"key":"ref_6","unstructured":"Manheim, M. (2018). Discrete Choice Analysis. Theory and Application to Travel Demand. MIT Press Series in Transportation Studies, MIT Press Ltd."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The Truck Dispatching Problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manag. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","article-title":"A concise guide to existing and emerging vehicle routing problem variants","volume":"286","author":"Vidal","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"100047","DOI":"10.1016\/j.treng.2021.100047","article-title":"Freight distribution with electric vehicles: A case study in Sicily. RES, infrastructures and vehicle routing","volume":"3","author":"Napoli","year":"2021","journal-title":"Transp. Eng."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","article-title":"A Branch-and-Cut Algorithm for the Dial-a-Ride Problem","volume":"54","author":"Cordeau","year":"2006","journal-title":"Oper. Res."},{"key":"ref_11","first-page":"163","article-title":"A bi-objective model for eco-efficient dial-a-ride problems","volume":"27","author":"Chen","year":"2022","journal-title":"Asia Pac. Manag. Rev."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1080\/19427867.2020.1852505","article-title":"Stochastic programming model for integrating bus network design and dial-a-ride scheduling","volume":"14","author":"Chu","year":"2020","journal-title":"Transp. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1002\/nav.20261","article-title":"What you should know about the vehicle routing problem","volume":"54","author":"Laporte","year":"2007","journal-title":"Nav. Res. Logist."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees","volume":"42","author":"Fisher","year":"1994","journal-title":"Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","article-title":"Lagrangian duality applied to the vehicle routing problem with time windows","volume":"33","author":"Kallehauge","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.tre.2009.04.007","article-title":"An exact solution approach for vehicle routing and scheduling problems with soft time windows","volume":"45","author":"Qureshi","year":"2009","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.ejor.2006.02.019","article-title":"An exact algorithm for a single-vehicle routing problem with time windows and multiple routes","volume":"178","author":"Azi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.tre.2013.12.004","article-title":"Selective vehicle routing problems under uncertainty without recourse","volume":"62","author":"Allahviranloo","year":"2014","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13677-020-0157-4","article-title":"An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems","volume":"9","author":"Abbasi","year":"2020","journal-title":"J. Cloud Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2908","DOI":"10.1016\/j.cor.2007.01.007","article-title":"The single vehicle routing problem with deliveries and selective pickups","volume":"35","author":"Gribkovskaia","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.amc.2005.09.040","article-title":"A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length","volume":"176","author":"Safaei","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.cor.2017.05.014","article-title":"Large-scale vehicle routing problems: Quantum Annealing, tunings and results","volume":"87","author":"Syrichas","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and St\u00fctzle, T. (2004). Ant Colony Optimization, MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10589-014-9713-5","article-title":"A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem","volume":"61","author":"Rivera","year":"2014","journal-title":"Comput. Optim. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.eswa.2015.10.012","article-title":"A Glowworm Swarm Optimization algorithm for the Vehicle Routing Problem with Stochastic Demands","volume":"46","author":"Marinaki","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_26","unstructured":"(2023, January 03). European Commission, Smart cities and communities\u2014European innovation partnership, Communication from the Commission, C(2012) 4701, 2012. Available online: https:\/\/digital-strategy.ec.europa.eu\/en\/library\/smart-cities-and-communities-european-innovation-partnership-communication-commission-c2012-4701."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Cascetta, E. (2009). Transportation Systems Engineering: Theory and Methods, Springer.","DOI":"10.1007\/978-0-387-75857-2"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2499282","DOI":"10.1155\/2022\/2499282","article-title":"Sentiment Analysis Models with Bayesian Approach: A Bike Preference Application in Metropolitan Cities","volume":"2022","author":"Vitetta","year":"2022","journal-title":"J. Adv. Transp."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"28","DOI":"10.3141\/2136-04","article-title":"Bayesian Multinomial Logit: Theory and Route Choice Example. Transportation Research Record","volume":"2136","author":"Washington","year":"2009","journal-title":"J. Transp. Res. Board"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Verdegay, J. (2003). Path choice making under uncertainty: A fuzzy logic based approach. Fuzzy Sets-Based Heuristics for Optimization, Springer.","DOI":"10.1007\/978-3-540-36461-0"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1016\/j.ejor.2005.02.026","article-title":"Handling uncertainty in route choice models: From probabilistic to possibilistic approaches","volume":"175","author":"Henn","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.jmp.2006.01.003","article-title":"Quantum dynamics of human decision-making","volume":"50","author":"Busemeyer","year":"2006","journal-title":"J. Math. Psychol."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.jocm.2017.10.003","article-title":"Quantum paradigm of probability amplitude and complex utility in entangled discrete choice modeling","volume":"27","author":"Lipovetsky","year":"2018","journal-title":"J. Choice Model."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.tbs.2015.07.003","article-title":"A quantum utility model for route choice in transport systems","volume":"3","author":"Vitetta","year":"2016","journal-title":"Travel Behav. Soc."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"100290","DOI":"10.1016\/j.jocm.2021.100290","article-title":"Quantum utility and random utility model for path choice modelling: Specification and aggregate calibration from traffic counts","volume":"40","author":"Vitetta","year":"2021","journal-title":"J. Choice Model."},{"key":"ref_36","unstructured":"Cantarella, G.E., Watling, D.P., de Luca, S., and Di Pace, R. (2020). Dynamics and Stochasticity in Transportation Systems, Elsevier. Tools for Transportation Network Modelling."},{"key":"ref_37","unstructured":"Patriksson, M., and Labb\u00e9, M. (2002). Stochastic Assignment with Gammit Path Choice Models. Transportation Planning, Springer. Applied Optimization."},{"key":"ref_38","unstructured":"Cantarella, G.E., Watling, D.P., de Luca, S., and Di Pace, R. (2020). Discrete choice modelling with application to route and departure time choice. Dynamics and Stochasticity in Transportation Systems, Elsevier. Appendix A."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1080\/03081079008935110","article-title":"A principle of uncertainty and information invariance*","volume":"17","author":"Klir","year":"1990","journal-title":"Int. J. Gen. Syst."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Croce, A.I., Musolino, G., Rindone, C., and Vitetta, A. (2020). Route and Path Choices of Freight Vehicles: A Case Study with Floating Car Data. Sustainability, 12.","DOI":"10.3390\/su12208557"},{"key":"ref_41","first-page":"74","article-title":"Bi-objective vehicle routing problems with path choice and variable speed","volume":"19","author":"Kong","year":"2022","journal-title":"Complex Syst. Complex. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/1\/47\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:05:27Z","timestamp":1760119527000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/1\/47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,10]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["a16010047"],"URL":"https:\/\/doi.org\/10.3390\/a16010047","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,10]]}}}