{"id":"https://openalex.org/W1972329309","doi":"https://doi.org/10.1109/cec.2013.6557856","title":"An Artificial Bee Colony algorithm for solving dynamic optimization problems","display_name":"An Artificial Bee Colony algorithm for solving dynamic optimization problems","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1972329309","doi":"https://doi.org/10.1109/cec.2013.6557856","mag":"1972329309"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557856","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","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/A5113498545","display_name":"Masataka Kojima","orcid":null},"institutions":[{"id":"https://openalex.org/I185088104","display_name":"Tokyo City University","ror":"https://ror.org/04dt6bw53","country_code":"JP","type":"education","lineage":["https://openalex.org/I185088104"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masataka Kojima","raw_affiliation_strings":["Tokyo City University, Setagaya, Tokyo, Japan","(Tokyo City University, Tokyo, Japan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo City University, Setagaya, Tokyo, Japan","institution_ids":["https://openalex.org/I185088104"]},{"raw_affiliation_string":"(Tokyo City University, Tokyo, Japan)","institution_ids":["https://openalex.org/I185088104"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hidehiro Nakano","orcid":null},"institutions":[{"id":"https://openalex.org/I185088104","display_name":"Tokyo City University","ror":"https://ror.org/04dt6bw53","country_code":"JP","type":"education","lineage":["https://openalex.org/I185088104"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hidehiro Nakano","raw_affiliation_strings":["Tokyo City University, Setagaya, Tokyo, Japan","(Tokyo City University, Tokyo, Japan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo City University, Setagaya, Tokyo, Japan","institution_ids":["https://openalex.org/I185088104"]},{"raw_affiliation_string":"(Tokyo City University, Tokyo, Japan)","institution_ids":["https://openalex.org/I185088104"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110499311","display_name":"Arata Miyauchi","orcid":null},"institutions":[{"id":"https://openalex.org/I185088104","display_name":"Tokyo City University","ror":"https://ror.org/04dt6bw53","country_code":"JP","type":"education","lineage":["https://openalex.org/I185088104"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Arata Miyauchi","raw_affiliation_strings":["Tokyo City University, Setagaya, Tokyo, Japan","(Tokyo City University, Tokyo, Japan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo City University, Setagaya, Tokyo, Japan","institution_ids":["https://openalex.org/I185088104"]},{"raw_affiliation_string":"(Tokyo City University, Tokyo, Japan)","institution_ids":["https://openalex.org/I185088104"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185088104"],"apc_list":null,"apc_paid":null,"fwci":0.4576,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.5768521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2398","last_page":"2405"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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":1.0,"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.9983000159263611,"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/metaheuristic","display_name":"Metaheuristic","score":0.7207409739494324},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6893619894981384},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6722606420516968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6540001034736633},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.6389586925506592},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6299929022789001},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5669974684715271},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.5018243789672852},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4714720547199249},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.4487876892089844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4375782310962677},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.35680270195007324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19630342721939087}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7207409739494324},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6893619894981384},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6722606420516968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6540001034736633},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6389586925506592},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6299929022789001},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5669974684715271},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.5018243789672852},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4714720547199249},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.4487876892089844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4375782310962677},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.35680270195007324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19630342721939087},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2013.6557856","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","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":10,"referenced_works":["https://openalex.org/W59902644","https://openalex.org/W93411686","https://openalex.org/W1966334496","https://openalex.org/W1971829896","https://openalex.org/W2144317842","https://openalex.org/W2149200476","https://openalex.org/W2324877499","https://openalex.org/W2687161862","https://openalex.org/W2977273197","https://openalex.org/W6641951049"],"related_works":["https://openalex.org/W2113650225","https://openalex.org/W2393398569","https://openalex.org/W2365047340","https://openalex.org/W2133565636","https://openalex.org/W1967339272","https://openalex.org/W2378423769","https://openalex.org/W2063870188","https://openalex.org/W2391889613","https://openalex.org/W2186293978","https://openalex.org/W2885739335"],"abstract_inverted_index":{"Artificial":[0],"Bee":[1],"Colony":[2],"(ABC)":[3],"is":[4,20,36,74,137],"a":[5],"fast":[6,113],"and":[7,45,88],"robust":[8],"algorithm":[9,99],"to":[10,38,41,79,83,92,124],"solve":[11],"various":[12,117],"optimization":[13,43,53,67,103,119],"problems":[14,44,54,68,104],"with":[15,27,105],"complex":[16],"nonlinearity.":[17],"Especially,":[18],"ABC":[19,35,62,98],"effective":[21],"for":[22,51,64,76,100,116],"high":[23],"dimensional":[24],"problems,":[25,120],"compared":[26],"the":[28,33,81,89,128,131,134],"other":[29],"metaheuristic":[30],"algorithms.":[31],"However,":[32,72],"basic":[34],"assumed":[37],"be":[39],"used":[40],"static":[42],"has":[46],"not":[47],"been":[48,70],"sufficiently":[49],"considered":[50],"dynamic":[52,66,102,118],"including":[55],"temporal":[56,84],"changes":[57,85],"of":[58,86,133],"environments.":[59],"Recently,":[60],"improved":[61],"methods":[63,78],"solving":[65,101],"have":[69],"proposed.":[71],"it":[73],"difficult":[75],"these":[77],"balance":[80],"flexibility":[82],"environments":[87],"convergent":[90],"speed":[91],"solutions.":[93,126],"This":[94],"paper":[95],"proposes":[96],"an":[97],"simple":[106],"procedures.":[107],"The":[108],"proposed":[109,135],"method":[110,136],"can":[111],"realize":[112],"solution":[114],"search":[115],"suppressing":[121],"excessive":[122],"convergence":[123],"limited":[125],"In":[127],"numerical":[129],"simulations,":[130],"effectiveness":[132],"verified.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}