{"id":"https://openalex.org/W4206939017","doi":"https://doi.org/10.1109/ssci50451.2021.9659956","title":"A Customized Niching Methodology for the Many-Objective Pathfinding Problem","display_name":"A Customized Niching Methodology for the Many-Objective Pathfinding Problem","publication_year":2021,"publication_date":"2021-12-05","ids":{"openalex":"https://openalex.org/W4206939017","doi":"https://doi.org/10.1109/ssci50451.2021.9659956"},"language":"en","primary_location":{"id":"doi:10.1109/ssci50451.2021.9659956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9659956","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"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/I4210138551","display_name":"University Hospital Magdeburg","ror":"https://ror.org/03m04df46","country_code":"DE","type":"healthcare","lineage":["https://openalex.org/I4210138551"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jens Weise","raw_affiliation_strings":["Faculty of Computer Science, University of Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, University of Magdeburg, Germany","institution_ids":["https://openalex.org/I4210138551"]}]},{"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/I4210138551","display_name":"University Hospital Magdeburg","ror":"https://ror.org/03m04df46","country_code":"DE","type":"healthcare","lineage":["https://openalex.org/I4210138551"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sanaz Mostaghim","raw_affiliation_strings":["Faculty of Computer Science, University of Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, University of Magdeburg, Germany","institution_ids":["https://openalex.org/I4210138551"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089280378"],"corresponding_institution_ids":["https://openalex.org/I4210138551"],"apc_list":null,"apc_paid":null,"fwci":0.7059,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66396292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"214","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9990000128746033,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987000226974487,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9954000115394592,"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.951503336429596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6815057396888733},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.47324496507644653},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.46620213985443115},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.45398181676864624},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4421984553337097},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4358314275741577},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4267274737358093},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3645314574241638},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.35066062211990356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32594597339630127},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2670031785964966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16175684332847595}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.951503336429596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6815057396888733},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47324496507644653},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.46620213985443115},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.45398181676864624},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4421984553337097},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4358314275741577},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4267274737358093},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3645314574241638},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.35066062211990356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32594597339630127},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2670031785964966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16175684332847595},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci50451.2021.9659956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci50451.2021.9659956","pdf_url":null,"source":{"id":"https://openalex.org/S4363604921","display_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1244787411","display_name":null,"funder_award_id":"01IS18070B","funder_id":"https://openalex.org/F4320336060","funder_display_name":"Bundesministerium f\u00fcr Umwelt, Naturschutz, nukleare Sicherheit und Verbraucherschutz"}],"funders":[{"id":"https://openalex.org/F4320336060","display_name":"Bundesministerium f\u00fcr Umwelt, Naturschutz, nukleare Sicherheit und Verbraucherschutz","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W99566512","https://openalex.org/W640136309","https://openalex.org/W1970421356","https://openalex.org/W1978151341","https://openalex.org/W1981934656","https://openalex.org/W2018684100","https://openalex.org/W2022485595","https://openalex.org/W2043293052","https://openalex.org/W2076054478","https://openalex.org/W2097326205","https://openalex.org/W2102365077","https://openalex.org/W2103176750","https://openalex.org/W2116961716","https://openalex.org/W2118791211","https://openalex.org/W2126105956","https://openalex.org/W2135125135","https://openalex.org/W2410099853","https://openalex.org/W2548023599","https://openalex.org/W2609578772","https://openalex.org/W2775348664","https://openalex.org/W2939466003","https://openalex.org/W2941281702","https://openalex.org/W3015273457","https://openalex.org/W3027461786","https://openalex.org/W3083743049","https://openalex.org/W3092554988","https://openalex.org/W3106832946","https://openalex.org/W3138911736","https://openalex.org/W3171043051","https://openalex.org/W4233758051","https://openalex.org/W4252801674","https://openalex.org/W6761597005","https://openalex.org/W6786807807"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W2605563323","https://openalex.org/W2383519316","https://openalex.org/W3088868185","https://openalex.org/W2350354796","https://openalex.org/W2356287045","https://openalex.org/W78690942","https://openalex.org/W2974085611","https://openalex.org/W2128644323","https://openalex.org/W4221129498"],"abstract_inverted_index":{"Route":[0],"planning,":[1],"also":[2],"called":[3],"pathfinding,":[4],"is":[5,92,147],"an":[6],"essential":[7],"element":[8],"in":[9,45,67,87,130],"various":[10],"fields":[11],"such":[12,26,72],"as":[13],"logistics":[14],"and":[15,115,154],"mobile":[16],"robotics":[17],"with":[18],"a":[19,37,81,105,109,150,155],"considerable":[20],"impact":[21],"on":[22,108],"the":[23,40,64,68,88,100,117,131,134,144],"engineering":[24],"of":[25,42,113,138,143,152],"systems.":[27],"Pathfinding":[28],"problems":[29],"usually":[30],"contain":[31],"multiple":[32],"conflicting":[33],"objectives,":[34],"which":[35,91],"pose":[36],"challenge":[38],"for":[39],"design":[41],"algorithms.":[43],"Additionally,":[44],"pathfinding":[46,97],"applications,":[47],"several":[48],"paths":[49,114],"can":[50],"map":[51],"to":[52,76,84,96],"similar":[53],"or":[54],"even":[55],"exact":[56],"objective":[57,69],"values.":[58],"Typical":[59],"multi-objective":[60],"optimization":[61],"algorithms":[62],"prioritize":[63],"selection":[65],"mechanism":[66],"space,":[70,90,102],"making":[71],"multi-modal":[73],"solutions":[74],"challenging":[75],"find.":[77],"This":[78],"paper":[79],"introduces":[80],"new":[82],"approach":[83],"preserve":[85],"diversity":[86],"decision":[89,101],"particularly":[93],"well":[94],"suited":[95],"problems.":[98],"In":[99,126],"we":[103],"impose":[104],"total":[106],"order":[107],"naturally":[110],"unordered":[111],"set":[112],"measure":[116],"solutions'":[118],"isolation":[119],"precisely,":[120],"by":[121],"utilizing":[122],"discrete":[123],"Fr\u00e9chet":[124],"distance.":[125,140],"this":[127],"concept,":[128],"diversification":[129],"decision-space":[132],"replaces":[133],"widely":[135],"known":[136],"concept":[137],"crowding":[139],"An":[141],"examination":[142],"proposed":[145],"method":[146],"conducted":[148],"using":[149],"variety":[151],"benchmarks":[153],"real-world":[156],"example.":[157]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}