{"id":"https://openalex.org/W2499687616","doi":"https://doi.org/10.1109/meco.2016.7525772","title":"The study of characteristics of the hybrid particle swarm algorithm in solution of the global optimization problem","display_name":"The study of characteristics of the hybrid particle swarm algorithm in solution of the global optimization problem","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2499687616","doi":"https://doi.org/10.1109/meco.2016.7525772","mag":"2499687616"},"language":"en","primary_location":{"id":"doi:10.1109/meco.2016.7525772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco.2016.7525772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 5th Mediterranean Conference on Embedded Computing (MECO)","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/A5014751855","display_name":"Liliya Demidova","orcid":"https://orcid.org/0000-0003-4516-3746"},"institutions":[{"id":"https://openalex.org/I4210149385","display_name":"Ryazan State Radio Engineering University","ror":"https://ror.org/04y34yk39","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210149385"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Liliya Demidova","raw_affiliation_strings":["Ryazan State Radio Engineering University, Ryazan, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ryazan State Radio Engineering University, Ryazan, Russia","institution_ids":["https://openalex.org/I4210149385"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036437034","display_name":"Irina Klyueva","orcid":null},"institutions":[{"id":"https://openalex.org/I4210149385","display_name":"Ryazan State Radio Engineering University","ror":"https://ror.org/04y34yk39","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210149385"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Irina Klyueva","raw_affiliation_strings":["Ryazan State Radio Engineering University, Ryazan, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ryazan State Radio Engineering University, Ryazan, Russia","institution_ids":["https://openalex.org/I4210149385"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018660116","display_name":"A. N. Pylkin","orcid":"https://orcid.org/0000-0001-9925-2870"},"institutions":[{"id":"https://openalex.org/I4210149385","display_name":"Ryazan State Radio Engineering University","ror":"https://ror.org/04y34yk39","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210149385"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Pylkin","raw_affiliation_strings":["Ryazan State Radio Engineering University, Ryazan, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ryazan State Radio Engineering University, Ryazan, Russia","institution_ids":["https://openalex.org/I4210149385"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7666,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.89278929,"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":"322","last_page":"325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9972000122070312,"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.9972000122070312,"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/T13983","display_name":"Cybersecurity and Information Systems","score":0.963699996471405,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9448999762535095,"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.8178044557571411},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6629752516746521},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6489896774291992},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5921648144721985},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5850791335105896},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.5736632347106934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5232376456260681},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.46339303255081177},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4575899839401245},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.4389949440956116},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.43650147318840027},{"id":"https://openalex.org/keywords/firefly-algorithm","display_name":"Firefly algorithm","score":0.43551698327064514},{"id":"https://openalex.org/keywords/method-of-steepest-descent","display_name":"Method of steepest descent","score":0.4268721342086792},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.4253448247909546},{"id":"https://openalex.org/keywords/imperialist-competitive-algorithm","display_name":"Imperialist competitive algorithm","score":0.4200001060962677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2816409468650818}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.8178044557571411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6629752516746521},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6489896774291992},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5921648144721985},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5850791335105896},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.5736632347106934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5232376456260681},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.46339303255081177},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4575899839401245},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.4389949440956116},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.43650147318840027},{"id":"https://openalex.org/C154982244","wikidata":"https://www.wikidata.org/wiki/Q5451844","display_name":"Firefly algorithm","level":3,"score":0.43551698327064514},{"id":"https://openalex.org/C158847443","wikidata":"https://www.wikidata.org/wiki/Q1997812","display_name":"Method of steepest descent","level":2,"score":0.4268721342086792},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.4253448247909546},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.4200001060962677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2816409468650818},{"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/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/meco.2016.7525772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco.2016.7525772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 5th Mediterranean Conference on Embedded Computing (MECO)","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":22,"referenced_works":["https://openalex.org/W659475733","https://openalex.org/W1507015292","https://openalex.org/W1605794277","https://openalex.org/W1918036644","https://openalex.org/W1989951619","https://openalex.org/W2070771761","https://openalex.org/W2072880371","https://openalex.org/W2076582109","https://openalex.org/W2158001550","https://openalex.org/W2159214028","https://openalex.org/W2165171393","https://openalex.org/W2185335522","https://openalex.org/W2187800770","https://openalex.org/W2191585270","https://openalex.org/W2288739150","https://openalex.org/W2489523766","https://openalex.org/W2543580944","https://openalex.org/W2594095402","https://openalex.org/W4231214146","https://openalex.org/W6622025086","https://openalex.org/W6639934517","https://openalex.org/W7042646231"],"related_works":["https://openalex.org/W2351868275","https://openalex.org/W2073781445","https://openalex.org/W2355013257","https://openalex.org/W2113650225","https://openalex.org/W1892318172","https://openalex.org/W2393398569","https://openalex.org/W2885991329","https://openalex.org/W4244439700","https://openalex.org/W4255726574","https://openalex.org/W2360484005"],"abstract_inverted_index":{"The":[0],"present":[1],"paper":[2],"considers":[3],"convergence":[4],"characteristics":[5],"of":[6,22,31,34,50,52],"the":[7,15,23,35,40,53],"particle":[8,36],"swarm":[9,37],"algorithm":[10,18,25,38,43,55],"and":[11,26,39],"its":[12],"modification":[13],"-":[14],"hybrid":[16],"PSO-GS":[17],"obtained":[19],"under":[20],"combination":[21],"PSO":[24,54],"Grid":[27],"Search":[28],"algorithm.":[29],"Comparison":[30],"quality":[32],"indices":[33],"steepest":[41],"descent":[42],"has":[44],"been":[45],"carried":[46],"out":[47],"for":[48],"evaluation":[49],"advantages":[51],"in":[56],"comparison":[57],"with":[58],"classical":[59],"optimization":[60],"algorithms.":[61]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}