{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:20:28Z","timestamp":1742930428470,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053475"},{"type":"electronic","value":"9783030053482"}],"license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05348-2_17","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T02:24:51Z","timestamp":1546223091000},"page":"184-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems"],"prefix":"10.1007","author":[{"given":"Jakob","family":"Bossek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Grimme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Bossek, J.: ecr 2.0: a modular framework for evolutionary computation in R. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2017, pp. 1187\u20131193 (2017). https:\/\/doi.org\/10.1145\/3067695.3082470","DOI":"10.1145\/3067695.3082470"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bossek, J.: grapherator: a modular multi-step graph generator. J. Open Source Softw. 3(22), 528 (2018). https:\/\/doi.org\/10.21105\/joss.00528","DOI":"10.21105\/joss.00528"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Bossek, J., Grimme, C.: A pareto-beneficial sub-tree mutation for the multi-criteria minimum spanning tree problem. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 3280\u20133287. IEEE, Honolulu (2017). https:\/\/doi.org\/10.1109\/SSCI.2017.8285183","DOI":"10.1109\/SSCI.2017.8285183"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Bossek, J., Grimme, C.: An extended mutation-based priority-rule integration concept for multi-objective machine scheduling. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 3288\u20133295. IEEE, Honolulu (2017). https:\/\/doi.org\/10.1109\/SSCI.2017.8285224","DOI":"10.1109\/SSCI.2017.8285224"},{"key":"17_CR5","unstructured":"Chitra, C., Subbaraj, P.: Multiobjective optimization solution for shortest path routing problem. Int. Sch. Sci. Res. Innov. 4(1) (2010)"},{"key":"17_CR6","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-36797-2","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"CA Coello Coello","year":"2007","unstructured":"Coello Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic and Evolutionary Computation, 2nd edn. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-36797-2","edition":"2"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Coutinho-Rodrigues, J., Clmaco, J., Current, J.: An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput. Oper. Res. 26(8), 789\u2013798 (1999). https:\/\/doi.org\/10.1016\/S0305-0548(98)00094-X","DOI":"10.1016\/S0305-0548(98)00094-X"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolut. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4), 425\u2013460 (2000). https:\/\/doi.org\/10.1007\/s002910000046","journal-title":"OR-Spektrum"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4), 425\u2013460 (2000). https:\/\/doi.org\/10.1007\/s002910000046","DOI":"10.1007\/s002910000046"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-31880-4_5","volume-title":"Evolutionary Multi-Criterion Optimization","author":"Michael Emmerich","year":"2005","unstructured":"Emmerich, Michael, Beume, Nicola, Naujoks, Boris: An EMO algorithm using the hypervolume measure as selection criterion. In: Coello Coello, Carlos A., Hern\u00e1ndez Aguirre, Arturo, Zitzler, Eckart (eds.) EMO 2005. LNCS, vol. 3410, pp. 62\u201376. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_5"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962). https:\/\/doi.org\/10.1145\/367766.368168","DOI":"10.1145\/367766.368168"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Gandibleux, X., Beugnies, F., Randriamasy, S.: Martins\u2019 algorithm revisited for multi-objective shortest path problems with a maxmin cost function. 4OR 4(1), 47\u201359 (2006). https:\/\/doi.org\/10.1007\/s10288-005-0074-x","DOI":"10.1007\/s10288-005-0074-x"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236\u2013245 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR16","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5563-6","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1998","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. International Series in Operations Research & Management Science, vol. 12. Springer, New York (1998)"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Mohamed, C., Bassem, J., Taicir, L.: A genetic algorithms to solve the bicriteria shortest path problem. Electron. Notes Discret. Math. 36, 851\u2013858 (2010). https:\/\/doi.org\/10.1016\/j.endm.2010.05.108. ISCO 2010 - International Symposium on Combinatorial Optimization","DOI":"10.1016\/j.endm.2010.05.108"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44688-5_15","volume-title":"Pareto Shortest Paths is Often Feasible in Practice","author":"M M\u00fcller-Hannemann","year":"2001","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: Pareto Shortest Paths is Often Feasible in Practice, pp. 185\u2013197. Springer, Berlin (2001). https:\/\/doi.org\/10.1007\/3-540-44688-5_15"},{"key":"17_CR19","unstructured":"Pangilinan, J.M.A., Janssens, G.K.: Evolutionary algorithms for the multiobjective shortest path planning problem. In: International Journal of Computer and Information Science and Engineering, pp. 54\u201359 (2007)"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Sanders, P., Mandow, L.: Parallel label-setting multi-objective shortest path search. In: 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp. 215\u2013224 (2013). https:\/\/doi.org\/10.1109\/IPDPS.2013.89","DOI":"10.1109\/IPDPS.2013.89"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/11940128_40","volume-title":"Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications","author":"G Tsaggouris","year":"2006","unstructured":"Tsaggouris, G., Zaroliagis, C.: Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications, pp. 389\u2013398. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11940128_40"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of pareto optima in multiple-objective, shortest-path problems. Oper. Res. 35(1), 70\u201379 (1987). https:\/\/doi.org\/10.1287\/opre.35.1.70","journal-title":"Oper. Res."},{"issue":"6","key":"17_CR23","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evolu. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evolu. Comput."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evolu. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evolu. Comput."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05348-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:54:10Z","timestamp":1710345250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05348-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"ISBN":["9783030053475","9783030053482"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05348-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"31 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION 12","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION12\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}