{"id":"https://openalex.org/W1963865903","doi":"https://doi.org/10.1145/1527125.1527134","title":"Computing single source shortest paths using single-objective fitness","display_name":"Computing single source shortest paths using single-objective fitness","publication_year":2009,"publication_date":"2009-01-09","ids":{"openalex":"https://openalex.org/W1963865903","doi":"https://doi.org/10.1145/1527125.1527134","mag":"1963865903"},"language":"en","primary_location":{"id":"doi:10.1145/1527125.1527134","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527134","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"],"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/A5059835930","display_name":"Surender Baswana","orcid":"https://orcid.org/0000-0001-8657-7182"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Surender Baswana","raw_affiliation_strings":["Indian Institute of Technology Kanpur, Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102152749","display_name":"Somenath Biswas","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Somenath Biswas","raw_affiliation_strings":["Indian Institute of Technology Kanpur"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102961331","display_name":"Benjamin Doerr","orcid":"https://orcid.org/0000-0002-9786-220X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Benjamin Doerr","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["International Computer Science Institute, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"International Computer Science Institute, Berkeley, CA, USA","institution_ids":["https://openalex.org/I1297971548"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090691108","display_name":"Piyush P. Kurur","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Piyush P. Kurur","raw_affiliation_strings":["Indian Institute of Technology Kanpur, Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5059835930"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":9.1597,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.97886942,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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.9993000030517578,"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.9980000257492065,"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/heuristics","display_name":"Heuristics","score":0.6778054237365723},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6449899673461914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6182763576507568},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5863875150680542},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5406678318977356},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.5192044377326965},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4997239112854004},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3843819200992584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32299649715423584},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.101654052734375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09856581687927246}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6778054237365723},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6449899673461914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182763576507568},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5863875150680542},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5406678318977356},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.5192044377326965},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4997239112854004},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3843819200992584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32299649715423584},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.101654052734375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09856581687927246},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1527125.1527134","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527134","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:digital.library.adelaide.edu.au:2440/66515","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/66515","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1145/1527125.1527134","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W124424457","https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1553838525","https://openalex.org/W1573676079","https://openalex.org/W1583434898","https://openalex.org/W1976361701","https://openalex.org/W1981898306","https://openalex.org/W2001426248","https://openalex.org/W2008616734","https://openalex.org/W2068871408","https://openalex.org/W2070987589","https://openalex.org/W2083019227","https://openalex.org/W2101778955","https://openalex.org/W2121654446","https://openalex.org/W2153401898","https://openalex.org/W2165220807","https://openalex.org/W2169528473","https://openalex.org/W2414536331","https://openalex.org/W2496163386","https://openalex.org/W4234274482","https://openalex.org/W4235573697","https://openalex.org/W6685290738"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2401723157","https://openalex.org/W2952904874","https://openalex.org/W2489890244","https://openalex.org/W2550292406","https://openalex.org/W1606502848"],"abstract_inverted_index":{"Runtime":[0],"analysis":[1,13],"of":[2,14,121],"evolutionary":[3,97],"algorithms":[4],"has":[5],"become":[6],"an":[7,110],"important":[8],"part":[9],"in":[10,56,81],"the":[11,30,54,77,92,105,122],"theoretical":[12],"randomized":[15],"search":[16],"heuristics.":[17],"The":[18],"first":[19],"combinatorial":[20],"problem":[21,55,78],"where":[22],"rigorous":[23],"runtime":[24,115],"results":[25],"have":[26],"been":[27],"achieved":[28],"is":[29],"well-known":[31],"single":[32,106],"source":[33],"shortest":[34],"path":[35],"(SSSP)":[36],"problem.":[37],"Scharnow,":[38],"Tinnefeld":[39],"andWegener":[40],"[PPSN":[41],"2002,":[42],"J.":[43],"Math.":[44],"Model.":[45],"Alg.":[46],"2004]":[47],"proposed":[48],"a":[49,63,82],"multi-objective":[50,86,123],"approach":[51,108],"which":[52],"solves":[53],"expected":[57],"polynomial":[58],"time.":[59],"They":[60],"also":[61],"suggest":[62],"related":[64],"single-objective":[65],"fitness":[66,87],"function.":[67],"However,":[68],"it":[69],"was":[70],"left":[71],"open":[72],"whether":[73,85],"this":[74,100],"does":[75],"solve":[76],"efficiently,":[79],"and,":[80],"broader":[83],"context,":[84],"functions":[88],"for":[89],"problems":[90],"like":[91],"SSSP":[93],"yield":[94],"more":[95],"efficient":[96,111],"algorithms.":[98],"In":[99],"paper,":[101],"we":[102],"show":[103],"that":[104],"objective":[107],"yields":[109],"(1+1)":[112],"EA":[113],"with":[114],"bounds":[116],"very":[117],"close":[118],"to":[119],"those":[120],"approach.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}