{"id":"https://openalex.org/W2804449892","doi":"https://doi.org/10.1080/0952813x.2018.1467491","title":"Novel algorithms of particle swarm optimisation with decision criteria","display_name":"Novel algorithms of particle swarm optimisation with decision criteria","publication_year":2018,"publication_date":"2018-05-16","ids":{"openalex":"https://openalex.org/W2804449892","doi":"https://doi.org/10.1080/0952813x.2018.1467491","mag":"2804449892"},"language":"en","primary_location":{"id":"doi:10.1080/0952813x.2018.1467491","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2018.1467491","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-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/A5068624735","display_name":"Bo\u017cena Borowska","orcid":"https://orcid.org/0000-0001-7640-5782"},"institutions":[{"id":"https://openalex.org/I188884621","display_name":"Lodz University of Technology","ror":"https://ror.org/00s8fpf52","country_code":"PL","type":"education","lineage":["https://openalex.org/I188884621"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Bo\u017cena Borowska","raw_affiliation_strings":["Institute of Information Technology, Lodz University of Technology, Lodz, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Information Technology, Lodz University of Technology, Lodz, Poland","institution_ids":["https://openalex.org/I188884621"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068624735"],"corresponding_institution_ids":["https://openalex.org/I188884621"],"apc_list":null,"apc_paid":null,"fwci":0.3257,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66221664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"21"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9905999898910522,"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/T13717","display_name":"Advanced Algorithms and Applications","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7671948671340942},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7416272163391113},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6386739611625671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6060356497764587},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5911726951599121},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.5158771276473999},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45224297046661377},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4521990418434143},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.41130298376083374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14716631174087524}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7671948671340942},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7416272163391113},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6386739611625671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6060356497764587},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5911726951599121},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.5158771276473999},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45224297046661377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4521990418434143},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.41130298376083374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14716631174087524},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0952813x.2018.1467491","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2018.1467491","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W126893960","https://openalex.org/W576725583","https://openalex.org/W749625084","https://openalex.org/W972907206","https://openalex.org/W1858731859","https://openalex.org/W1975371461","https://openalex.org/W1978269173","https://openalex.org/W1982224715","https://openalex.org/W1990461003","https://openalex.org/W1991735480","https://openalex.org/W2001647817","https://openalex.org/W2003625598","https://openalex.org/W2020332124","https://openalex.org/W2028041748","https://openalex.org/W2030614909","https://openalex.org/W2039552285","https://openalex.org/W2048765701","https://openalex.org/W2052091585","https://openalex.org/W2055562594","https://openalex.org/W2056610867","https://openalex.org/W2057163815","https://openalex.org/W2062711254","https://openalex.org/W2066067865","https://openalex.org/W2069878088","https://openalex.org/W2081749411","https://openalex.org/W2096835977","https://openalex.org/W2102660810","https://openalex.org/W2111393363","https://openalex.org/W2133152516","https://openalex.org/W2138052361","https://openalex.org/W2157470389","https://openalex.org/W2169245194","https://openalex.org/W2183843206","https://openalex.org/W2220913511","https://openalex.org/W2519108118","https://openalex.org/W4213080970","https://openalex.org/W4241857177","https://openalex.org/W4298110920"],"related_works":["https://openalex.org/W42170614","https://openalex.org/W2070977815","https://openalex.org/W2241084252","https://openalex.org/W1934426788","https://openalex.org/W10394924","https://openalex.org/W2364947648","https://openalex.org/W2568269143","https://openalex.org/W2379567910","https://openalex.org/W1959298326","https://openalex.org/W2391178530"],"abstract_inverted_index":{"The":[0],"particle":[1,68],"swarm":[2],"optimisation":[3,8,24],"(PSO)":[4],"is":[5,81,90],"a":[6],"stochastic,":[7],"technique":[9],"based":[10],"on":[11],"the":[12,50,56,63,78,84,87,100,104],"movement":[13],"and":[14,28,40,55,77,120],"intelligence":[15],"of":[16,45,52,73,117],"swarms.":[17],"In":[18,62],"this":[19],"paper,":[20],"three":[21],"new":[22,64],"effective":[23],"algorithms":[25,101],"BPSO,":[26],"HPSO":[27],"WPSO,":[29],"by":[30],"incorporating":[31],"some":[32],"decision":[33,85,105],"criteria":[34,86,106],"into":[35],"PSO,":[36],"have":[37,107],"been":[38,108],"proposed":[39],"analysed":[41],"both":[42],"in":[43,102,115],"terms":[44,116],"their":[46,118],"efficiency,":[47],"resistance":[48],"to":[49,58],"problem":[51],"premature":[53],"convergence":[54],"ability":[57],"avoid":[59],"local":[60],"optima.":[61],"algorithms,":[65],"for":[66,93],"each":[67],"except":[69],"position,":[70],"two":[71],"sets":[72],"velocities":[74],"are":[75,110],"generated":[76],"profit":[79],"matrix":[80],"constructed.":[82],"Using":[83],"best":[88],"strategy":[89],"selected.":[91],"Simulations":[92],"benchmark":[94],"test":[95],"nonlinear":[96],"function":[97],"show":[98],"that":[99],"which":[103],"applied,":[109],"beneficial":[111],"over":[112],"classical":[113],"PSO":[114],"performance":[119],"efficiency.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}