{"id":"https://openalex.org/W2057369174","doi":"https://doi.org/10.1109/cec.2014.6900307","title":"Absorption in model-based search algorithms for combinatorial optimization","display_name":"Absorption in model-based search algorithms for combinatorial optimization","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2057369174","doi":"https://doi.org/10.1109/cec.2014.6900307","mag":"2057369174"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900307","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","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/A5100738667","display_name":"Zijun Wu","orcid":"https://orcid.org/0000-0002-8662-9816"},"institutions":[{"id":"https://openalex.org/I43980791","display_name":"Clausthal University of Technology","ror":"https://ror.org/04qb8nc58","country_code":"DE","type":"education","lineage":["https://openalex.org/I43980791"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Zijun Wu","raw_affiliation_strings":["Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Clausthal-Zellerfeld, Germany","[Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Erzstr.1, D-38678 Clausthal-Zellerfeld, Germany]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Clausthal-Zellerfeld, Germany","institution_ids":["https://openalex.org/I43980791"]},{"raw_affiliation_string":"[Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Erzstr.1, D-38678 Clausthal-Zellerfeld, Germany]","institution_ids":["https://openalex.org/I43980791"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048632411","display_name":"Michael Kolonko","orcid":null},"institutions":[{"id":"https://openalex.org/I43980791","display_name":"Clausthal University of Technology","ror":"https://ror.org/04qb8nc58","country_code":"DE","type":"education","lineage":["https://openalex.org/I43980791"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Kolonko","raw_affiliation_strings":["Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Clausthal-Zellerfeld, Germany","[Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Erzstr.1, D-38678 Clausthal-Zellerfeld, Germany]"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Clausthal-Zellerfeld, Germany","institution_ids":["https://openalex.org/I43980791"]},{"raw_affiliation_string":"[Institut f\u00fcr Angewandte Stochastik und Operations Research, TU Clausthal, Erzstr.1, D-38678 Clausthal-Zellerfeld, Germany]","institution_ids":["https://openalex.org/I43980791"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100738667"],"corresponding_institution_ids":["https://openalex.org/I43980791"],"apc_list":null,"apc_paid":null,"fwci":0.9659621,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.81794105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"282","issue":null,"first_page":"1744","last_page":"1751"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9979000091552734,"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.9979000091552734,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9872999787330627,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9829000234603882,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5961172580718994},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5117065906524658},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5112724304199219},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5030075907707214},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4829384684562683},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.465705931186676},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.46483728289604187},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4554031789302826},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.448022723197937},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44103744626045227},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.4268551170825958},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.4237460792064667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2978730797767639},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26780933141708374},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.26380234956741333}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5961172580718994},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5117065906524658},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5112724304199219},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5030075907707214},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4829384684562683},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.465705931186676},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.46483728289604187},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4554031789302826},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.448022723197937},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44103744626045227},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.4268551170825958},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.4237460792064667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2978730797767639},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26780933141708374},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.26380234956741333},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2014.6900307","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1479911746","https://openalex.org/W1575839460","https://openalex.org/W1883915183","https://openalex.org/W1985659376","https://openalex.org/W1994616650","https://openalex.org/W2050215344","https://openalex.org/W2078297643","https://openalex.org/W2107941094","https://openalex.org/W2132083787","https://openalex.org/W2133615895","https://openalex.org/W3154803405","https://openalex.org/W4292408555"],"related_works":["https://openalex.org/W2474680198","https://openalex.org/W79495104","https://openalex.org/W2132657523","https://openalex.org/W2076582324","https://openalex.org/W2166283570","https://openalex.org/W1521720388","https://openalex.org/W4245106865","https://openalex.org/W1984081282","https://openalex.org/W2461621720","https://openalex.org/W2171591902"],"abstract_inverted_index":{"Model-based":[0],"search":[1,37,54,93],"is":[2,55,71,76,118,127],"an":[3],"abstract":[4],"framework":[5],"that":[6,59,83,115],"unifies":[7],"the":[8,35,48,56,61,64,124],"main":[9],"features":[10],"of":[11,15,29,52,63,105],"a":[12,99,106],"large":[13],"class":[14],"heuristic":[16],"procedures":[17],"for":[18,34,47],"combinatorial":[19],"optimization,":[20],"it":[21,111],"includes":[22],"ant":[23],"algorithms,":[24],"cross":[25],"entropy":[26],"and":[27],"estimation":[28],"distribution":[30],"algorithms.":[31,43],"Properties":[32],"shown":[33],"model-based":[36,53,92],"therefore":[38],"apply":[39],"to":[40],"all":[41,91,102],"these":[42],"A":[44],"crucial":[45],"parameter":[46],"long":[49],"term":[50],"behavior":[51],"learning":[57],"rate":[58,75],"controls":[60],"update":[62],"model":[65],"when":[66,123],"new":[67],"information":[68],"from":[69],"samples":[70,103],"available.":[72],"Often":[73],"this":[74,85,116],"kept":[77],"constant":[78],"over":[79],"time.":[80],"We":[81],"show":[82],"in":[84],"case":[86],"after":[87],"finitely":[88],"many":[89],"iterations,":[90],"algorithms":[94],"will":[95],"be":[96,113],"absorbed":[97],"into":[98],"state":[100],"where":[101],"consist":[104],"single":[107],"solution":[108,117,126],"only.":[109],"Moreover,":[110],"cannot":[112],"guaranteed":[114],"optimal,":[119],"at":[120],"least":[121],"not":[122],"optimal":[125],"unique.":[128]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}