{"id":"https://openalex.org/W2075122302","doi":"https://doi.org/10.1145/2330163.2330340","title":"An exploration-exploitation compromise-based adaptive operator selection for local search","display_name":"An exploration-exploitation compromise-based adaptive operator selection for local search","publication_year":2012,"publication_date":"2012-07-07","ids":{"openalex":"https://openalex.org/W2075122302","doi":"https://doi.org/10.1145/2330163.2330340","mag":"2075122302"},"language":"en","primary_location":{"id":"doi:10.1145/2330163.2330340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5091208973","display_name":"Nadarajen Veerapen","orcid":"https://orcid.org/0000-0003-3699-1080"},"institutions":[{"id":"https://openalex.org/I234216984","display_name":"Universit\u00e9 Nantes Angers Le Mans","ror":"https://ror.org/0406t3m57","country_code":"FR","type":"education","lineage":["https://openalex.org/I234216984"]},{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nadarajen Veerapen","raw_affiliation_strings":["LUNAM Universit\u00e9 &amp; Universit\u00e9 d'Angers, Angers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LUNAM Universit\u00e9 &amp; Universit\u00e9 d'Angers, Angers, France","institution_ids":["https://openalex.org/I234216984","https://openalex.org/I49451733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110382787","display_name":"Jorge Maturana","orcid":null},"institutions":[{"id":"https://openalex.org/I16465266","display_name":"Austral University of Chile","ror":"https://ror.org/029ycp228","country_code":"CL","type":"education","lineage":["https://openalex.org/I16465266"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Jorge Maturana","raw_affiliation_strings":["Universidad Austral de Chile, Valdivia, Chile","Universidad Austral de Chile, Valdivia,, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Austral de Chile, Valdivia, Chile","institution_ids":["https://openalex.org/I16465266"]},{"raw_affiliation_string":"Universidad Austral de Chile, Valdivia,, Chile","institution_ids":["https://openalex.org/I16465266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110660182","display_name":"Fr\u00e9d\u00e9ric Saubion","orcid":"https://orcid.org/0000-0001-8227-7174"},"institutions":[{"id":"https://openalex.org/I234216984","display_name":"Universit\u00e9 Nantes Angers Le Mans","ror":"https://ror.org/0406t3m57","country_code":"FR","type":"education","lineage":["https://openalex.org/I234216984"]},{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Saubion","raw_affiliation_strings":["LUNAM Universit\u00e9 &amp; Universit\u00e9 d'Angers, Angers, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LUNAM Universit\u00e9 &amp; Universit\u00e9 d'Angers, Angers, France","institution_ids":["https://openalex.org/I234216984","https://openalex.org/I49451733"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8212,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.86177715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1277","last_page":"1284"},"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.9926999807357788,"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.9894999861717224,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7466980218887329},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6912985444068909},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.6151189804077148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5667649507522583},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5599232316017151},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5279887318611145},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.487255722284317},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.48099765181541443},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4613267481327057},{"id":"https://openalex.org/keywords/genetic-operator","display_name":"Genetic operator","score":0.45256757736206055},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.43652093410491943},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.41854000091552734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38478121161460876},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29482507705688477},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.2911117374897003},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2760803997516632},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.17419683933258057}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7466980218887329},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6912985444068909},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.6151189804077148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5667649507522583},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5599232316017151},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5279887318611145},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.487255722284317},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.48099765181541443},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4613267481327057},{"id":"https://openalex.org/C9899798","wikidata":"https://www.wikidata.org/wiki/Q629399","display_name":"Genetic operator","level":4,"score":0.45256757736206055},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.43652093410491943},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.41854000091552734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38478121161460876},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29482507705688477},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2911117374897003},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2760803997516632},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.17419683933258057},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2330163.2330340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03255569v1","is_oa":false,"landing_page_url":"https://univ-angers.hal.science/hal-03255569","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://doi.acm.org/10.1145/2330163.2330340","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320334812","display_name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","ror":"https://ror.org/02ap3w078"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W26100655","https://openalex.org/W74931915","https://openalex.org/W83256534","https://openalex.org/W121528679","https://openalex.org/W332481212","https://openalex.org/W783967913","https://openalex.org/W1503085769","https://openalex.org/W1539029254","https://openalex.org/W1543258308","https://openalex.org/W1571087346","https://openalex.org/W1659703095","https://openalex.org/W1668207500","https://openalex.org/W1673033605","https://openalex.org/W1701602585","https://openalex.org/W1814515812","https://openalex.org/W1858311746","https://openalex.org/W1880321215","https://openalex.org/W1971700807","https://openalex.org/W1989353689","https://openalex.org/W2109828852","https://openalex.org/W2112681424","https://openalex.org/W2132519943","https://openalex.org/W2135366549","https://openalex.org/W2159290927","https://openalex.org/W2163428398","https://openalex.org/W3123791793"],"related_works":["https://openalex.org/W2793416423","https://openalex.org/W2298522112","https://openalex.org/W2185228534","https://openalex.org/W2107631366","https://openalex.org/W2356783107","https://openalex.org/W1993697459","https://openalex.org/W4245106865","https://openalex.org/W1998981559","https://openalex.org/W2904153653","https://openalex.org/W2017052626"],"abstract_inverted_index":{"This":[0,42],"paper":[1],"deals":[2],"with":[3,45,76],"the":[4,10,29,32,36,39,46,53,69,82,95,106],"adaptive":[5,92],"selection":[6,89],"of":[7,12,55,94],"operators":[8],"in":[9,38],"context":[11],"local":[13],"search":[14,40],"(LS).":[15],"In":[16],"evolutionary":[17],"algorithms,":[18],"diversity":[19],"is":[20,49,71,74,97],"a":[21,26],"key":[22],"concept.":[23],"We":[24],"consider":[25],"related":[27],"idea:":[28],"similarity":[30],"between":[31,68],"candidate":[33],"solution":[34,47],"and":[35,110],"solutions":[37],"trajectory.":[41],"notion,":[43],"together":[44],"quality,":[48],"used":[50],"to":[51],"evaluate":[52],"performance":[54],"each":[56],"operator.":[57],"A":[58],"new":[59],"utility":[60],"measure":[61,79],"for":[62],"LS":[63],"operators,":[64,70],"evaluating":[65],"relative":[66],"distances":[67],"introduced.":[72],"It":[73],"compared":[75],"an":[77],"existing":[78],"based":[80],"on":[81,105],"Pareto":[83],"dominance":[84],"relationship":[85],"using":[86],"some":[87],"basic":[88],"schemes.":[90],"An":[91],"version":[93],"algorithm":[96],"also":[98],"examined.":[99],"The":[100],"proposed":[101],"methods":[102],"are":[103],"tested":[104],"Quadratic":[107],"Assignment":[108],"Problem":[109],"Asymmetric":[111],"Traveling":[112],"Salesman":[113],"Problem.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
