{"id":"https://openalex.org/W2892023425","doi":"https://doi.org/10.1109/cscwd.2018.8465387","title":"A Hybrid Method Combining Tab Search and Nelder-Mead Algorithms for Global Continuous Optimization Problems","display_name":"A Hybrid Method Combining Tab Search and Nelder-Mead Algorithms for Global Continuous Optimization Problems","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2892023425","doi":"https://doi.org/10.1109/cscwd.2018.8465387","mag":"2892023425"},"language":"en","primary_location":{"id":"doi:10.1109/cscwd.2018.8465387","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cscwd.2018.8465387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design ((CSCWD))","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/A5102312027","display_name":"Kaifeng Zheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kaifeng Zheng","raw_affiliation_strings":["China North Vehicle, Research Institute, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China North Vehicle, Research Institute, Beijing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100406958","display_name":"Chao Wang","orcid":"https://orcid.org/0000-0002-2226-9575"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chao Wang","raw_affiliation_strings":["China North Vehicle, Research Institute, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China North Vehicle, Research Institute, Beijing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049377744","display_name":"Weizheng An","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weizheng An","raw_affiliation_strings":["China North Vehicle, Research Institute, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China North Vehicle, Research Institute, Beijing, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045674955","display_name":"Likun Ge","orcid":"https://orcid.org/0000-0002-1593-3466"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Likun Ge","raw_affiliation_strings":["China North Vehicle, Research Institute, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China North Vehicle, Research Institute, Beijing, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10377687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"113","issue":null,"first_page":"17","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9984999895095825,"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.7871366739273071},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5953163504600525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5431041717529297},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.520522952079773},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5103873610496521},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4571080803871155},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4489594101905823},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4295826554298401},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.41308242082595825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3543080687522888},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.34242016077041626},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.18552705645561218}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7871366739273071},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5953163504600525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5431041717529297},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.520522952079773},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5103873610496521},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4571080803871155},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4489594101905823},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4295826554298401},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.41308242082595825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3543080687522888},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34242016077041626},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.18552705645561218},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","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},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cscwd.2018.8465387","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cscwd.2018.8465387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design ((CSCWD))","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":35,"referenced_works":["https://openalex.org/W1579885990","https://openalex.org/W1953140490","https://openalex.org/W1975009952","https://openalex.org/W1978301563","https://openalex.org/W1978740922","https://openalex.org/W1978835400","https://openalex.org/W1981052299","https://openalex.org/W1987122308","https://openalex.org/W1988155782","https://openalex.org/W1994996222","https://openalex.org/W2007800922","https://openalex.org/W2013318791","https://openalex.org/W2028162268","https://openalex.org/W2031804592","https://openalex.org/W2037185568","https://openalex.org/W2042647239","https://openalex.org/W2045338651","https://openalex.org/W2052972915","https://openalex.org/W2062960021","https://openalex.org/W2075294594","https://openalex.org/W2085526588","https://openalex.org/W2089501235","https://openalex.org/W2104670598","https://openalex.org/W2115019130","https://openalex.org/W2116314764","https://openalex.org/W2125049141","https://openalex.org/W2138901716","https://openalex.org/W2157803203","https://openalex.org/W2159707550","https://openalex.org/W2160694855","https://openalex.org/W2171074980","https://openalex.org/W4246598646","https://openalex.org/W6634614362","https://openalex.org/W6645257109","https://openalex.org/W6683467369"],"related_works":["https://openalex.org/W2353523849","https://openalex.org/W2388574609","https://openalex.org/W2380579096","https://openalex.org/W2012657801","https://openalex.org/W2088150073","https://openalex.org/W2144570772","https://openalex.org/W2044012686","https://openalex.org/W2794858631","https://openalex.org/W1988325824","https://openalex.org/W2351380831"],"abstract_inverted_index":{"A":[0],"hybrid":[1,63,111,164,175,195],"method":[2,30,112,143,165,183,196],"combining":[3],"tabu":[4,24],"search":[5,25],"(TS)":[6],"and":[7,38,102,155,169],"Simplex":[8],"NeIder-Mead":[9],"(NM)":[10],"has":[11,113,147],"been":[12],"proposed":[13,29,80,110,163],"for":[14,137],"solving":[15,118],"global":[16,120],"continuous":[17,23,121],"optimization":[18,122],"problems.":[19,123],"Similar":[20],"to":[21,83,144,166,184],"enhanced":[22],"(ECTS)":[26],"method,":[27],"the":[28,45,72,76,91,109,119,125,141,148,153,157,162,167,170,177,203,206,215],"works":[31,43,49],"in":[32,44,52,56,71,117,152,156],"three":[33,103],"sequential":[34],"phases:":[35],"diversification,":[36],"semi-intensification":[37,53],"intensification.":[39],"TS":[40],"strategy":[41,48,67],"just":[42,69],"diversification.":[46],"NM":[47,66],"not":[50,223],"only":[51],"but":[54],"also":[55],"intensification":[57],"which":[58],"is":[59,68,99,130,187,197,208,217,222],"different":[60],"from":[61],"other":[62,173,200],"methods":[64,82,95,201],"where":[65],"applied":[70],"third":[73],"phase.":[74],"In":[75],"first":[77,87],"phase,":[78],"we":[79],"four":[81,94],"generate":[84,145,185],"neighbors.":[85],"The":[86,190],"numerical":[88,179],"experiment":[89,180],"comparing":[90],"results":[92],"of":[93,96,128,205,227],"neighbor":[97],"generation":[98],"carried":[100,188],"out":[101],"important":[104,132],"conclusions":[105],"are":[106],"given.":[107],"First,":[108],"a":[114],"good":[115],"performance":[116,150],"Second,":[124],"right":[126,135],"direction":[127],"neighbors":[129,146,186],"more":[131,210,218],"than":[133,199,211,219,225],"its":[134],"hierarchy":[136],"most":[138,171],"functions.":[139],"Third,":[140],"spiral":[142,182],"moderate":[149],"both":[151],"robustness":[154],"calculation":[158],"speed.":[159],"To":[160],"compare":[161],"best":[168],"recent":[172],"published":[174],"methods,":[176],"second":[178],"with":[181],"out.":[189],"comparison":[191],"shows":[192],"that":[193],"our":[194],"better":[198],"when":[202],"dimension":[204,216],"functions":[207],"no":[209],"4.":[212],"Moreover,":[213],"although":[214],"4,":[220],"it":[221],"worse":[224],"many":[226],"them.":[228]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}