{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T18:53:52Z","timestamp":1773168832808,"version":"3.50.1"},"reference-count":207,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Portuguese Foundation for Science and Technology","award":["UIDB\/00308\/2020"],"award-info":[{"award-number":["UIDB\/00308\/2020"]}]},{"name":"Portuguese Foundation for Science and Technology","award":["UIDB\/00324\/2020"],"award-info":[{"award-number":["UIDB\/00324\/2020"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>A major area of application of multiobjective path problems and resolution algorithms is telecommunication network routing design, taking into account the extremely rapid technological and service evolutions. The need for explicit consideration of heterogeneous Quality of Service metrics makes it advantageous for the development of routing models where various technical\u2013economic aspects, often conflicting, should be tackled. Our work is focused on multiobjective path problem formulations and resolution methods and their applications to routing methods. We review basic concepts and present main formulations of multiobjective path problems, considering different types of objective functions. We outline the different types of resolution methods for these problems, including a classification and overview of relevant algorithms concerning different types of problems. Afterwards, we outline background concepts on routing models and present an overview of selected papers considered as representative of different types of applications of multiobjective path problem formulations and algorithms. A broad characterization of major types of path problems relevant in this context is shown regarding the overview of contributions in different technological and architectural network environments. Finally, we outline research trends in this area, in relation to recent technological evolutions in communication networks.<\/jats:p>","DOI":"10.3390\/a17060222","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T06:54:09Z","timestamp":1716360849000},"page":"222","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multiobjective Path Problems and Algorithms in Telecommunication Network Design\u2014Overview and Trends"],"prefix":"10.3390","volume":"17","author":[{"given":"Jos\u00e9","family":"Craveirinha","sequence":"first","affiliation":[{"name":"Institute for Systems Engineering and Computers at Coimbra, INESC Coimbra, University of Coimbra, 3030-290 Coimbra, Portugal"}]},{"given":"Jo\u00e3o","family":"Cl\u00edmaco","sequence":"additional","affiliation":[{"name":"Institute for Systems Engineering and Computers at Coimbra, INESC Coimbra, University of Coimbra, 3030-290 Coimbra, Portugal"}]},{"given":"Rita","family":"Gir\u00e3o-Silva","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Coimbra, 3030-290 Coimbra, Portugal"},{"name":"Institute for Systems Engineering and Computers at Coimbra, INESC Coimbra, University of Coimbra, 3030-290 Coimbra, Portugal"}]},{"given":"Marta","family":"Pascoal","sequence":"additional","affiliation":[{"name":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, 20133 Milano, Italy"},{"name":"Centre for Mathematics of the University of Coimbra (CMUC), Department of Mathematics, University of Coimbra, 3000-143 Coimbra, Portugal"},{"name":"Institute for Systems Engineering and Computers at Coimbra, INESC Coimbra, University of Coimbra, 3030-290 Coimbra, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1007\/978-1-4939-3094-4_26","article-title":"Multicriteria Analysis in Telecommunication Network Planning and Design: A Survey","volume":"Volume 233","author":"Greco","year":"2016","journal-title":"Multiple Criteria Decision Analysis\u2014State of the Art Surveys"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ben Amor, S., Teixeira de Almeida, A., Miranda, J.L., and Aktas, E. (2019). Advanced Studies in Multi-Criteria Decision Making, Chapman and Hall\/CRC. Chapter 2.","DOI":"10.1201\/9781315181363"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1111\/j.1475-3995.2010.00770.x","article-title":"A conceptual framework for multiple-criteria routing in QoS IP networks","volume":"18","author":"Wierzbicki","year":"2011","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1111\/j.1475-3995.2011.00815.x","article-title":"Multicriteria path and tree problems: Discussion on exact algorithms and applications","volume":"19","author":"Pascoal","year":"2012","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_5","unstructured":"Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. (1993). Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Inc."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","article-title":"A comparison of solution strategies for biobjective shortest path problems","volume":"36","author":"Raith","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_7","first-page":"425","article-title":"Probl\u00e8mes multicrit\u00e8res","volume":"16","author":"Vincke","year":"1974","journal-title":"Cah. Cent. D\u2019\u00e9tudes Rech. Op\u00e9rationelle"},{"key":"ref_8","first-page":"109","article-title":"Bicriterion Path Problems","volume":"Volume 177","author":"Fandel","year":"1980","journal-title":"Multiple Criteria Decision Making Theory and Application, Proceedings of the Third Conference Hagen\/K\u00f6nigswinter, West Germany, August 20\u201324, 1979"},{"key":"ref_9","first-page":"211","article-title":"Uma abordagem ao problema do trajecto \u00f3ptimo multiobjectivo","volume":"19","author":"Santos","year":"1999","journal-title":"Investig. Oper."},{"key":"ref_10","unstructured":"Martins, E., and Santos, J. (1999). The Labeling Algorithm for the Multiobjective Shortest Path Problem, CISUC, University of Coimbra. Technical Report 99\/005."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","article-title":"A bicriterion shortest path algorithm","volume":"11","author":"Martins","year":"1982","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","article-title":"On a multicriteria shortest path problem","volume":"16","author":"Martins","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00938761","article-title":"Shortest paths in networks with vector weights","volume":"46","author":"Corley","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0377-2217(91)90094-C","article-title":"A parametric approach to solving bicriterion shortest path problems","volume":"53","author":"Mote","year":"1991","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","article-title":"Multiobjective A*","volume":"38","author":"Stewart","year":"1991","journal-title":"J. ACM"},{"key":"ref_16","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","author":"Tung","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1023\/A:1012602011914","article-title":"Label Correcting Methods to Solve Multicriteria Shortest Path Problems","volume":"111","author":"Guerriero","year":"2001","journal-title":"J. Optim. Theory Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/net.10073","article-title":"A bicriterion approach for routing problems in multimedia networks","volume":"41","author":"Craveirinha","year":"2003","journal-title":"Networks"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10845-008-0169-2","article-title":"Path recovery in frontier search for multiobjective shortest path problems","volume":"21","author":"Mandow","year":"2010","journal-title":"J. Intell. Manuf."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ejor.2011.08.030","article-title":"A comparison of heuristic best-first algorithms for bicriterion shortest path problems","volume":"217","author":"Machuca","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/j.trb.2012.03.005","article-title":"Parametric search and problem decomposition for approximating Pareto-optimal paths","volume":"46","author":"Xie","year":"2012","journal-title":"Transp. Res. B Methodol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10288-013-0232-5","article-title":"Speeding up Martins\u2019 algorithm for multiple objective shortest path problems","volume":"11","author":"Demeyer","year":"2013","journal-title":"4OR"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Sanders, P., and Mandow, L. (2013, January 20\u201324). Parallel Label-Setting Multi-objective Shortest Path Search. Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, Cambridge, MA, USA.","DOI":"10.1109\/IPDPS.2013.89"},{"key":"ref_24","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_25","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_26","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10898-015-0324-1","article-title":"Lower bound sets for biobjective shortest path problems","volume":"64","author":"Machuca","year":"2016","journal-title":"J. Glob. Optim."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Giret, A., Kergosien, Y., Sauvanet, G., and Neron, E. (2016, January 23\u201325). An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem. Proceedings of the 5th International Conference on Operations Research and Enterprise Systems (ICORES 2016), Rome, Italy.","DOI":"10.5220\/0005757101970203"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2019.01.007","article-title":"A biobjective Dijkstra algorithm","volume":"276","author":"Colebrook","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"ref_29","first-page":"105424:1","article-title":"An Improved Multiobjective Shortest Path Algorithm","volume":"135","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"100908:1","DOI":"10.1016\/j.swevo.2021.100908","article-title":"Finding all Pareto optimal paths by simulating ripple relay race in multi-objective networks","volume":"64","author":"Hu","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1287\/ijoc.2021.1081","article-title":"An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem","volume":"34","author":"Kergosien","year":"2022","journal-title":"INFORMS J. Comput."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.22174","article-title":"Targeted multiobjective Dijkstra algorithm","volume":"82","author":"Kraus","year":"2023","journal-title":"Networks"},{"key":"ref_33","first-page":"103807:1","article-title":"Simple and efficient bi-objective search algorithms via fast dominance checks","volume":"314","author":"Yeoh","year":"2023","journal-title":"Artif. Intell."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"10410","DOI":"10.1109\/TITS.2023.3282069","article-title":"Fast One-to-Many Multicriteria Shortest Path Search","volume":"24","author":"Kurbanov","year":"2023","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_35","first-page":"1680","article-title":"Improving Bi-Objective Shortest Path Search with Early Pruning","volume":"Volume 372","author":"Gal","year":"2023","journal-title":"Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0305-0548(90)90042-6","article-title":"An interactive approach to identify the best compromise solution for two objective shortest path problems","volume":"17","author":"Current","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0377-2217(94)90320-4","article-title":"An interactive procedure using domination cones for bicriterion shortest path problems","volume":"72","author":"Murthy","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1287\/mnsc.40.7.891","article-title":"Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems","volume":"40","author":"Henig","year":"1994","journal-title":"Manag. Sci."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","article-title":"An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions","volume":"26","author":"Current","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1002\/net.10077","article-title":"The determination of the path with minimum-cost norm value","volume":"41","author":"Martins","year":"2003","journal-title":"Networks"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/s11518-006-5015-5","article-title":"An automated reference point-like approach for multicriteria shortest path problems","volume":"15","author":"Craveirinha","year":"2006","journal-title":"J. Syst. Sci. Syst. Eng."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.endm.2010.05.078","article-title":"Search for the best compromise solution on Multiobjective shortest path problem","volume":"36","author":"Sauvanet","year":"2010","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Fouchal, H., Gandibleux, X., and Lehu\u00e9d\u00e9, F. (2011, January 11\u201315). Preferred solutions computed with a label setting algorithm based on Choquet integral for multi-objective shortest paths. Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making (MDCM), Paris, France.","DOI":"10.1109\/SMDCM.2011.5949282"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ejor.2014.05.008","article-title":"Multiobjective shortest path problems with lexicographic goal-based preferences","volume":"239","author":"Pulido","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"149","DOI":"10.17535\/crorr.2018.0012","article-title":"A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path","volume":"9","author":"Shirdel","year":"2018","journal-title":"Croat. Oper. Res. Rev."},{"key":"ref_46","first-page":"104977:1","article-title":"Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points","volume":"121","author":"Pugliese","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","article-title":"A survey and annotated bibliography of multiobjective combinatorial optimization","volume":"22","author":"Ehrgott","year":"2000","journal-title":"OR-Spektrum"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Ehrgott, M., and Gandibleux, X. (2002). Multiple Criteria Optimization. State of the Art Annotated Bibliographic Surveys, Springer.","DOI":"10.1007\/b101915"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0377-2217(86)90180-3","article-title":"Multiobjective design of transportation networks: Taxonomy and annotation","volume":"26","author":"Current","year":"1986","journal-title":"Eur. J. Oper. Res."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/0377-2217(93)90140-I","article-title":"Multiobjective transportation network design and routing problems: Taxonomy and annotation","volume":"65","author":"Current","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"ref_51","first-page":"192","article-title":"A classification of bicriterion shortest path (BSP) algorithms","volume":"17","author":"Skriver","year":"2000","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"269","DOI":"10.2478\/v10006-007-0023-2","article-title":"Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms","volume":"17","author":"Tarapata","year":"2007","journal-title":"Int. J. Appl. Math. Comp. Sci."},{"key":"ref_53","first-page":"121","article-title":"A computational comparison of some bicriterion shortest path algorithms","volume":"13","author":"Huarng","year":"1996","journal-title":"J. Chin. Inst. Ind. Eng."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-94-007-4722-7_46","article-title":"Labeling Methods for the General Case of the Multi-objective Shortest Path Problem\u2014A Computational Study","volume":"Volume 61","author":"Madureira","year":"2013","journal-title":"Computational Intelligence and Decision Making: Trends and Applications"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1002\/net.20077","article-title":"Near-shortest and K-shortest simple paths","volume":"46","author":"Carlyle","year":"2005","journal-title":"Networks"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"ref_57","unstructured":"Ford, L.R. (1956). Network Flow Theory, RAND Corporation. Technical Report P-923."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Q. Appl. Math."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10479-009-0655-8","article-title":"A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid","volume":"175","author":"Grabisch","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0165-0114(94)00174-6","article-title":"Fuzzy integral in multicriteria decision making","volume":"69","author":"Grabisch","year":"1995","journal-title":"Fuzzy Sets Syst."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1162\/EVCO_a_00156","article-title":"Deterministic Agent-Based Path Optimization by Mimicking the Spreading of Ripples","volume":"24","author":"Hu","year":"2016","journal-title":"Evol. Comput."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.cor.2012.07.008","article-title":"On an exact method for the constrained shortest path problem","volume":"40","author":"Lozano","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0377-2217(84)90269-8","article-title":"An algorithm for ranking paths that may contain cycles","volume":"18","author":"Martins","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"ref_65","first-page":"185","article-title":"Pareto Shortest Paths is Often Feasible in Practice","volume":"Volume 2141","author":"Brodal","year":"2001","journal-title":"Proceedings of the 5th International Workshop on Algorithm Engineering (WAE 2001)"},{"key":"ref_66","first-page":"47","article-title":"A new shortest paths ranking algorithm","volume":"20","author":"Martins","year":"2000","journal-title":"Investig. Oper."},{"key":"ref_67","first-page":"47","article-title":"A new improvement for a K shortest paths algorithm","volume":"21","author":"Martins","year":"2001","journal-title":"Investig. Oper."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","article-title":"Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison","volume":"Volume 1668","author":"Vitter","year":"1999","journal-title":"Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE\u201999)"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1287\/opre.49.3.423.11217","article-title":"A Class of Label-Correcting Methods for the K Shortest Paths Problem","volume":"49","author":"Guerriero","year":"2001","journal-title":"Oper. Res."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k Shortest Paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM J. Comput."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","article-title":"Deviation algorithms for ranking shortest paths","volume":"10","author":"Martins","year":"1999","journal-title":"Int. J. Found. Comput. Sci."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-44867-5_14","article-title":"A Lazy Version of Eppstein\u2019s K Shortest Paths Algorithm","volume":"Volume 2647","author":"Jansen","year":"2003","journal-title":"Proceedings of the Second International Workshop on Experimental and Efficient Algorithms (WEA 2003)"},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the K Shortest Loopless Paths in a Network","volume":"17","author":"Yen","year":"1971","journal-title":"Manag. Sci."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","article-title":"An efficient algorithm for K shortest simple paths","volume":"12","author":"Katoh","year":"1982","journal-title":"Networks"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10288-002-0010-2","article-title":"A new implementation of Yen\u2019s ranking loopless paths algorithm","volume":"1","author":"Martins","year":"2003","journal-title":"4OR"},{"key":"ref_76","first-page":"149","article-title":"The two-phases method: An efficient procedure to solve biobjective combinatorial optimization problems","volume":"20","author":"Ulungu","year":"1995","journal-title":"Found. Comput. Decis. Sci."},{"key":"ref_77","unstructured":"Cohon, J.L. (1978). Multiobjective Programming and Planning, Academic Press. Mathematics in Science and Engineering."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual algorithm for the constrained shortest path problem","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/trsc.1120.0418","article-title":"A Reference Point Approach for the Resource Constrained Shortest Path Problems","volume":"47","author":"Pugliese","year":"2013","journal-title":"Transp. Sci."},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(84)90011-0","article-title":"On a special class of bicriterion path problems","volume":"17","author":"Martins","year":"1984","journal-title":"Eur. J. Oper. Res."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(85)90030-X","article-title":"The maximum covering\/shortest path problem: A multiobjective network design and routing formulation","volume":"21","author":"Current","year":"1985","journal-title":"Eur. J. Oper. Res."},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1111\/j.1540-5915.1988.tb00282.x","article-title":"The Minimum-Covering\/Shortest-Path Problem","volume":"19","author":"Current","year":"1988","journal-title":"Decis. Sci."},{"key":"ref_83","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.21.3.188","article-title":"The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks","volume":"21","author":"Current","year":"1987","journal-title":"Transp. Sci."},{"key":"ref_84","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/S0305-0548(98)00036-7","article-title":"On the sum-max bicriterion path problem","volume":"25","year":"1998","journal-title":"Comput. Oper. Res."},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10288-005-0074-x","article-title":"Martins\u2019 algorithm revisited for multi-objective shortest path problems with a MaxMin cost function","volume":"4","author":"Gandibleux","year":"2006","journal-title":"4OR"},{"key":"ref_86","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ejor.2008.09.036","article-title":"The tricriterion shortest path problem with at least two bottleneck objective functions","volume":"198","author":"Pinto","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1016\/j.cor.2010.01.005","article-title":"On algorithms for the tricriteria shortest path problems with two bottleneck objective functions","volume":"37","author":"Pinto","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1016\/j.ejor.2010.06.035","article-title":"An aggregate label setting policy for the multi-objective shortest path problem","volume":"207","author":"Iori","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_89","doi-asserted-by":"crossref","first-page":"1969","DOI":"10.1016\/j.cor.2011.09.006","article-title":"Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization","volume":"39","author":"Bornstein","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_90","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10288-013-0229-0","article-title":"Bicriteria path problem minimizing the cost and minimizing the number of labels","volume":"11","author":"Pascoal","year":"2013","journal-title":"4OR"},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1007\/s10957-017-1145-9","article-title":"Shortest Paths with Shortest Detours: A Biobjective Routing Problem","volume":"174","author":"Torchiani","year":"2017","journal-title":"J. Optim. Theory Appl."},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-319-77510-4_3","article-title":"The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems","volume":"Volume 32","author":"Adamatzky","year":"2018","journal-title":"Shortest Path Solvers. From Software to Wetware"},{"key":"ref_93","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","article-title":"Algorithms for the quickest path problem and the enumeration of quickest paths","volume":"18","author":"Rosen","year":"1991","journal-title":"Comput. Oper. Res."},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(97)00008-4","article-title":"An algorithm for the quickest path problem","volume":"20","author":"Martins","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"ref_95","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(84)90100-8","article-title":"An algorithm to determine a path with minimal cost\/capacity ratio","volume":"8","author":"Martins","year":"1984","journal-title":"Discret. Appl. Math."},{"key":"ref_96","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0305-0548(88)90031-7","article-title":"Minimum cost-reliability ratio path problem","volume":"15","author":"Ahuja","year":"1988","journal-title":"Comput. Oper. Res."},{"key":"ref_97","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","article-title":"The quickest path problem","volume":"17","author":"Chen","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"ref_98","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0166-218X(97)00008-5","article-title":"Paths with minimum range and ratio of arc lengths","volume":"78","author":"Hansen","year":"1997","journal-title":"Discret. Appl. Math."},{"key":"ref_99","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2002002","article-title":"The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets","volume":"36","author":"Boffey","year":"2002","journal-title":"RAIRO Oper. Res."},{"key":"ref_100","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/S0305-0548(02)00112-0","article-title":"Solving bicriteria 0-1 knapsack problems using a labeling algorithm","volume":"30","author":"Captivo","year":"2003","journal-title":"Comput. Oper. Res."},{"key":"ref_101","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/S0305-0548(03)00195-3","article-title":"A label-setting algorithm for finding a quickest path","volume":"31","author":"Park","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"ref_102","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.ejor.2007.06.048","article-title":"Optimal paths in bi-attribute networks with fractional cost functions","volume":"190","author":"Soroush","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_103","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2009.01.002","article-title":"Finding non-dominated bicriteria shortest pairs of disjoint simple paths","volume":"36","author":"Pascoal","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_104","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1016\/j.cor.2009.06.026","article-title":"Labeling algorithms for multiple objective integer knapsack problems","volume":"37","author":"Figueira","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_105","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cor.2010.04.010","article-title":"Minimum cost path problems with relays","volume":"38","author":"Laporte","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_106","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10287-012-0138-2","article-title":"Algorithms for the quickest path problem and the reliable quickest path problem","volume":"9","author":"Calvete","year":"2012","journal-title":"Comput. Manag. Sci."},{"key":"ref_107","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.21473","article-title":"Min-Max quickest path problems","volume":"60","author":"Ruzika","year":"2012","journal-title":"Networks"},{"key":"ref_108","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2014.04.015","article-title":"A lower bound for the quickest path problem","volume":"50","author":"Ghiani","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_109","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.ejor.2014.04.028","article-title":"Fast and fine quickest path algorithm","volume":"238","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_110","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1007\/s11590-016-1073-x","article-title":"The energy-constrained quickest path problem","volume":"11","author":"Calvete","year":"2017","journal-title":"Optim. Lett."},{"key":"ref_111","doi-asserted-by":"crossref","first-page":"2045","DOI":"10.1111\/itor.12624","article-title":"On a relaxed maximally disjoint path pair problem: A bicriteria approach","volume":"27","author":"Pascoal","year":"2020","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_112","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1111\/itor.13060","article-title":"Finding shortest and dissimilar paths","volume":"29","author":"Moghanni","year":"2022","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_113","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.10.2.113","article-title":"On the Fastest Route for Convoy-Type Traffic in Flowrate-Constrained Networks","volume":"10","author":"Moore","year":"1976","journal-title":"Transp. Sci."},{"key":"ref_114","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-006-0068-x","article-title":"A comprehensive survey on quickest path problem","volume":"147","author":"Pascoal","year":"2006","journal-title":"Ann. Oper. Res."},{"key":"ref_115","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."},{"key":"ref_116","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cor.2016.06.022","article-title":"Analysis of FPTASes for the multi-objective shortest path problem","volume":"78","author":"Breugem","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_117","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/s00224-007-9096-4","article-title":"Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications","volume":"45","author":"Tsaggouris","year":"2009","journal-title":"Theor. Comput. Syst."},{"key":"ref_118","doi-asserted-by":"crossref","unstructured":"B\u00f6kler, F., and Chimani, M. (2020, January 5\u20136). Approximating Multiobjective Shortest Path in Practice. Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX), Salt Lake City, UT, USA.","DOI":"10.1137\/1.9781611976007.10"},{"key":"ref_119","doi-asserted-by":"crossref","unstructured":"de las Casas, P.M., 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_120","first-page":"20","article-title":"Hierarchical Multiobjective Routing in MPLS Networks with Two Service Classes\u2014A Meta-Heuristic Solution","volume":"3","author":"Craveirinha","year":"2009","journal-title":"J. Telecommun. Inform. Technol."},{"key":"ref_121","doi-asserted-by":"crossref","first-page":"3119","DOI":"10.1016\/j.cor.2012.03.013","article-title":"A simulated annealing for multi-criteria network path problems","volume":"39","author":"Liu","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_122","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, X., and Ruiz, R. (2018, January 9\u201311). A Fast Algorithm for Finding the Bi-objective Shortest Path in Complicated Networks. Proceedings of the 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design (CSCWD), Nanjing, China.","DOI":"10.1109\/CSCWD.2018.8465299"},{"key":"ref_123","first-page":"104","article-title":"Traffic Engineering Approaches Using Multicriteria Optimization Techniques","volume":"Volume 6649","author":"Verchere","year":"2011","journal-title":"Proceedings of the 9th IFIP TC6 International Conference on Wired\/Wireless Internet Communications, WWIC 2011"},{"key":"ref_124","doi-asserted-by":"crossref","first-page":"4403","DOI":"10.1016\/j.asoc.2013.06.011","article-title":"Multiobjective optimization of MPLS-IP networks with a variable neighborhood genetic algorithm","volume":"13","author":"Onety","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_125","doi-asserted-by":"crossref","unstructured":"Zheng, S., Zheng, C., and Li, W. (2022, January 28\u201330). Research on Multiobjective Shortest Path Based on Genetic Algorithm. Proceedings of the 2022 2nd International Conference on Computer Science and Blockchain (CCSB), Wuhan, China.","DOI":"10.1109\/CCSB58128.2022.00030"},{"key":"ref_126","doi-asserted-by":"crossref","first-page":"106363:1","DOI":"10.1016\/j.cor.2023.106363","article-title":"A hybrid modified-NSGA-II VNS algorithm for the Multi-Objective Critical Disruption Path Problem","volume":"160","author":"Granata","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"ref_127","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. Evolut. Comput."},{"key":"ref_128","unstructured":"Zitzler, E., Laumanns, M., and Thiele, L. (2001). SPEA2: Improving the Strength Pareto Evolutionary Algorithm, Computer Engineering and Networks Laboratory, ETH Zurich. TIK Report 103."},{"key":"ref_129","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_130","doi-asserted-by":"crossref","unstructured":"Coello Coello, C.A., and Lechuga, M.S. (2002, January 12\u201317). MOPSO: A proposal for multiple objective particle swarm optimization. Proceedings of the 2002 Congress on Evolutionary Computation (CEC\u201902), Honolulu, HI, USA.","DOI":"10.1109\/CEC.2002.1004388"},{"key":"ref_131","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 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007), Chengdu, China. Advances in Intelligent Systems Research.","DOI":"10.2991\/iske.2007.217"},{"key":"ref_132","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/10106049.2019.1595176","article-title":"An improved ant colony optimization-based algorithm for user-centric multi-objective path planning for ubiquitous environments","volume":"36","author":"Masoumi","year":"2021","journal-title":"Geocarto Int."},{"key":"ref_133","first-page":"100644:1","article-title":"A deep neural network with a fuzzy multi-objective optimization model for fault analysis in an elastic optical network","volume":"43","year":"2022","journal-title":"Opt. Switch. Netw."},{"key":"ref_134","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","article-title":"Greedy Randomized Adaptive Search Procedures","volume":"Volume 57","author":"Glover","year":"2003","journal-title":"Handbook of Metaheuristics"},{"key":"ref_135","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0377-2217(93)90142-A","article-title":"Multiobjective routing of hazardous materials in stochastic networks","volume":"65","author":"Wijeratne","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"ref_136","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00291-018-0543-1","article-title":"Bi-criteria path problem with minimum length and maximum survival probability","volume":"41","author":"Halman","year":"2019","journal-title":"OR Spectr."},{"key":"ref_137","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1007\/s12652-017-0601-6","article-title":"Multi-criteria shortest path for rough graph","volume":"9","author":"Majumder","year":"2018","journal-title":"J. Amb. Intel. Hum. Comput."},{"key":"ref_138","doi-asserted-by":"crossref","first-page":"8975","DOI":"10.1007\/s00500-019-04423-3","article-title":"Uncertain programming models for multi-objective shortest path problem with uncertain parameters","volume":"24","author":"Majumder","year":"2020","journal-title":"Soft Comput."},{"key":"ref_139","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0165-0114(98)00054-2","article-title":"A shortest path problem on a network with fuzzy arc lengths","volume":"109","author":"Okada","year":"2000","journal-title":"Fuzzy Set. Syst."},{"key":"ref_140","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s40747-020-00234-4","article-title":"Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach","volume":"7","author":"Bagheri","year":"2021","journal-title":"Compl. Intell. Syst."},{"key":"ref_141","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s40747-022-00825-3","article-title":"A deterministic and nature-inspired algorithm for the fuzzy multi-objective path optimization problem","volume":"9","author":"Ma","year":"2023","journal-title":"Complex Intell. Syst."},{"key":"ref_142","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10100-007-0044-9","article-title":"A meta-model for multiobjective routing in MPLS networks","volume":"16","author":"Craveirinha","year":"2008","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"ref_143","doi-asserted-by":"crossref","unstructured":"Pi\u00f3ro, M., and Medhi, D. (2004). Routing, Flow, and Capacity Design in Communication and Computer Networks, Elsevier.","DOI":"10.1016\/B978-012557189-0\/50011-1"},{"key":"ref_144","unstructured":"Medhi, D., and Ramasamy, K. (2018). Network Routing\u2014Algorithms, Protocols, and Architectures, Elsevier. [2nd ed.]."},{"key":"ref_145","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0166-5316(99)00027-9","article-title":"Optimization and design of network routing using refined asymptotic approximations","volume":"36\u201337","author":"Mitra","year":"1999","journal-title":"Perform. Eval."},{"key":"ref_146","unstructured":"Steuer, R.E. (1986). Multiple Criteria Optimization: Theory, Computation, and Application, Wiley. Probability and Mathematical Statistics."},{"key":"ref_147","unstructured":"Widyono, R. (1994). The Design and Evaluation of Routing Algorithms for Real-Time Channels, University of California at Berkeley & International Computer Science Institute. Technical Report TR-94-024."},{"key":"ref_148","unstructured":"van der Zee, M., and Heijenk, G. (1999). Quality of Service Routing: State of the Art Report, Centre for Telematics and Information Technology (CTIT). Report 1\/0362-FCP NB 102 88 Uen."},{"key":"ref_149","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TNET.2002.801397","article-title":"Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet","volume":"10","author":"Sobrinho","year":"2002","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_150","unstructured":"Kuipers, F.A., Korkmaz, T., Krunz, M., and Van Mieghem, P. (2002). A Review of Constraint-Based Routing Algorithms, Delft University of Technology. Technical Report."},{"key":"ref_151","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1109\/TNET.2005.852882","article-title":"Conditions that impact the complexity of QoS routing","volume":"13","author":"Kuipers","year":"2005","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_152","first-page":"197","article-title":"A comparison of exact and \u03b5-approximation algorithms for constrained routing","volume":"Volume 3976","author":"Boavida","year":"2006","journal-title":"Proceedings of the NETWORKING 2006\u2014Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 5th International IFIP-TC6 Networking Conference"},{"key":"ref_153","doi-asserted-by":"crossref","unstructured":"Sobrinho, J.L., and Ferreira, M.A. (2020, January 10\u201314). Routing on Multiple Optimality Criteria. Proceedings of the SIGCOMM\u201920: Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, Virtual Event.","DOI":"10.1145\/3387514.3405864"},{"key":"ref_154","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s11107-015-0524-0","article-title":"Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: A lexicographic approach","volume":"31","author":"Gomes","year":"2016","journal-title":"Photonic Netw. Commun."},{"key":"ref_155","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1109\/JSAC.2003.816624","article-title":"Novel algorithms for shared segment protection","volume":"21","author":"Xu","year":"2003","journal-title":"IEEE J. Sel. Area Commun."},{"key":"ref_156","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/LCOMM.2002.803477","article-title":"A disjoint path selection scheme with shared risk link groups in GMPLS networks","volume":"6","author":"Oki","year":"2002","journal-title":"IEEE Commun. Lett."},{"key":"ref_157","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s11750-021-00619-9","article-title":"An exact lexicographic approach for the maximally risk-disjoint\/minimal cost path pair problem in telecommunication networks","volume":"30","author":"Pascoal","year":"2022","journal-title":"TOP"},{"key":"ref_158","first-page":"266","article-title":"Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths","volume":"Volume 12716","author":"Dolev","year":"2021","journal-title":"Proceedings of the Cyber Security Cryptography and Machine Learning. 5th International Symposium, CSCML 2021"},{"key":"ref_159","first-page":"103","article-title":"Faster 2-Disjoint-Shortest-Paths Algorithm","volume":"Volume 12159","author":"Fernau","year":"2020","journal-title":"Computer Science\u2014Theory and Applications, Proceedings of the 15th International Computer Science Symposium in Russia (CSR 2020), Yekaterinburg, Russia, 29 June-3 July 2020"},{"key":"ref_160","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.013","article-title":"Internet packet routing: Application of a K-quickest path algorithm","volume":"181","author":"Pascoal","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_161","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0305-0548(03)00250-8","article-title":"An algorithm for ranking quickest simple paths","volume":"32","author":"Pascoal","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_162","unstructured":"Key, P., and Smith, D. (1999, January 7\u201311). A multiple objective routing algorithm for integrated communication networks. Proceedings of the 16th International Teletraffic Congress (ITC16)\u2014Teletraffic Engineering in a Competitive World, Edinburgh, UK. Teletraffic Science and Engineering."},{"key":"ref_163","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1019160226383","article-title":"Routing with multiple QoS requirements for supporting multimedia applications","volume":"9","author":"Pornavalai","year":"1998","journal-title":"Telecommun. Syst."},{"key":"ref_164","unstructured":"Beugnies, F., and Gandibleux, X. (2006, January 19\u201323). A multiobjective routing procedure for IP networks. Proceedings of the 18th International Conference on Multiple Criteria Decision Analysis (MCDM 2006), Chania, Greece."},{"key":"ref_165","doi-asserted-by":"crossref","unstructured":"Bhat, S., and Rouskas, G.N. (2016, January 22\u201327). On routing algorithms for open marketplaces of path services. Proceedings of the 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICC.2016.7511582"},{"key":"ref_166","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/65.941835","article-title":"Optical networking and real-time provisioning: An integrated vision for the next-generation Internet","volume":"15","author":"Assi","year":"2001","journal-title":"IEEE Netw."},{"key":"ref_167","doi-asserted-by":"crossref","unstructured":"Markovic, G., and Acimovic-Raspopovic, V. (2005, January 21\u201324). An Adaptive Multi-criteria Routing Algorithm for Wavelength Routed Optical Networks. Proceedings of the EUROCON 2005\u2014The International Conference on \u201cComputer as a Tool\u201d, Belgrade, Serbia.","DOI":"10.1109\/EURCON.2005.1630210"},{"key":"ref_168","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11107-009-0192-z","article-title":"A bicriteria routing model for multi-fibre WDM networks","volume":"18","author":"Gomes","year":"2009","journal-title":"Photonic Netw. Commun."},{"key":"ref_169","doi-asserted-by":"crossref","unstructured":"Gomes, T., Martins, L., Silva, J., Ferreira, N.G., Craveirinha, J., Cl\u00edmaco, J., Cadime, R., and M\u00f3nica, C. (2012, January 3\u20135). Protected bicriteria paths in transport networks. Proceedings of the 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems, St. Petersburg, Russia.","DOI":"10.1109\/ICUMT.2012.6459761"},{"key":"ref_170","first-page":"399","article-title":"An exact approach for finding bicriteria maximally SRLG-disjoint\/shortest path pairs in telecommunication networks","volume":"61","author":"Craveirinha","year":"2023","journal-title":"INFOR Inform. Syst. Oper. Res."},{"key":"ref_171","doi-asserted-by":"crossref","first-page":"101799","DOI":"10.1109\/ACCESS.2023.3316211","article-title":"Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks","volume":"11","author":"Xu","year":"2023","journal-title":"IEEE Access"},{"key":"ref_172","doi-asserted-by":"crossref","unstructured":"Chen, X., Cai, H., and Wolf, T. (2015, January 10\u201313). Multi-criteria Routing in Networks with Path Choices. Proceedings of the 2015 IEEE 23rd International Conference on Network Protocols (ICNP), San Francisco, CA, USA.","DOI":"10.1109\/ICNP.2015.36"},{"key":"ref_173","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1016\/j.ejor.2004.03.047","article-title":"On a bi-dimensional dynamic alternative routing method","volume":"166","author":"Martins","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_174","doi-asserted-by":"crossref","first-page":"112","DOI":"10.2307\/1427273","article-title":"Routing in Circuit-Switched Networks: Optimization, Shadow Prices and Decentralization","volume":"20","author":"Kelly","year":"1988","journal-title":"Adv. Appl. Probab."},{"key":"ref_175","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1111\/j.1475-3995.2009.00669.x","article-title":"Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: A heuristic solution","volume":"16","author":"Craveirinha","year":"2009","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_176","first-page":"196","article-title":"A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes","volume":"Volume 312","author":"Korytowski","year":"2009","journal-title":"Proceedings of the 23rd IFIP TC7 Conference on System Modeling and Optimization CSMO 2007"},{"key":"ref_177","unstructured":"Yuan, D. (2003, January 3). A bicriteria optimization approach for robust OSPF routing. Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003), Kansas City, MO, USA."},{"key":"ref_178","unstructured":"Thirumalasetty, S., and Medhi, D. (2001). MPLS Traffic Engineering for Survivable Book-Ahead Guaranteed Services, University of Missouri\u2014Kansas City. Report."},{"key":"ref_179","unstructured":"Ben-Ameur, W., and Petrowski, A. (2003, January 27\u201329). Utilizing evolutionary algorithms for multiobjective problems in traffic engineering. Proceedings of the INOC 2003: International Network Optimization Conference, Paris, France."},{"key":"ref_180","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s11518-015-5262-4","article-title":"Multiobjective routing in multiservice MPLS networks with traffic splitting\u2014A network flow approach","volume":"24","author":"Craveirinha","year":"2015","journal-title":"J. Syst. Sci. Syst. Eng."},{"key":"ref_181","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s00158-002-0276-1","article-title":"The normalized normal constraint method for generating the Pareto frontier","volume":"25","author":"Messac","year":"2003","journal-title":"Struct. Multidiscip. Optim."},{"key":"ref_182","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1080\/0305215X.2016.1235706","article-title":"A network-wide exact optimization approach for multiobjective routing with path protection in multiservice multiprotocol label switching networks","volume":"49","author":"Craveirinha","year":"2017","journal-title":"Eng. Optim."},{"key":"ref_183","unstructured":"Malakooti, B., and Thomas, I. (2006, January 23\u201325). A Distributed Composite Multiple Criteria Routing Using Distance Vector. Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, Ft. Lauderdale, FL, USA."},{"key":"ref_184","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1016\/j.apm.2008.02.003","article-title":"A biobjective optimization model for routing in mobile ad hoc networks","volume":"33","author":"Guerriero","year":"2009","journal-title":"Appl. Math. Model."},{"key":"ref_185","doi-asserted-by":"crossref","unstructured":"Bhunia, S.S., Roy, S., and Mukherjee, N. (2014, January 24\u201327). Adaptive learning assisted routing in Wireless Sensor Network using Multi Criteria Decision model. Proceedings of the 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Delhi, India.","DOI":"10.1109\/ICACCI.2014.6968354"},{"key":"ref_186","doi-asserted-by":"crossref","unstructured":"Das, B., Bhunia, S.S., Roy, S., and Mukherjee, N. (2015, January 12\u201314). Multi criteria routing in wireless sensor network using weighted product model and relative rating. Proceedings of the 2015 Applications and Innovations in Mobile Computing (AIMoC), Kolkata, India.","DOI":"10.1109\/AIMOC.2015.7083841"},{"key":"ref_187","doi-asserted-by":"crossref","unstructured":"Suh, Y.H., Kim, K.T., Shin, D.R., and Youn, H.Y. (2015, January 24\u201327). Traffic-Aware Energy Efficient Routing (TEER) Using Multi-Criteria Decision Making for Wireless Sensor Network. Proceedings of the 2015 5th International Conference on IT Convergence and Security (ICITCS), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICITCS.2015.7293029"},{"key":"ref_188","doi-asserted-by":"crossref","first-page":"3415","DOI":"10.1007\/s11277-016-3784-9","article-title":"Multi-criteria Routing in a Partitioned Wireless Sensor Network","volume":"94","author":"Rehena","year":"2017","journal-title":"Wirel. Pers. Commun."},{"key":"ref_189","doi-asserted-by":"crossref","unstructured":"Sahli, N., Jabeur, N., Khan, I.M., and Badra, M. (2012, January 7\u201310). Towards a Generic Framework for Wireless Sensor Network Multi-Criteria Routing. Proceedings of the 2012 5th International Conference on New Technologies, Mobility and Security (NTMS), Istanbul, Turkey.","DOI":"10.1109\/NTMS.2012.6208737"},{"key":"ref_190","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s11235-015-0083-9","article-title":"Lexicographical minimization of routing hops in hop-constrained node survivable networks","volume":"62","author":"Gouveia","year":"2016","journal-title":"Telecommun. Syst."},{"key":"ref_191","first-page":"100574:1","article-title":"Reduction of energy consumption and delay of control packets in Software-Defined Networking","volume":"31","author":"Naseri","year":"2021","journal-title":"Sustain. Comput. Infor. Syst."},{"key":"ref_192","unstructured":"\u00c7etinkaya, E.K., and Sterbenz, J.P. (2013, January 4\u20137). A taxonomy of network challenges. Proceedings of the 2013 9th International Conference on the Design of Reliable Communication Networks (DRCN), Budapest, Hungary."},{"key":"ref_193","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s11235-015-9987-7","article-title":"Future research directions in design of reliable communication systems","volume":"60","author":"Rak","year":"2015","journal-title":"Telecommun. Syst."},{"key":"ref_194","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.osn.2014.05.004","article-title":"Measuring the survivability of networks to geographic correlated failures","volume":"14","author":"Long","year":"2014","journal-title":"Opt. Switch. Netw."},{"key":"ref_195","doi-asserted-by":"crossref","first-page":"100619:1","DOI":"10.1016\/j.osn.2021.100619","article-title":"Disaster resilience of optical networks: State of the art, challenges, and opportunities","volume":"42","author":"Rak","year":"2021","journal-title":"Opt. Switch. Netw."},{"key":"ref_196","first-page":"89","article-title":"Implementation of Geographic Diversity in Resilient Telecommunication Networks","volume":"Volume 437","author":"Almeida","year":"2023","journal-title":"Proceedings of the Operational Research. IO 2022\u2014OR in Turbulent Times: Adaptation and Resilience"},{"key":"ref_197","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1002\/net.21778","article-title":"Efficient heuristics for determining node-disjoint path pairs visiting specified nodes","volume":"70","author":"Martins","year":"2017","journal-title":"Networks"},{"key":"ref_198","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/j.ifacol.2022.09.455","article-title":"A Problem-Specific Branch-and-Bound Algorithm for the Protected Shortest Simple Path Problem with Must-Pass Nodes","volume":"55","author":"Ogorodnikov","year":"2022","journal-title":"IFAC PapersOnLine"},{"key":"ref_199","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MCOM.2012.6194382","article-title":"Power savings versus network performance in dynamically provisioned WDM networks","volume":"50","author":"Wiatr","year":"2012","journal-title":"IEEE Commun. Mag."},{"key":"ref_200","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MCOM.2012.6295711","article-title":"Toward cloud-ready transport networks","volume":"50","author":"Contreras","year":"2012","journal-title":"IEEE Commun. Mag."},{"key":"ref_201","doi-asserted-by":"crossref","first-page":"1776","DOI":"10.1109\/COMST.2015.2431731","article-title":"Routing and Spectrum Allocation in Elastic Optical Networks: A Tutorial","volume":"17","author":"Chatterjee","year":"2015","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_202","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1364\/JOCN.11.000568","article-title":"Generic Dijkstra for optical networks","volume":"11","author":"Jajszczyk","year":"2019","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_203","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s11107-017-0700-5","article-title":"Improved dynamic routing algorithms in elastic optical networks","volume":"34","author":"Olszewski","year":"2017","journal-title":"Photonic Netw. Commun."},{"key":"ref_204","doi-asserted-by":"crossref","first-page":"111633","DOI":"10.1109\/ACCESS.2021.3101998","article-title":"Routing, Modulation and Spectrum Assignment Algorithm Using Multi-Path Routing and Best-Fit","volume":"9","author":"Ruiz","year":"2021","journal-title":"IEEE Access"},{"key":"ref_205","first-page":"1220227:1","article-title":"From classical to quantum machine learning: Survey on routing optimization in 6G software defined networking","volume":"4","author":"Bouchmal","year":"2023","journal-title":"Front. Commun. Netw."},{"key":"ref_206","doi-asserted-by":"crossref","unstructured":"Urgelles, H., Picazo-Martinez, P., Garcia-Roger, D., and Monserrat, J.F. (2022). Multi-Objective Routing Optimization for 6G Communication Networks Using a Quantum Approximate Optimization Algorithm. Sensors, 22.","DOI":"10.3390\/s22197570"},{"key":"ref_207","first-page":"e4846:1","article-title":"Optimal traffic routing in the network virtualization context","volume":"34","author":"Meddeb","year":"2021","journal-title":"Int. J. Commun. Syst."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/6\/222\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:46:08Z","timestamp":1760107568000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/6\/222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":207,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["a17060222"],"URL":"https:\/\/doi.org\/10.3390\/a17060222","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,22]]}}}