{"id":"https://openalex.org/W2035332689","doi":"https://doi.org/10.1109/his.2012.6421324","title":"A novel hybrid algorithm for optimization in multimodal Dynamic environments","display_name":"A novel hybrid algorithm for optimization in multimodal Dynamic environments","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2035332689","doi":"https://doi.org/10.1109/his.2012.6421324","mag":"2035332689"},"language":"en","primary_location":{"id":"doi:10.1109/his.2012.6421324","is_oa":false,"landing_page_url":"https://doi.org/10.1109/his.2012.6421324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th International Conference on Hybrid Intelligent Systems (HIS)","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/A5088311682","display_name":"Alireza Sepas\u2010Moghaddam","orcid":"https://orcid.org/0000-0002-4881-5386"},"institutions":[{"id":"https://openalex.org/I197220011","display_name":"Qazvin Islamic Azad University","ror":"https://ror.org/023kjn321","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I197220011"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Alireza Sepas-Moghaddam","raw_affiliation_strings":["Department of Computer and IT Engineering, Islamic Azad University, Qazvin, Iran","Department of Computer and IT Engineering, Islamic Azad University, Qazvin Branch, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and IT Engineering, Islamic Azad University, Qazvin, Iran","institution_ids":["https://openalex.org/I197220011"]},{"raw_affiliation_string":"Department of Computer and IT Engineering, Islamic Azad University, Qazvin Branch, Iran","institution_ids":["https://openalex.org/I197220011"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046682940","display_name":"Alireza Arabshahi","orcid":"https://orcid.org/0000-0003-1656-7741"},"institutions":[{"id":"https://openalex.org/I183859904","display_name":"Islamic Azad University, Mashhad","ror":"https://ror.org/00bvysh61","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I183859904"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Alireza Arabshahi","raw_affiliation_strings":["Young Researchers Club, Islamic Azad University, Mashhad, Iran","University of Information Technology and Management, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Young Researchers Club, Islamic Azad University, Mashhad, Iran","institution_ids":["https://openalex.org/I183859904"]},{"raw_affiliation_string":"University of Information Technology and Management, Tehran, Iran","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044801385","display_name":"Danial Yazdani","orcid":"https://orcid.org/0000-0002-7799-5013"},"institutions":[{"id":"https://openalex.org/I183859904","display_name":"Islamic Azad University, Mashhad","ror":"https://ror.org/00bvysh61","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I183859904"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Danial Yazdani","raw_affiliation_strings":["University of Information Technology and Management, Tehran, Iran","Young Researchers Club, Mashhad Branch Islamic Azad University, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Information Technology and Management, Tehran, Iran","institution_ids":[]},{"raw_affiliation_string":"Young Researchers Club, Mashhad Branch Islamic Azad University, Iran","institution_ids":["https://openalex.org/I183859904"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065991691","display_name":"Mohammad Mahdi Dehshibi","orcid":"https://orcid.org/0000-0001-8112-5419"},"institutions":[{"id":"https://openalex.org/I110525433","display_name":"Islamic Azad University, Tehran","ror":"https://ror.org/01kzn7k21","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433"]},{"id":"https://openalex.org/I2802594446","display_name":"Islamic Azad University of Parand","ror":"https://ror.org/02mgtjj52","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I2802594446"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Mahdi Dehshibi","raw_affiliation_strings":["Department of Computer and IT Engineering, Islamic Azad University, Tehran, Iran","Department of Computer and IT Engineering, Islamic Azad University, Parand Branch, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and IT Engineering, Islamic Azad University, Tehran, Iran","institution_ids":["https://openalex.org/I110525433"]},{"raw_affiliation_string":"Department of Computer and IT Engineering, Islamic Azad University, Parand Branch, Tehran, Iran","institution_ids":["https://openalex.org/I2802594446"]}]}],"institutions":[],"countries_distinct_count":1,"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":14,"citation_normalized_percentile":{"value":0.10170524,"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":"143","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.995199978351593,"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.9894999861717224,"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/benchmark","display_name":"Benchmark (surveying)","score":0.8508187532424927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7299448251724243},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5874902009963989},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.5359469652175903},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5336098670959473},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5127435922622681},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4810348153114319},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44722145795822144},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.4467158019542694},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.4141327738761902},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3915420174598694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11640089750289917}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.8508187532424927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7299448251724243},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5874902009963989},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.5359469652175903},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5336098670959473},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5127435922622681},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4810348153114319},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44722145795822144},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.4467158019542694},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4141327738761902},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3915420174598694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11640089750289917},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/his.2012.6421324","is_oa":false,"landing_page_url":"https://doi.org/10.1109/his.2012.6421324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th International Conference on Hybrid Intelligent Systems (HIS)","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":26,"referenced_works":["https://openalex.org/W326774659","https://openalex.org/W1500414540","https://openalex.org/W1526735111","https://openalex.org/W1565374082","https://openalex.org/W1764243974","https://openalex.org/W2012569260","https://openalex.org/W2041006267","https://openalex.org/W2052164702","https://openalex.org/W2079675700","https://openalex.org/W2103712249","https://openalex.org/W2104345002","https://openalex.org/W2105417920","https://openalex.org/W2110988848","https://openalex.org/W2115350182","https://openalex.org/W2129028773","https://openalex.org/W2143525780","https://openalex.org/W2148062191","https://openalex.org/W2148458253","https://openalex.org/W2152195021","https://openalex.org/W2162012556","https://openalex.org/W2167894932","https://openalex.org/W2223268946","https://openalex.org/W6611259849","https://openalex.org/W6660530411","https://openalex.org/W6675384047","https://openalex.org/W6684774734"],"related_works":["https://openalex.org/W2965421953","https://openalex.org/W2349895019","https://openalex.org/W2950423922","https://openalex.org/W2113650225","https://openalex.org/W2116074880","https://openalex.org/W2379567910","https://openalex.org/W2068415580","https://openalex.org/W2885739335","https://openalex.org/W2186293978","https://openalex.org/W3212179065"],"abstract_inverted_index":{"Objective":[0],"function":[1],"or":[2],"the":[3,7,11,46,80,99,111,135,138],"constraints":[4],"and":[5,69,119],"consequently":[6],"optimal":[8],"value":[9],"of":[10,82,98,124,137,143],"problem":[12],"can":[13],"be":[14],"changed":[15],"during":[16],"time":[17],"in":[18,26,35,42,57,93,128,146],"Dynamic":[19],"optimization":[20,34,56,68],"problems.":[21],"There":[22],"are":[23,102,120],"several":[24,40,125],"challenges":[25],"dynamic":[27,58,117],"environments,":[28,59,118],"so":[29],"that":[30,134,142],"algorithms":[31,127,145],"designed":[32],"for":[33,55,115],"these":[36],"environments":[37],"would":[38],"utilize":[39],"mechanisms":[41],"order":[43],"to":[44,78],"conquer":[45],"challenges.":[47],"In":[48,73],"this":[49,74,129,147],"paper,":[50],"a":[51],"novel":[52],"hybrid":[53],"algorithm":[54],"called":[60],"HPSOLS,":[61],"is":[62,109],"proposed":[63,100,139],"based":[64],"on":[65,89],"particle":[66],"swarm":[67],"local":[70,83],"search":[71,84],"approaches.":[72],"approach,":[75],"it":[76],"aims":[77],"increase":[79],"ability":[81],"around":[85],"optimum":[86],"with":[87,122],"focusing":[88],"best":[90],"found":[91],"peak":[92,106],"each":[94],"environment.":[95],"The":[96],"results":[97,123,132],"approach":[101],"evaluated":[103],"using":[104],"moving":[105],"benchmark,":[107],"which":[108],"currently":[110],"most":[112],"well-known":[113],"benchmark":[114],"evaluating":[116],"compared":[121],"state-of-the-art":[126],"domain.":[130,148],"Experimental":[131],"show":[133],"efficiency":[136],"method":[140],"outperforms":[141],"other":[144]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}