{"id":"https://openalex.org/W2053175541","doi":"https://doi.org/10.1145/1389095.1389202","title":"Crossover can provably be useful in evolutionary computation","display_name":"Crossover can provably be useful in evolutionary computation","publication_year":2008,"publication_date":"2008-07-12","ids":{"openalex":"https://openalex.org/W2053175541","doi":"https://doi.org/10.1145/1389095.1389202","mag":"2053175541"},"language":"en","primary_location":{"id":"doi:10.1145/1389095.1389202","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual conference on Genetic and evolutionary computation","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/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":true,"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/A5070819885","display_name":"Edda Happ","orcid":null},"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":"Edda Happ","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":"last","author":{"id":"https://openalex.org/A5070076122","display_name":"Christian Klein","orcid":"https://orcid.org/0000-0001-8702-2816"},"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":"Christian Klein","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":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102961331"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":18.7708,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.99244394,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"539","last_page":"546"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9958999752998352,"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.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9583612680435181},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.6714251041412354},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5852009057998657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5791398286819458},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5266934633255005},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4910857677459717},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4738517105579376},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46013253927230835},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4495037794113159},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3479457497596741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3397735059261322},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31085026264190674},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2862216830253601},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09198376536369324}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9583612680435181},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.6714251041412354},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5852009057998657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5791398286819458},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5266934633255005},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4910857677459717},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4738517105579376},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46013253927230835},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4495037794113159},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3479457497596741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3397735059261322},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31085026264190674},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2862216830253601},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09198376536369324},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"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":5,"locations":[{"id":"doi:10.1145/1389095.1389202","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.9588","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.9588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~doerr/papers/gecco2008_1.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:428043","is_oa":false,"landing_page_url":"http://edoc.mpg.de/428043","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Keijzer, Maarten; Antoniol., Giuliano; Congdon, Clare Bates; Deb, Kalyanmoy; Doerr, Benjamin; Hansen, Nikolaus; Holmes, John H.; Hornby, Gregory S.; Howard, Daniel; Kennedy, James; Kumar, Sanjeev; Lobo, Fernando G.; Miller, Julian Francis; Moore, Jason; Neumann, Frank; Pelikan, Martin; Pollack, Jordan; Sastry, Kumara; Stanley, Kenneth; Stoica, Adrian; Talbi, El-Ghazali; Wegener, Ingo: Genetic and Evolutionary Computation Conference 2008 : GECCO 2008, ACM, 539-546 (2008)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1323839","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1636-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1324520","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1B5A-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"GECCO'08","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W9612933","https://openalex.org/W272982077","https://openalex.org/W372717656","https://openalex.org/W1493725229","https://openalex.org/W1497256448","https://openalex.org/W1538319403","https://openalex.org/W1581232621","https://openalex.org/W1606499289","https://openalex.org/W1607251184","https://openalex.org/W1889956542","https://openalex.org/W1970101133","https://openalex.org/W1975791498","https://openalex.org/W1981898306","https://openalex.org/W1984843325","https://openalex.org/W1994258343","https://openalex.org/W2007572995","https://openalex.org/W2011039300","https://openalex.org/W2017394741","https://openalex.org/W2022980325","https://openalex.org/W2024060531","https://openalex.org/W2050383463","https://openalex.org/W2056760934","https://openalex.org/W2068871408","https://openalex.org/W2104734478","https://openalex.org/W2111191694","https://openalex.org/W2117473144","https://openalex.org/W2122689321","https://openalex.org/W2148770681","https://openalex.org/W2156153879","https://openalex.org/W2160241726","https://openalex.org/W2161238506","https://openalex.org/W2166897600","https://openalex.org/W2414536331","https://openalex.org/W2496163386","https://openalex.org/W3121530892","https://openalex.org/W3145128584","https://openalex.org/W4234274482","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2371108399","https://openalex.org/W2525152177","https://openalex.org/W2979917306","https://openalex.org/W1568364087","https://openalex.org/W1606499289","https://openalex.org/W2369738212","https://openalex.org/W2152922390","https://openalex.org/W2383252209","https://openalex.org/W2381787154","https://openalex.org/W2163027130"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"the":[3,8,24,29],"natural":[4],"evolutionary":[5],"algorithm":[6],"for":[7,33],"all-pairs":[9],"shortest":[10],"path":[11],"problem":[12],"is":[13,23],"significantly":[14],"faster":[15],"with":[16],"a":[17,34],"crossover":[18,32],"operator":[19],"than":[20],"without.":[21],"This":[22],"first":[25],"theoretical":[26],"analysis":[27],"proving":[28],"usefulness":[30],"of":[31],"non-artificial":[35],"problem.":[36]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}