{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T20:16:43Z","timestamp":1758399403938,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720612"},{"type":"electronic","value":"9783030720629"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-72062-9_30","type":"book-chapter","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:15:18Z","timestamp":1616544918000},"page":"375-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Many-Objective Pathfinding Based on Fr\u00e9chet Similarity Metric"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8828-8752","authenticated-orcid":false,"given":"Jens","family":"Weise","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9917-5227","authenticated-orcid":false,"given":"Sanaz","family":"Mostaghim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,24]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, F., Deb, K.: Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms. Soft Comput. 17(7), 1283\u20131299 (2013)","DOI":"10.1007\/s00500-012-0964-8"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 05(01n02), 75\u201391 (1995)","DOI":"10.1142\/S0218195995000064"},{"key":"30_CR3","unstructured":"Anguelov, B.: Video game pathfinding and improvements to discrete search on grid-based maps. Ph.D. thesis (2011)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-43680-3_3","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"L Beke","year":"2020","unstructured":"Beke, L., Weiszer, M., Chen, J.: A comparison of genetic representations for multi-objective shortest path problems on multigraphs. In: Paquete, L., Zarges, C. (eds.) EvoCOP 2020. LNCS, vol. 12102, pp. 35\u201350. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43680-3_3"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Besada-Portas, E., de la Torre, L., Moreno, A., Risco-Mart\u00edn, J.L.: On the performance comparison of multi-objective evolutionary UAV path planners. Inf. Sci. 238, 111\u2013125 (2013)","DOI":"10.1016\/j.ins.2013.02.022"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Cai, X., Sun, H., Fan, Z.: A diversity indicator based on reference vectors for many-objective optimization. Inf. Sci. 430\u2013431, 467\u2013486 (2018)","DOI":"10.1016\/j.ins.2017.11.051"},{"issue":"2","key":"30_CR7","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. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-31880-4_4","volume-title":"Evolutionary Multi-Criterion Optimization","author":"K Deb","year":"2005","unstructured":"Deb, K., Tiwari, S.: Omni-optimizer: a procedure for single and multi-objective optimization. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 47\u201361. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_4"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00454-002-2886-1","volume":"28","author":"A Efrat","year":"2002","unstructured":"Efrat, A., Guibas, L.J., Har-Peled, S., Mitchell, J.S., Murali, T.M.: New similarity measures between polylines with applications to morphing and polygon sweeping. Discrete Comput. Geom. 28(4), 535\u2013569 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"30_CR10","unstructured":"Eiter, T., Mannila, H.: Computing Discrete Fr\u00e9chet Distance (1994)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-24983-9_7","volume-title":"Computational Geometry, Graphs and Applications","author":"C Fan","year":"2011","unstructured":"Fan, C., Luo, J., Zhu, B.: Fr\u00e9chet-distance on road networks. In: Akiyama, J., Bo, J., Kano, M., Tan, X. (eds.) CGGA 2010. LNCS, vol. 7033, pp. 61\u201372. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24983-9_7"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Fr\u00e9chet, M.M.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Matematico di Palermo (1884\u20131940) 22(1), 1\u201372 (1906)","DOI":"10.1007\/BF03018603"},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"30_CR14","unstructured":"Hu, J., Zhu, Q., Jun, H., Qingbao, Z.: Multi-objective mobile robot path planning based on improved genetic algorithm. In: 2010 International Conference on Intelligent Computation Technology and Automation, vol. 2, pp. 752\u2013756. IEEE (2010)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Masuda, H., Nojima, Y.: A study on performance evaluation ability of a modified inverted generational distance indicator. In: Proceedings of the 2015 on Genetic and Evolutionary Computation Conference - GECCO 2015. pp. 695\u2013702. ACM Press, New York (2015)","DOI":"10.1145\/2739480.2754792"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Javadi, M., Zille, H., Mostaghim, S.: Modified crowding distance and mutation for multimodal multi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 211\u2013212. ACM, New York (2019)","DOI":"10.1145\/3319619.3321970"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Jiang, M., Xu, Y., Zhu, B.: Protein structure-structure alignment with discrete Fr\u00e9chet distance. J. Bioinform. Comput. Biol. 06(01), 51\u201364 (2008)","DOI":"10.1142\/S0219720008003278"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Sack, J.R., Shahbaz, K., Zarrabi-Zadeh, H.: Fr\u00e9chet distance with speed limits. Comput. Geom. 44(2), 110\u2013120 (2011)","DOI":"10.1016\/j.comgeo.2010.09.008"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Mandow, L., De La Cruz, J.L.P.: Multiobjective A* search with consistent heuristics. J. ACM 57(5), 1\u201325 (2010)","DOI":"10.1145\/1754399.1754400"},{"key":"30_CR20","unstructured":"Munkres, J.R.: Topology. Featured Titles for Topology. Prentice Hall, Incorporated (2000)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Patil, M.B.: Improved performance in multi-objective optimization using external archive. S\u0101dhan\u0101 45(1), 70 (2020)","DOI":"10.1007\/s12046-020-1309-4"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Pulido, F.J.J., Mandow, L., P\u00e9rez-De-La-Cruz, J.L.L.: Dimensionality reduction in multiobjective shortest path search. Comput. Oper. Res. 64, 60\u201370 (2015)","DOI":"10.1016\/j.cor.2015.05.007"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Anbuselvi, R.: Path finding solutions for grid based graph. Adv. Comput. Int. J. 4(2), 51\u201360 (2013)","DOI":"10.5121\/acij.2013.4205"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fr\u00e9chet distance based approach for searching online handwritten documents. In: Ninth International Conference on Document Analysis and Recognition (ICDAR 2007), vol. 1, pp. 461\u2013465. IEEE, September 2007","DOI":"10.1109\/ICDAR.2007.4378752"},{"issue":"2","key":"30_CR25","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Trans. Comput. Intell. AI Games 4(2), 144\u2013148 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)","DOI":"10.1137\/1.9781611973594"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Tozer, B., Mazzuchi, T., Sarkani, S.: Many-objective stochastic path finding using reinforcement learning. Expert Syst. Appl. 72, 371\u2013382 (2017)","DOI":"10.1016\/j.eswa.2016.10.045"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Weise, J., Mai, S., Zille, H., Mostaghim, S.: On the scalable multi-objective multi-agent pathfinding problem. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE, July 2020","DOI":"10.1109\/CEC48606.2020.9185585"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Weise, J., Mostaghim, S.: A many-objective route planning benchmark problem for navigation. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, GECCO 2020, pp. 183\u2013184. ACM, New York, July 2020","DOI":"10.1145\/3377929.3389996"},{"key":"30_CR30","unstructured":"Weise, J., Mostaghim, S.: Scalable many-objective pathfinding benchmark suite. [Manuscript submitted for publication] (2020). https:\/\/ci.ovgu.de\/Publications\/TEVC_WM_2020-p-910.html"},{"key":"30_CR31","first-page":"117","volume":"32","author":"J Xiao","year":"1999","unstructured":"Xiao, J., Michalewicz, Z.: An evolutionary computation approach to robot planning and navigation. Soft Comput. Mechatron. 32, 117\u2013141 (1999)","journal-title":"Soft Comput. Mechatron."},{"key":"30_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-47922-8_4","volume-title":"Advances in Artificial Intelligence","author":"P Yap","year":"2002","unstructured":"Yap, P.: Grid-based path-finding. In: Cohen, R., Spencer, B. (eds.) AI 2002. LNCS (LNAI), vol. 2338, pp. 44\u201355. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47922-8_4"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72062-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T20:09:03Z","timestamp":1621282143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72062-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720612","9783030720629"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72062-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"24 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}