{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T06:09:41Z","timestamp":1776406181151,"version":"3.51.2"},"reference-count":86,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T00:00:00Z","timestamp":1678924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior, Brasil (CAPES)","award":["001"],"award-info":[{"award-number":["001"]}]},{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior, Brasil (CAPES)","award":["306395\/2017-7"],"award-info":[{"award-number":["306395\/2017-7"]}]},{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior, Brasil (CAPES)","award":["17\/2551-0001197-0"],"award-info":[{"award-number":["17\/2551-0001197-0"]}]},{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior, Brasil (CAPES)","award":["19\/2551-0001277-2"],"award-info":[{"award-number":["19\/2551-0001277-2"]}]},{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior, Brasil (CAPES)","award":["2020\/05165-1"],"award-info":[{"award-number":["2020\/05165-1"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (CNPq)","award":["001"],"award-info":[{"award-number":["001"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (CNPq)","award":["306395\/2017-7"],"award-info":[{"award-number":["306395\/2017-7"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (CNPq)","award":["17\/2551-0001197-0"],"award-info":[{"award-number":["17\/2551-0001197-0"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (CNPq)","award":["19\/2551-0001277-2"],"award-info":[{"award-number":["19\/2551-0001277-2"]}]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (CNPq)","award":["2020\/05165-1"],"award-info":[{"award-number":["2020\/05165-1"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado do Rio Grande do Sul (FAPERGS)","award":["001"],"award-info":[{"award-number":["001"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado do Rio Grande do Sul (FAPERGS)","award":["306395\/2017-7"],"award-info":[{"award-number":["306395\/2017-7"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado do Rio Grande do Sul (FAPERGS)","award":["17\/2551-0001197-0"],"award-info":[{"award-number":["17\/2551-0001197-0"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado do Rio Grande do Sul (FAPERGS)","award":["19\/2551-0001277-2"],"award-info":[{"award-number":["19\/2551-0001277-2"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado do Rio Grande do Sul (FAPERGS)","award":["2020\/05165-1"],"award-info":[{"award-number":["2020\/05165-1"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo (FAPESP)","award":["001"],"award-info":[{"award-number":["001"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo (FAPESP)","award":["306395\/2017-7"],"award-info":[{"award-number":["306395\/2017-7"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo (FAPESP)","award":["17\/2551-0001197-0"],"award-info":[{"award-number":["17\/2551-0001197-0"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo (FAPESP)","award":["19\/2551-0001277-2"],"award-info":[{"award-number":["19\/2551-0001277-2"]}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo (FAPESP)","award":["2020\/05165-1"],"award-info":[{"award-number":["2020\/05165-1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at any time. When a graph changes, DSP algorithms partially recompute the paths while taking advantage of the previous computations. Although the DSP problem represents many real situations, it leaves out some fundamental aspects of decision-making. One of these aspects is the existence of multiple, potentially conflicting objectives that must be optimized simultaneously. Recently, we performed a first incursion on the so-called Multi-Objective Dynamic Shortest Path (MODSP), presenting the first algorithm able to take the MODM perspective into account when solving a DSP problem. In this paper, we go beyond and formally define the MODSP problem, thus establishing and clarifying it with respect to its simpler counterparts. In particular, we start with a brief overview of the related literature and then present a complete formalization of the MODSP problem class, highlighting its distinguishing features as compared to similar problems and representing their relationship through a novel taxonomy. This work also motivates the relevance of the MODSP problem by enumerating real-world scenarios that involve all its ingredients, such as multiple objectives and dynamically updated graph topologies. Finally, we discuss the challenges and open questions for this new class of shortest path problems, aiming at future work directions. We hope this work sheds light on the theme and contributes to leveraging relevant research on the topic.<\/jats:p>","DOI":"10.3390\/a16030162","type":"journal-article","created":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T02:29:59Z","timestamp":1679020199000},"page":"162","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5702-990X","authenticated-orcid":false,"given":"Juarez Machado","family":"da Silva","sequence":"first","affiliation":[{"name":"Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, Av. Unisinos, 950, Cristo Rei, S\u00e3o Leopoldo 93022-000, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6488-7654","authenticated-orcid":false,"given":"Gabriel de Oliveira","family":"Ramos","sequence":"additional","affiliation":[{"name":"Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, Av. Unisinos, 950, Cristo Rei, S\u00e3o Leopoldo 93022-000, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0358-2056","authenticated-orcid":false,"given":"Jorge Luis Vict\u00f3ria","family":"Barbosa","sequence":"additional","affiliation":[{"name":"Applied Computing Graduate Program, Universidade do Vale do Rio dos Sinos, Av. Unisinos, 950, Cristo Rei, S\u00e3o Leopoldo 93022-000, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1590\/0101-7438.2017.037.03.0487","article-title":"Shortest paths on dynamic graphs: A survey","volume":"37","author":"Ferone","year":"2017","journal-title":"Pesqui. Oper."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"106078","DOI":"10.1016\/j.asoc.2020.106078","article-title":"An Easy-to-Use Real-World Multi-Objective Optimization Problem Suite","volume":"89","author":"Tanabe","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Da Silva, J.M., de O. Ramos, G., and Barbosa, J.L.V. (2022, January 18\u201323). The multi-objective dynamic shortest path problem. Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC), Padua, Italy.","DOI":"10.1109\/CEC55065.2022.9870278"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/1198513.1198519","article-title":"Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms","volume":"2","author":"Demetrescu","year":"2006","journal-title":"ACM Trans. Algorithms"},{"key":"ref_5","unstructured":"Fortz, B., and Thorup, M. (2000, January 26\u201330). Internet traffic engineering by optimizing OSPF weights. Proceedings of the Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), Tel Aviv, Israel."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/90.893870","article-title":"New dynamic algorithms for shortest path tree computation","volume":"8","author":"Narvaez","year":"2000","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","article-title":"On the computational complexity of dynamic graph problems","volume":"158","author":"Ramalingam","year":"1996","journal-title":"Theor. Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Baswana, S., Khurana, S., and Sarkar, S. (2012). Fully Dynamic Randomized Algorithms for Graph Spanners. ACM Trans. Algorithms, 8.","DOI":"10.1145\/2344422.2344425"},{"key":"ref_9","first-page":"364","article-title":"Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue","volume":"33","author":"Sunita","year":"2021","journal-title":"J. King Saud Univ.\u2014Comput. Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s00453-010-9401-5","article-title":"On Dynamic Shortest Paths Problems","volume":"61","author":"Roditty","year":"2011","journal-title":"Algorithmica"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.jda.2005.12.003","article-title":"Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures","volume":"4","author":"Demetrescu","year":"2006","journal-title":"J. Discret. Algorithms"},{"key":"ref_12","unstructured":"Madkour, A., Aref, W.G., Rehman, F.U., Rahman, M.A., and Basalamah, S. (2017). A survey of shortest-path algorithms. arXiv."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., and Wiedermann, J. (2018). SOFSEM 2018: Theory and Practice of Computer Science, Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, 29 January\u20132 February 2018, Springer International Publishing.","DOI":"10.1007\/978-3-319-73117-9"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"18237","DOI":"10.1109\/TITS.2022.3165757","article-title":"Data-Driven Optimization for Dynamic Shortest Path Problem Considering Traffic Safety","volume":"23","author":"Jiang","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"auf der Heide, F.M. (2001). Algorithms\u2014ESA 2001, Proceedings of the 9th Annual European Symposium, Aarhus, Denmark, 28\u201331 August 2001, Springer.","DOI":"10.1007\/3-540-44676-1"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1145\/1039488.1039492","article-title":"A New Approach to Dynamic All Pairs Shortest Paths","volume":"51","author":"Demetrescu","year":"2004","journal-title":"J. ACM"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Hagerup, T., and Katajainen, J. (2004). Algorithm Theory\u2014SWAT 2004, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, 8\u201310 July 2004, Springer.","DOI":"10.1007\/b98413"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Van den Brand, J., and Nanongkai, D. (2019, January 9\u201312). Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. Proceedings of the 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), Baltimore, MD, USA.","DOI":"10.1109\/FOCS.2019.00035"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bernstein, A. (2009, January 25\u201327). Fully dynamic (2 + \u03b5) approximate all-pairs shortest paths with fast query and close to linear update time. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, GA, USA.","DOI":"10.1109\/FOCS.2009.16"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1137\/090776573","article-title":"Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs","volume":"41","author":"Roditty","year":"2012","journal-title":"SIAM J. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2852","DOI":"10.1016\/j.cor.2013.06.014","article-title":"Dynamic shortest path problems: Hybrid routing policies considering network disruptions","volume":"40","author":"Sever","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3012","DOI":"10.1016\/j.cor.2012.03.006","article-title":"Decremental algorithm for adaptive routing incorporating traveler information","volume":"39","author":"Ardakani","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0191-2615(98)00016-2","article-title":"Expected shortest paths in dynamic and stochastic traffic networks","volume":"32","author":"Fu","year":"1998","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_24","first-page":"67","article-title":"A Survey of Multi-Objective Sequential Decision-Making","volume":"48","author":"Roijers","year":"2013","journal-title":"J. Artif. Int. Res."},{"key":"ref_25","unstructured":"Deb, K. (2005). Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, Springer."},{"key":"ref_26","unstructured":"Wang, W. (2014). Multi-Objective Sequential Decision Making. [Ph.D. Thesis, Universit\u00e9 Paris Sud-Paris\u2014XI]. Available online: https:\/\/theses.hal.science\/tel-01057079."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Roijers, D.M., and Whiteson, S. (2017). Multi-Objective Decision Making, Springer International Publishing. Number 1.","DOI":"10.1007\/978-3-031-01576-2_1"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10898-021-01096-x","article-title":"Multi-objective dynamic programming with limited precision","volume":"82","author":"Mandow","year":"2022","journal-title":"J. Glob. Optim."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","article-title":"Approximation Methods in Multiobjective Programming","volume":"126","author":"Ruzika","year":"2005","journal-title":"J. Optim. Theory Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10458-022-09552-y","article-title":"A practical guide to multi-objective reinforcement learning and planning","volume":"36","author":"Hayes","year":"2022","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"ref_31","first-page":"10","article-title":"Multi-Objective Multi-Agent Decision Making: A Utility-Based Analysis and Survey","volume":"34","author":"Mannion","year":"2019","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Miettinen, K. (1998). Nonlinear Multiobjective Optimization, Springer.","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"ref_33","unstructured":"Ehrgott, M. (2005). Multicriteria Optimization, Springer."},{"key":"ref_34","first-page":"296","article-title":"On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization","volume":"3","author":"Haimes","year":"1971","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","article-title":"Effective implementation of the \u03b5-constraint method in Multi-Objective Mathematical Programming problems","volume":"213","author":"Mavrotas","year":"2009","journal-title":"Appl. Math. Comput."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Wang, Q., Wang, L., Huang, W., Wang, Z., Liu, S., and Savi\u0107, D.A. (2019). Parameterization of NSGA-II for the Optimal Design of Water Distribution Systems. Water, 11.","DOI":"10.3390\/w11050971"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_38","first-page":"1","article-title":"SPEA2: Improving the strength pareto evolutionary algorithm","volume":"103","author":"Zitzler","year":"2001","journal-title":"TIK Rep."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1016\/j.jcss.2013.02.004","article-title":"A multi-objective ant colony system algorithm for virtual machine placement in cloud computing","volume":"79","author":"Gao","year":"2013","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Coello Coello, C., and Lechuga, M. (2002, January 12\u201317). MOPSO: A proposal for multiple objective particle swarm optimization. Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u201902 (Cat. No.02TH8600), Honolulu, HI, USA.","DOI":"10.1109\/CEC.2002.1004388"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"He, F., Qi, H., and Fan, Q. (2007, January 15\u201316). An evolutionary algorithm for the multi-objective shortest path problem. Proceedings of the International Conference on Intelligent Systems and Knowledge Engineering, Chengdu, China.","DOI":"10.2991\/iske.2007.217"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.cor.2014.11.010","article-title":"A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem","volume":"57","author":"Raith","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1016\/j.ejor.2014.11.003","article-title":"An exact method for the biobjective shortest path problem for large-scale road networks","volume":"242","author":"Duque","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"114219","DOI":"10.1109\/ACCESS.2020.3002276","article-title":"Bi-Objective Vehicle Routing for Muck Transportation in Urban Road Networks","volume":"8","author":"Guo","year":"2020","journal-title":"IEEE Access"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"103237","DOI":"10.1016\/j.engappai.2019.103237","article-title":"A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem","volume":"87","author":"Prakash","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Jun, H., and Qingbao, Z. (2010, January 11\u201312). Multi-objective Mobile Robot Path Planning Based on Improved Genetic Algorithm. Proceedings of the 2010 International Conference on Intelligent Computation Technology and Automation, Changsha, China.","DOI":"10.1109\/ICICTA.2010.300"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1007\/s00500-012-0964-8","article-title":"Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms","volume":"17","author":"Ahmed","year":"2013","journal-title":"Soft Comput."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s00500-015-1825-z","article-title":"Solving the Multi-Objective Path Planning Problem in Mobile Robotics with a Firefly-Based Approach","volume":"21","author":"Ferruz","year":"2017","journal-title":"Soft Comput."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Weise, J., Mai, S., Zille, H., and Mostaghim, S. (2020, January 19\u201324). On the Scalable Multi-Objective Multi-Agent Pathfinding Problem. Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK.","DOI":"10.1109\/CEC48606.2020.9185585"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2015.05.007","article-title":"Dimensionality reduction in multiobjective shortest path search","volume":"64","author":"Pulido","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.eswa.2016.10.045","article-title":"Many-objective stochastic path finding using reinforcement learning","volume":"72","author":"Tozer","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"7153","DOI":"10.1109\/LRA.2021.3096744","article-title":"Subdimensional Expansion for Multi-Objective Multi-Agent Path Finding","volume":"6","author":"Ren","year":"2021","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Madureira, A., Reis, C., and Marques, V. (2013). Computational Intelligence and Decision Making, Springer.","DOI":"10.1007\/978-94-007-4722-7"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., and Qin, L. (2008, January 25\u201329). Finding Time-Dependent Shortest Paths over Large Graphs. Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, EDBT\u201908, Nantes, France.","DOI":"10.1145\/1353343.1353371"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/s41019-019-00105-0","article-title":"Time-Dependent Graphs: Definitions, Applications, and Algorithms","volume":"4","author":"Wang","year":"2019","journal-title":"Data Sci. Eng."},{"key":"ref_56","unstructured":"Funke, S., and Storandt, S. Proceedings of the 2013 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX), SIAM, New Orleans, LA, USA, 7 January 2013."},{"key":"ref_57","unstructured":"Geisberger, R., Kobitzsch, M., and Sanders, P. Proceedings of the 2010 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, Austin, TX, USA, 16 January 2010."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"McGeoch, C.C. (2008). Experimental Algorithms, Proceedings of the 7th International Workshop, WEA 2008 Provincetown, MA, USA, 30 May\u20131 June 2008, Springer.","DOI":"10.1007\/978-3-540-68552-4"},{"key":"ref_59","unstructured":"Goldberg, A.V., and Harrelson, C. (2005, January 23\u201325). Computing the Shortest Path: A Search Meets Graph Theory. Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201905, Vancouver, BC, Canada."},{"key":"ref_60","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., and Werneck, R.F. (2016). Algorithm Engineering: Selected Results and Surveys, Springer International Publishing."},{"key":"ref_61","first-page":"15:1","article-title":"Stochastic Route Planning for Electric Vehicles","volume":"Volume 233","author":"Schulz","year":"2022","journal-title":"Proceedings of the 20th International Symposium on Experimental Algorithms (SEA 2022)"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2020.07.005","article-title":"Objectives and methods in multi-objective routing problems: A survey and classification scheme","volume":"290","author":"Zajac","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1754399.1754400","article-title":"Multiobjective A* Search with Consistent Heuristics","volume":"57","author":"Mandow","year":"2008","journal-title":"J. ACM"},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","article-title":"A label correcting approach for solving bicriterion shortest-path problems","volume":"27","author":"Skriver","year":"2000","journal-title":"Comput. Oper. Res."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0377-2217(92)90248-8","article-title":"A multicriteria Pareto-optimal path algorithm","volume":"62","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"ref_66","unstructured":"Poon, S.H., Rahman, M.S., and Yen, H.C. (2017). WALCOM: Algorithms and Computation, Proceedings of the 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, 29\u201331 March 2017, Springer International Publishing."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Maristany de las Casas, P., Bornd\u00f6rfer, R., Kraus, L., and Sede\u00f1o-Noda, A. (2021). An FPTAS for Dynamic Multiobjective Shortest Path Problems. Algorithms, 14.","DOI":"10.3390\/a14020043"},{"key":"ref_68","unstructured":"Jahn, J., and Krabs, W. (1986, January 4\u20137). Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems. Proceedings of the Recent Advances and Historical Development of Vector Optimization, Darmstadt, Germany."},{"key":"ref_69","unstructured":"Fandel, G., and Gal, T. (1979, January 20\u201324). Bicriterion Path Problems. Proceedings of the Multiple Criteria Decision Making Theory and Application, K\u00f6nigswinter, Germany."},{"key":"ref_70","first-page":"1","article-title":"Introduction to intelligent systems in traffic and transportation","volume":"7","author":"Bazzan","year":"2013","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.aap.2018.12.022","article-title":"Real-time crash prediction models: State-of-the-art, design pathways and ubiquitous requirements","volume":"124","author":"Hossain","year":"2019","journal-title":"Accid. Anal. Prev."},{"key":"ref_72","unstructured":"An, B., Yorke-Smith, N., El Fallah Seghrouchni, A., and Sukthankar, G. (2020, January 9\u201313). Toll-Based Learning for Minimising Congestion under Heterogeneous Preferences. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020), Auckland, New Zealand."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"103542","DOI":"10.1016\/j.trc.2021.103542","article-title":"Navigating to safety: Necessity, requirements, and barriers to considering safety in route finding","volume":"137","author":"Sohrabi","year":"2022","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1080\/0951192X.2018.1535197","article-title":"Multiobjective dynamic routing with predefined stops for automated vehicles","volume":"32","author":"Tettamanti","year":"2019","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/TITS.2020.3024655","article-title":"Survey of Deep Reinforcement Learning for Motion Planning of Autonomous Vehicles","volume":"23","author":"Aradi","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"Bui, L.T., and Michalewicz, Z. (2010, January 18\u201323). An evolutionary multi-objective approach for dynamic mission planning. Proceedings of the IEEE Congress on Evolutionary Computation, Barcelona, Spain.","DOI":"10.1109\/CEC.2010.5586343"},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Tolt, G., Hedstr\u00f6m, J., Bruvoll, S., and Asprusten, M. (December, January 27). Multi-aspect path planning for enhanced ground combat simulation. Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence (SSCI), Honolulu, HI, USA.","DOI":"10.1109\/SSCI.2017.8280886"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Leenen, L., and Terlunen, A. (2013, January 25\u201327). A focussed dynamic path finding algorithm with constraints. Proceedings of the 2013 International Conference on Adaptive Science and Technology, Pretoria, South Africa.","DOI":"10.1109\/ICASTech.2013.6707501"},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"2234","DOI":"10.1109\/JSAC.2020.3000364","article-title":"Significant Sampling for Shortest Path Routing: A Deep Reinforcement Learning Solution","volume":"38","author":"Shao","year":"2020","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_80","doi-asserted-by":"crossref","unstructured":"Deva Sarma, H.K., Dutta, M.P., and Dutta, M.P. (2019, January 19\u201321). A Quality of Service Aware Routing Protocol for Mesh Networks Based on Congestion Prediction. Proceedings of the 2019 International Conference on Information Technology (ICIT), Bhubaneswar, India.","DOI":"10.1109\/ICIT48102.2019.00082"},{"key":"ref_81","unstructured":"Lozano-Garzon, C., Camelo, M., Vil\u00e0, P., and Donoso, Y. (2013, January 7\u201310). Green routing algorithm for Wireless Mesh Network: A multi-objective evolutionary approach. Proceedings of the 2013 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS), Toronto, ON, Canada. Available online: https:\/\/ieeexplore.ieee.org\/document\/6595762."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Cheng, C., Riley, R., Kumar, S.P.R., and Garcia-Luna-Aceves, J.J. (1989, January 19\u201322). A Loop-Free Extended Bellman-Ford Routing Protocol without Bouncing Effect. Proceedings of the Symposium Proceedings on Communications Architectures & Protocols, SIGCOMM \u201989, Austin, TX, USA.","DOI":"10.1145\/75246.75269"},{"key":"ref_83","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.cor.2017.04.011","article-title":"A multi-objective green UAV routing problem","volume":"88","author":"Coelho","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_84","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1007\/s10514-020-09926-9","article-title":"Multi-objective drone path planning for search and rescue with quality-of-service requirements","volume":"44","author":"Hayat","year":"2020","journal-title":"Auton. Robot."},{"key":"ref_85","unstructured":"Shaikh, M.T. (2020). Multi-Objective Intent-based Path Planning for Robots for Static and Dynamic Environments. [Ph.D. Thesis, Brigham Young University]. Available online: https:\/\/scholarsarchive.byu.edu\/etd\/8510\/."},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Golabi, M., Ghambari, S., Lepagnot, J., Jourdan, L., Br\u00e9villiers, M., and Idoumghar, L. (2020, January 19\u201324). Bypassing or flying above the obstacles? A novel multi-objective UAV path planning problem. Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK.","DOI":"10.1109\/CEC48606.2020.9185695"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/162\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:56:43Z","timestamp":1760122603000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,16]]},"references-count":86,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["a16030162"],"URL":"https:\/\/doi.org\/10.3390\/a16030162","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,16]]}}}