{"id":"https://openalex.org/W1967363967","doi":"https://doi.org/10.1145/1527125.1527140","title":"Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem","display_name":"Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem","publication_year":2009,"publication_date":"2009-01-09","ids":{"openalex":"https://openalex.org/W1967363967","doi":"https://doi.org/10.1145/1527125.1527140","mag":"1967363967"},"language":"en","primary_location":{"id":"doi:10.1145/1527125.1527140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17877/de290r-9020","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022961286","display_name":"Christian Horoba","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christian Horoba","raw_affiliation_strings":["Technische Universitaet Dortmund, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universitaet Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022961286"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":6.3071,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.96233938,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9986000061035156,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7322819232940674},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7306928038597107},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6328540444374084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6095579862594604},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5364722609519958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5057234764099121},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4570290446281433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44022977352142334},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4235166907310486},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.38191497325897217},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23283150792121887},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1298404037952423}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7322819232940674},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7306928038597107},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6328540444374084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6095579862594604},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5364722609519958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5057234764099121},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4570290446281433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44022977352142334},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4235166907310486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.38191497325897217},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23283150792121887},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1298404037952423},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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":4,"locations":[{"id":"doi:10.1145/1527125.1527140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.192.9057","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.9057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/25808.pdf","raw_type":"text"},{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/26165","is_oa":false,"landing_page_url":"http://hdl.handle.net/2003/26165","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:Text"},{"id":"doi:10.17877/de290r-9020","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-9020","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"report"}],"best_oa_location":{"id":"doi:10.17877/de290r-9020","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-9020","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W1480013811","https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1781730958","https://openalex.org/W1928381443","https://openalex.org/W1975791498","https://openalex.org/W1981898306","https://openalex.org/W2011039300","https://openalex.org/W2027557853","https://openalex.org/W2053175541","https://openalex.org/W2060882019","https://openalex.org/W2063375245","https://openalex.org/W2066047491","https://openalex.org/W2066124178","https://openalex.org/W2070987589","https://openalex.org/W2121555757","https://openalex.org/W2136575369","https://openalex.org/W2144585681","https://openalex.org/W2152688255","https://openalex.org/W2153401898","https://openalex.org/W2159512835","https://openalex.org/W2165220807","https://openalex.org/W2165686220","https://openalex.org/W2295428206","https://openalex.org/W2585305412","https://openalex.org/W3023196114","https://openalex.org/W4234274482","https://openalex.org/W6604902140"],"related_works":["https://openalex.org/W1981898306","https://openalex.org/W2165220807","https://openalex.org/W2159512835","https://openalex.org/W2153401898","https://openalex.org/W2152688255","https://openalex.org/W2144585681","https://openalex.org/W2121555757","https://openalex.org/W2063375245","https://openalex.org/W2053175541","https://openalex.org/W1552383524","https://openalex.org/W372717656","https://openalex.org/W2585305412","https://openalex.org/W2162189348","https://openalex.org/W2027557853","https://openalex.org/W1781730958","https://openalex.org/W1522890465","https://openalex.org/W1510977876","https://openalex.org/W1544920412","https://openalex.org/W2003266683","https://openalex.org/W2127860445"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,15,28,33,46],"natural":[3],"fitness":[4],"function":[5],"f":[6],"for":[7,53,69],"the":[8,54],"multiobjective":[9,17],"shortest":[10],"path":[11],"problem,":[12],"which":[13,58],"is":[14,45],"fundamental":[16],"combinatorial":[18],"optimization":[19],"problem":[20,55],"known":[21],"to":[22,64],"be":[23],"NP-hard.":[24],"Thereafter,":[25],"we":[26],"conduct":[27],"rigorous":[29],"runtime":[30],"analysis":[31],"of":[32],"simple":[34,42],"evolutionary":[35],"algorithm":[36,44],"(EA)":[37],"optimizing":[38],"f.":[39],"Interestingly,":[40],"this":[41],"general":[43],"fully":[47],"polynomial-time":[48],"randomized":[49],"approximation":[50],"scheme":[51],"(FPRAS)":[52],"under":[56],"consideration,":[57],"exemplifies":[59],"how":[60],"EAs":[61],"are":[62],"able":[63],"find":[65],"good":[66],"approximate":[67],"solutions":[68],"hard":[70],"problems.":[71]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}