{"id":"https://openalex.org/W2088742708","doi":"https://doi.org/10.1145/1389095.1389251","title":"Memetic algorithms with variable-depth search to overcome local optima","display_name":"Memetic algorithms with variable-depth search to overcome local optima","publication_year":2008,"publication_date":"2008-07-12","ids":{"openalex":"https://openalex.org/W2088742708","doi":"https://doi.org/10.1145/1389095.1389251","mag":"2088742708"},"language":"en","primary_location":{"id":"doi:10.1145/1389095.1389251","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389251","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17877/de290r-9025","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"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":"Dirk Sudholt","raw_affiliation_strings":["TU Dortmund, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018789989"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":8.3508,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.97048473,"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":"787","last_page":"794"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965000152587891,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11106","display_name":"Data Management and Algorithms","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.8107677698135376},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.7361798286437988},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.7026745080947876},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6076095104217529},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5832745432853699},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5583871603012085},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5483555793762207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5120304226875305},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4921061396598816},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48305994272232056},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.47513940930366516},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47148773074150085},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4445725381374359},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39802342653274536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2661411464214325},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.17237746715545654},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06188249588012695}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8107677698135376},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.7361798286437988},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.7026745080947876},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6076095104217529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5832745432853699},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5583871603012085},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5483555793762207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5120304226875305},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4921061396598816},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48305994272232056},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.47513940930366516},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47148773074150085},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4445725381374359},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39802342653274536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2661411464214325},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.17237746715545654},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06188249588012695},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1389095.1389251","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389251","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.148.2017","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.2017","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p787.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.183.5389","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.5389","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/23808.pdf","raw_type":"text"},{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/26145","is_oa":false,"landing_page_url":"http://hdl.handle.net/2003/26145","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-9025","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-9025","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-9025","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-9025","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/W158704887","https://openalex.org/W1510977876","https://openalex.org/W1511990050","https://openalex.org/W1522890465","https://openalex.org/W1537270317","https://openalex.org/W1544565521","https://openalex.org/W1581232621","https://openalex.org/W1972810918","https://openalex.org/W1975791498","https://openalex.org/W1994258343","https://openalex.org/W2010334716","https://openalex.org/W2011576841","https://openalex.org/W2024281442","https://openalex.org/W2042986967","https://openalex.org/W2075798683","https://openalex.org/W2122510010","https://openalex.org/W2127516144","https://openalex.org/W2148948822","https://openalex.org/W2155926177","https://openalex.org/W2160241726","https://openalex.org/W2161455936","https://openalex.org/W2752885492","https://openalex.org/W3121748795","https://openalex.org/W3145128584","https://openalex.org/W4213009134","https://openalex.org/W4285719527","https://openalex.org/W6606374726","https://openalex.org/W6990023262","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2123829500","https://openalex.org/W2083844986","https://openalex.org/W2560221187","https://openalex.org/W103092118","https://openalex.org/W2042716007","https://openalex.org/W45105518","https://openalex.org/W2163647484","https://openalex.org/W2024203849","https://openalex.org/W1833366547","https://openalex.org/W2240724679"],"abstract_inverted_index":{"Variable-depth":[0],"search":[1,38],"(shortly":[2],"VDS)":[3],"is":[4,20,48],"well-known":[5],"as":[6],"Lin-Kernighan":[7],"strategy":[8],"for":[9,14],"the":[10,37],"TSP":[11],"and":[12,28,50],"Kernighan-Lin":[13],"graph":[15],"partitioning.":[16],"The":[17],"basic":[18],"idea":[19],"to":[21,29,35],"make":[22],"a":[23,52],"sequence":[24],"of":[25],"local":[26,46],"moves":[27],"freeze":[30],"all":[31],"moved":[32],"combinatorial":[33],"objects":[34],"prevent":[36],"from":[39],"looping.":[40],"VDS":[41],"stops":[42],"when":[43],"no":[44],"further":[45],"move":[47],"possible":[49],"returns":[51],"best":[53],"found":[54],"solution.":[55]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}