{"id":"https://openalex.org/W2125567486","doi":"https://doi.org/10.1109/cec.2008.4631109","title":"Nearest neighbor evolutionary algorithm for constrained optimization problem","display_name":"Nearest neighbor evolutionary algorithm for constrained optimization problem","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2125567486","doi":"https://doi.org/10.1109/cec.2008.4631109","mag":"2125567486"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2008.4631109","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4631109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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/A5100701158","display_name":"Zhiwen Yu","orcid":"https://orcid.org/0000-0002-0935-5890"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Zhiwen Yu","raw_affiliation_strings":["Department of Computer Science, City university of Hong Kong, Hong Kong, China","Department of Computer Science, City University of Hong Kong, Hong Kong,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City university of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong,#TAB#","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038423570","display_name":"Dingwen Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Dingwen Wang","raw_affiliation_strings":["Department of Computer Science, City university of Hong Kong, Hong Kong, China","Department of Computer Science, City University of Hong Kong, Hong Kong,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City university of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong,#TAB#","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014196059","display_name":"Hau\u2212San Wong","orcid":"https://orcid.org/0000-0002-1530-7529"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Hau-San Wong","raw_affiliation_strings":["Department of Computer Science, City university of Hong Kong, Hong Kong, China","Department of Computer Science, City University of Hong Kong, Hong Kong,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City university of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong,#TAB#","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"2335","last_page":"2342"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9896000027656555,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9850000143051147,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6081355214118958},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5872158408164978},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5841977596282959},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5139181613922119},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4971511662006378},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.47546786069869995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4445909261703491},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.4331516623497009},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.422243595123291},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.418138325214386},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4063732624053955},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3238222599029541},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26596128940582275}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6081355214118958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5872158408164978},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5841977596282959},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5139181613922119},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4971511662006378},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.47546786069869995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4445909261703491},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.4331516623497009},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.422243595123291},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.418138325214386},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4063732624053955},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3238222599029541},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26596128940582275},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2008.4631109","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2008.4631109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","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":20,"referenced_works":["https://openalex.org/W59769033","https://openalex.org/W1511857018","https://openalex.org/W2007351764","https://openalex.org/W2102343719","https://openalex.org/W2103055617","https://openalex.org/W2104324382","https://openalex.org/W2117640392","https://openalex.org/W2125209343","https://openalex.org/W2128010900","https://openalex.org/W2130778140","https://openalex.org/W2151339633","https://openalex.org/W2155951974","https://openalex.org/W2156554027","https://openalex.org/W2161029074","https://openalex.org/W2161447745","https://openalex.org/W2164655924","https://openalex.org/W2167580870","https://openalex.org/W2170338867","https://openalex.org/W2171524068","https://openalex.org/W2175677697"],"related_works":["https://openalex.org/W2375128115","https://openalex.org/W2182477562","https://openalex.org/W2245581955","https://openalex.org/W2351157934","https://openalex.org/W2381195555","https://openalex.org/W2519241726","https://openalex.org/W1558159560","https://openalex.org/W4297819076","https://openalex.org/W1671890395","https://openalex.org/W2107686700"],"abstract_inverted_index":{"Although":[0],"there":[1],"exist":[2],"a":[3,28,99],"lot":[4,100],"of":[5,13,17,72,101,109,114],"approaches":[6,111],"to":[7,39],"solve":[8,40],"constrained":[9,42,102,115],"optimization":[10,43,103,116],"problem,":[11],"few":[12],"them":[14],"makes":[15],"use":[16],"the":[18,22,26,41,55,61,65,73,78,82,88],"knowledge":[19,62],"obtained":[20,63],"in":[21,54,64,87,98,112],"searching":[23,56,66],"process.":[24,67],"In":[25],"paper,":[27],"new":[29],"algorithm":[30,35],"called":[31],"nearest":[32],"neighbor":[33],"evolutionary":[34],"(NNE)":[36],"is":[37],"proposed":[38],"problem.":[44],"NNE":[45,68,92],"not":[46,93],"only":[47,94],"performs":[48],"global":[49],"search":[50,53],"and":[51,76,121],"local":[52],"process,":[57],"but":[58,105],"also":[59,69,106],"considers":[60],"avail":[70],"itself":[71],"elitist":[74],"strategy":[75],"keeps":[77],"best":[79],"individuals":[80],"for":[81],"next":[83],"generation.":[84],"The":[85],"results":[86],"experiments":[89],"show":[90],"that":[91],"achieves":[95],"good":[96],"performance":[97],"problems,":[104,117],"outperforms":[107],"most":[108,113],"state-of-art":[110],"such":[118],"as":[119],"ASCHEA":[120],"SEMS.":[122]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}