{"id":"https://openalex.org/W2064266449","doi":"https://doi.org/10.1145/1068009.1068175","title":"The enhanced evolutionary tabu search and its application to the quadratic assignment problem","display_name":"The enhanced evolutionary tabu search and its application to the quadratic assignment problem","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W2064266449","doi":"https://doi.org/10.1145/1068009.1068175","mag":"2064266449"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068175","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th 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/A5063061428","display_name":"John F. McLoughlin","orcid":null},"institutions":[{"id":"https://openalex.org/I1315778391","display_name":"Lehigh Valley Hospital-Pocono","ror":"https://ror.org/01w09ak35","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1315778391","https://openalex.org/I4210094360"]},{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John F. McLoughlin","raw_affiliation_strings":["Penn State Great Valley, Malvern, PA"],"affiliations":[{"raw_affiliation_string":"Penn State Great Valley, Malvern, PA","institution_ids":["https://openalex.org/I1315778391","https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068458969","display_name":"Walter Cede\u00f1o","orcid":null},"institutions":[{"id":"https://openalex.org/I1330063522","display_name":"Johnson & Johnson (United States)","ror":"https://ror.org/03qd7mz70","country_code":"US","type":"company","lineage":["https://openalex.org/I1330063522"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Walter Cede\u00f1o","raw_affiliation_strings":["Johnson & Johnson Pharmaceutical R&D, Exton, PA"],"affiliations":[{"raw_affiliation_string":"Johnson & Johnson Pharmaceutical R&D, Exton, PA","institution_ids":["https://openalex.org/I1330063522"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063061428"],"corresponding_institution_ids":["https://openalex.org/I130769515","https://openalex.org/I1315778391"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.11996202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"975","last_page":"982"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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.9973000288009644,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9962000250816345,"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/tabu-search","display_name":"Tabu search","score":0.9420520067214966},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.8111014366149902},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6993460655212402},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6735442876815796},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5550106167793274},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5469626784324646},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.532646894454956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5285921096801758},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5069194436073303},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49168306589126587},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4902830421924591},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.416208416223526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33669859170913696},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.32530638575553894}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9420520067214966},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.8111014366149902},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6993460655212402},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6735442876815796},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5550106167793274},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5469626784324646},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.532646894454956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5285921096801758},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5069194436073303},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49168306589126587},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4902830421924591},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.416208416223526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33669859170913696},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.32530638575553894},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1068009.1068175","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.420.7864","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.7864","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/gecco2005/docs/p975.pdf","raw_type":"text"}],"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/W34399546","https://openalex.org/W1497256448","https://openalex.org/W1503085769","https://openalex.org/W1534169086","https://openalex.org/W1559215823","https://openalex.org/W1659842140","https://openalex.org/W1833366547","https://openalex.org/W1966081460","https://openalex.org/W1968661326","https://openalex.org/W1971700807","https://openalex.org/W1989353689","https://openalex.org/W2016688797","https://openalex.org/W2020696014","https://openalex.org/W2084792706","https://openalex.org/W2086917808","https://openalex.org/W2097571405","https://openalex.org/W2104670598","https://openalex.org/W2148948822","https://openalex.org/W2260099606","https://openalex.org/W2339500526","https://openalex.org/W4210424113","https://openalex.org/W4212899374","https://openalex.org/W4246598646"],"related_works":["https://openalex.org/W1533229056","https://openalex.org/W2167308444","https://openalex.org/W2137181043","https://openalex.org/W1975389169","https://openalex.org/W2058029809","https://openalex.org/W2329077287","https://openalex.org/W2103589583","https://openalex.org/W2360928386","https://openalex.org/W1978540692","https://openalex.org/W2519041592"],"abstract_inverted_index":{"We":[0,113],"describe":[1],"the":[2,77,85,106,117],"Enhanced":[3],"Evolutionary":[4],"Tabu":[5,17,49],"Search":[6,18,50],"(EE-TS)":[7],"local":[8],"search":[9,29],"technique.":[10],"The":[11,87],"EE-TS":[12,72,91,101],"metaheuristic":[13],"technique":[14],"combines":[15],"Reactive":[16,48],"with":[19,53],"evolutionary":[20],"computing":[21],"elements":[22],"proven":[23],"to":[24,76,104],"work":[25],"well":[26],"in":[27,110],"multimodal":[28],"spaces.":[30],"An":[31],"initial":[32],"set":[33,68],"of":[34,69,122],"solutions":[35,63,109],"is":[36,51,74],"generated":[37],"using":[38,81],"a":[39,66],"stochastic":[40],"heuristic":[41],"operator":[42],"based":[43],"on":[44],"Restricted":[45],"Candidate":[46],"List.":[47],"augmented":[52],"selection":[54],"and":[55,120],"recombination":[56],"operators":[57],"that":[58,90],"preserve":[59],"common":[60],"traits":[61],"between":[62],"while":[64],"maintaining":[65],"diverse":[67],"good":[70],"solutions.":[71],"performance":[73],"applied":[75],"Quadratic":[78],"Assignment":[79],"Problem":[80],"problem":[82],"instances":[83],"from":[84],"QAPLIB.":[86],"results":[88],"show":[89],"compares":[92],"favorably":[93],"against":[94],"other":[95],"known":[96,107],"techniques.":[97],"In":[98],"most":[99],"cases,":[100],"was":[102],"able":[103],"find":[105],"optimal":[108],"fewer":[111],"iterations.":[112],"conclude":[114],"by":[115],"describing":[116],"main":[118],"benefits":[119],"limitations":[121],"EE-TS.":[123]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}