{"id":"https://openalex.org/W4293793995","doi":"https://doi.org/10.1007/s11047-022-09908-z","title":"A comparison of distance metrics for the multi-objective pathfinding problem","display_name":"A comparison of distance metrics for the multi-objective pathfinding problem","publication_year":2022,"publication_date":"2022-08-18","ids":{"openalex":"https://openalex.org/W4293793995","doi":"https://doi.org/10.1007/s11047-022-09908-z"},"language":"en","primary_location":{"id":"doi:10.1007/s11047-022-09908-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11047-022-09908-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11047-022-09908-z.pdf","source":{"id":"https://openalex.org/S149828480","display_name":"Natural Computing","issn_l":"1567-7818","issn":["1567-7818","1572-9796"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11047-022-09908-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089280378","display_name":"Jens Weise","orcid":"https://orcid.org/0000-0002-8828-8752"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jens Weise","raw_affiliation_strings":["Faculty of Computer Science, Otto von Guericke University, Universit\u00e4tsplatz 2, 39106, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Otto von Guericke University, Universit\u00e4tsplatz 2, 39106, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064569017","display_name":"Sanaz Mostaghim","orcid":"https://orcid.org/0000-0002-9917-5227"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sanaz Mostaghim","raw_affiliation_strings":["Faculty of Computer Science, Otto von Guericke University, Universit\u00e4tsplatz 2, 39106, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Otto von Guericke University, Universit\u00e4tsplatz 2, 39106, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089280378"],"corresponding_institution_ids":["https://openalex.org/I95793202"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.8166,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.73105452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"22","issue":"2","first_page":"315","last_page":"328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.9728403091430664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7111712098121643},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6702072620391846},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5355878472328186},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4710429012775421},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.44825220108032227},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4441557824611664},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.4275195002555847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39593952894210815},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3788885474205017},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.36976590752601624},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.29354625940322876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21874123811721802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17600604891777039}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.9728403091430664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7111712098121643},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6702072620391846},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5355878472328186},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4710429012775421},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.44825220108032227},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4441557824611664},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.4275195002555847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39593952894210815},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3788885474205017},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.36976590752601624},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.29354625940322876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21874123811721802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17600604891777039},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11047-022-09908-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11047-022-09908-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11047-022-09908-z.pdf","source":{"id":"https://openalex.org/S149828480","display_name":"Natural Computing","issn_l":"1567-7818","issn":["1567-7818","1572-9796"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s11047-022-09908-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11047-022-09908-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11047-022-09908-z.pdf","source":{"id":"https://openalex.org/S149828480","display_name":"Natural Computing","issn_l":"1567-7818","issn":["1567-7818","1572-9796"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7097860364","display_name":null,"funder_award_id":"01IS18070B","funder_id":"https://openalex.org/F4320321114","funder_display_name":"Bundesministerium f\u00fcr Bildung und Forschung"},{"id":"https://openalex.org/G7225624288","display_name":null,"funder_award_id":"This work was","funder_id":"https://openalex.org/F4320321114","funder_display_name":"Bundesministerium f\u00fcr Bildung und Forschung"}],"funders":[{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4293793995.pdf","grobid_xml":"https://content.openalex.org/works/W4293793995.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W99566512","https://openalex.org/W640136309","https://openalex.org/W1484287363","https://openalex.org/W1570683030","https://openalex.org/W1576883264","https://openalex.org/W1582055249","https://openalex.org/W1969483458","https://openalex.org/W1970421356","https://openalex.org/W1974526404","https://openalex.org/W1978151341","https://openalex.org/W1998259641","https://openalex.org/W2008735761","https://openalex.org/W2022485595","https://openalex.org/W2043293052","https://openalex.org/W2051956023","https://openalex.org/W2062556295","https://openalex.org/W2084404970","https://openalex.org/W2097326205","https://openalex.org/W2103176750","https://openalex.org/W2105899518","https://openalex.org/W2113256452","https://openalex.org/W2116961716","https://openalex.org/W2118791211","https://openalex.org/W2124299914","https://openalex.org/W2126105956","https://openalex.org/W2131076549","https://openalex.org/W2135125135","https://openalex.org/W2158320871","https://openalex.org/W2334319328","https://openalex.org/W2548023599","https://openalex.org/W2775348664","https://openalex.org/W2810388706","https://openalex.org/W2958271860","https://openalex.org/W3015273457","https://openalex.org/W3046909638","https://openalex.org/W3083743049","https://openalex.org/W3092554988","https://openalex.org/W3138272363","https://openalex.org/W3138911736","https://openalex.org/W3171043051","https://openalex.org/W4206925271","https://openalex.org/W4206939017","https://openalex.org/W4238681033","https://openalex.org/W4240592325"],"related_works":["https://openalex.org/W2197326744","https://openalex.org/W2106556139","https://openalex.org/W2207002589","https://openalex.org/W1985012061","https://openalex.org/W2104162970","https://openalex.org/W3050209628","https://openalex.org/W2017597147","https://openalex.org/W1889072701","https://openalex.org/W2000969332","https://openalex.org/W13236304"],"abstract_inverted_index":{"Abstract":[0],"Pathfinding,":[1],"also":[2],"known":[3],"as":[4],"route":[5],"planning,":[6],"is":[7,28,82,88],"one":[8],"of":[9,14,119,136],"the":[10,44,67,79,98,101,120,129,141],"most":[11],"important":[12],"aspects":[13],"logistics,":[15],"robotics,":[16],"and":[17,115,139],"other":[18],"applications":[19],"where":[20],"engineers":[21],"must":[22],"balance":[23],"many":[24,39],"competing":[25],"interests.":[26],"There":[27],"a":[29,112,134,144],"significant":[30],"challenge":[31],"in":[32,55,66,78,84],"pathfinding":[33,91],"problems":[34],"with":[35],"multiple":[36],"objectives":[37],"because":[38],"paths":[40],"can":[41],"map":[42],"to":[43,96,143],"same":[45],"objective":[46,68],"value.":[47],"Such":[48],"multi-modal":[49],"solutions":[50,77,99],"cannot":[51],"easily":[52],"be":[53],"found":[54],"multi-objective":[56],"optimisation":[57,146],"algorithms,":[58],"which":[59,87,108],"are":[60,104,116],"typically":[61],"geared":[62],"towards":[63],"selection":[64],"mechanisms":[65],"space.":[69],"A":[70],"niching":[71],"approach":[72,132],"for":[73,90],"preserving":[74],"good":[75],"diverse":[76],"decision":[80,102],"space":[81,103],"proposed":[83,130],"this":[85],"paper,":[86],"tailored":[89],"problems.":[92],"The":[93],"criteria":[94],"used":[95,117],"compare":[97,140],"within":[100],"path":[105],"similarity":[106],"metrics,":[107],"we":[109,127],"extend":[110],"from":[111],"previous":[113],"study,":[114],"instead":[118],"well-established":[121],"crowding":[122],"distance.":[123],"In":[124],"two":[125],"variations,":[126],"investigate":[128],"meta-heuristic":[131],"on":[133],"range":[135],"benchmark":[137],"instances":[138],"methodology":[142],"deterministic":[145],"approach.":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}