{"id":"https://openalex.org/W2020279191","doi":"https://doi.org/10.1109/bicta.2010.5645306","title":"A hybrid strategy based on niche genetic algorithm and Tabu search and its convergence property","display_name":"A hybrid strategy based on niche genetic algorithm and Tabu search and its convergence property","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2020279191","doi":"https://doi.org/10.1109/bicta.2010.5645306","mag":"2020279191"},"language":"en","primary_location":{"id":"doi:10.1109/bicta.2010.5645306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bicta.2010.5645306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","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/A5100396723","display_name":"Zhiyong Li","orcid":"https://orcid.org/0000-0001-9720-5915"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiyong Li","raw_affiliation_strings":["College of Computer and Communication, Hunan University, Changsha, China","College of Computer and Communication,Hunan University,Changsha 410082,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer and Communication, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]},{"raw_affiliation_string":"College of Computer and Communication,Hunan University,Changsha 410082,China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033803050","display_name":"Houfu Li","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Houfu Li","raw_affiliation_strings":["College of Computer and Communication, Hunan University, Changsha, China","College of Computer and Communication,Hunan University,Changsha 410082,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer and Communication, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]},{"raw_affiliation_string":"College of Computer and Communication,Hunan University,Changsha 410082,China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061328071","display_name":"Youwen Chen","orcid":"https://orcid.org/0000-0003-4949-8471"},"institutions":[{"id":"https://openalex.org/I1296452710","display_name":"Hunan International Economics University","ror":"https://ror.org/01551ga11","country_code":"CN","type":"education","lineage":["https://openalex.org/I1296452710"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Youwen Chen","raw_affiliation_strings":["Department of Computer, Hunan International Economics University, Changsha, China","Department of Computer, Hunan International Economics University, Changsha 410205, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer, Hunan International Economics University, Changsha, China","institution_ids":["https://openalex.org/I1296452710"]},{"raw_affiliation_string":"Department of Computer, Hunan International Economics University, Changsha 410205, China","institution_ids":["https://openalex.org/I1296452710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083259815","display_name":"Abdelhay A. Sallam","orcid":"https://orcid.org/0000-0002-8355-4476"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"A. Sallam","raw_affiliation_strings":["College of Computer and Communication, Hunan University, Changsha, China","College of Computer and Communication,Hunan University,Changsha 410082,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer and Communication, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]},{"raw_affiliation_string":"College of Computer and Communication,Hunan University,Changsha 410082,China","institution_ids":["https://openalex.org/I16609230"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4661,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7297048,"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":"328","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9991000294685364,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9876000285148621,"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/tabu-search","display_name":"Tabu search","score":0.9212223291397095},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6871888041496277},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6713925004005432},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6333925724029541},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5602589845657349},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5557827949523926},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.5454396605491638},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.5225457549095154},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5175718069076538},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.45645520091056824},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43799370527267456},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.42869511246681213},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.39824849367141724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31197869777679443},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.18273425102233887}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9212223291397095},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6871888041496277},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6713925004005432},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6333925724029541},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5602589845657349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5557827949523926},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.5454396605491638},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.5225457549095154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5175718069076538},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.45645520091056824},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43799370527267456},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.42869511246681213},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.39824849367141724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31197869777679443},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.18273425102233887},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bicta.2010.5645306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bicta.2010.5645306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W129016480","https://openalex.org/W1497256448","https://openalex.org/W1522103180","https://openalex.org/W1580052761","https://openalex.org/W2014868958","https://openalex.org/W2036643871","https://openalex.org/W2047032454","https://openalex.org/W2064518457","https://openalex.org/W2112667413","https://openalex.org/W2126105956","https://openalex.org/W2156375680","https://openalex.org/W2165298420","https://openalex.org/W2184824922","https://openalex.org/W2352075852","https://openalex.org/W2363831935","https://openalex.org/W2385591577","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2370323645","https://openalex.org/W4247343174","https://openalex.org/W1987877777","https://openalex.org/W2391241553","https://openalex.org/W2354628089","https://openalex.org/W2061323558","https://openalex.org/W2353548229","https://openalex.org/W2945829122","https://openalex.org/W2383639304","https://openalex.org/W2383826429"],"abstract_inverted_index":{"Genetic":[0,75],"algorithm":[1,5,28,39,57,76,103],"and":[2,20,43,68,72,80,87,113,122],"Tabu":[3,55],"search":[4,56,60],"are":[6,124],"powerful":[7],"tools":[8],"to":[9,63,84,88,92,105],"solve":[10],"complex":[11],"large-scale":[12],"optimization":[13,38],"problems.":[14],"To":[15],"deal":[16],"with":[17,110],"the":[18,26,46,90,101,106,114],"prematurity":[19,86],"low":[21],"convergence":[22,66,97],"speed":[23,64,67,121],"problems":[24],"when":[25],"genetic":[27],"being":[29],"used":[30],"for":[31,58,77],"global":[32,78,107],"optimization,":[33],"we":[34,53,73,81],"introduce":[35],"a":[36,93],"hybrid":[37],"through":[40],"comprehensive":[41],"contrast":[42],"comparison":[44],"between":[45],"above":[47],"two":[48],"algorithms.":[49],"In":[50],"our":[51],"approach,":[52],"use":[54,74],"local":[59,94],"in":[61],"order":[62],"up":[65],"get":[69],"satisfied":[70],"results,":[71],"search,":[79],"import":[82],"niche":[83],"control":[85],"avoid":[89],"converging":[91],"optimum.":[95],"The":[96],"analysis":[98],"manifests":[99],"that":[100,118],"proposed":[102],"converges":[104],"optimal":[108],"value":[109],"probability":[111],"1,":[112],"excremental":[115],"results":[116],"show":[117],"both":[119],"calculations":[120],"output":[123],"improved.":[125]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}