{"id":"https://openalex.org/W4242712865","doi":"https://doi.org/10.1109/cec.2004.1330957","title":"Expected runtimes of evolutionary algorithms for the Eulerian cycle problem","display_name":"Expected runtimes of evolutionary algorithms for the Eulerian cycle problem","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W4242712865","doi":"https://doi.org/10.1109/cec.2004.1330957"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2004.1330957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1330957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","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/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"F. Neumann","raw_affiliation_strings":["Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts Universit\u00e4t zu Kiel, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts Universit\u00e4t zu Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":3.5976,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93402573,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"904","last_page":"910"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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.9986000061035156,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9975000023841858,"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/eulerian-path","display_name":"Eulerian path","score":0.8400537967681885},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6660066843032837},{"id":"https://openalex.org/keywords/arc-routing","display_name":"Arc routing","score":0.5930415987968445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.546704113483429},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5041834115982056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4716491103172302},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46164387464523315},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43995341658592224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42963501811027527},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.337898313999176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3285147547721863},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.2678276300430298},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.13792160153388977},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.11579430103302002}],"concepts":[{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.8400537967681885},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6660066843032837},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.5930415987968445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.546704113483429},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5041834115982056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4716491103172302},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46164387464523315},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43995341658592224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42963501811027527},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.337898313999176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3285147547721863},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.2678276300430298},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.13792160153388977},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.11579430103302002},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2004.1330957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2004.1330957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1517570823","https://openalex.org/W1522890465","https://openalex.org/W1554385073","https://openalex.org/W1557499844","https://openalex.org/W1973343935","https://openalex.org/W2040194491","https://openalex.org/W2064284095","https://openalex.org/W2097724176","https://openalex.org/W2165220807","https://openalex.org/W4230781079","https://openalex.org/W6630951241","https://openalex.org/W6631411568","https://openalex.org/W6633240588"],"related_works":["https://openalex.org/W1822681810","https://openalex.org/W2059958986","https://openalex.org/W2737096452","https://openalex.org/W2473635752","https://openalex.org/W2355014420","https://openalex.org/W1563136009","https://openalex.org/W1989850675","https://openalex.org/W4242712865","https://openalex.org/W1974848406","https://openalex.org/W1781730958"],"abstract_inverted_index":{"Evolutionary":[0],"algorithms":[1,43],"are":[2,7],"randomized":[3],"search":[4],"heuristics,":[5],"which":[6],"applied":[8,29],"to":[9,20,30,46,79,109],"problems":[10,21],"whose":[11],"structure":[12],"is":[13,77],"not":[14],"well":[15,18],"understood,":[16],"as":[17,19],"in":[22,88,98],"combinatorial":[23],"optimization.":[24],"They":[25],"have":[26],"successfully":[27],"been":[28],"different":[31],"kinds":[32],"of":[33,41,65,75,84],"arc":[34],"routing":[35],"problems.":[36],"To":[37],"start":[38],"the":[39,47,56,66,72,93,99,102],"analysis":[40],"evolutionary":[42],"with":[44],"respect":[45],"expected":[48,89,103],"optimization":[49,104],"time":[50,105],"on":[51,71],"these":[52],"problems,":[53],"we":[54],"consider":[55],"Eulerian":[57,82,86],"cycle":[58],"problem.":[59],"We":[60],"show":[61],"that":[62],"a":[63],"variant":[64],"well-known":[67],"(1+1)":[68],"EA":[69],"working":[70],"important":[73],"encoding":[74],"permutations":[76],"able":[78],"find":[80],"an":[81,85],"tour":[83],"graph":[87],"polynomial":[90,108],"time.":[91],"Altering":[92],"operator":[94],"used":[95],"for":[96],"mutation":[97],"considered":[100],"algorithms,":[101],"changes":[106],"from":[107],"exponential.":[110]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}