{"id":"https://openalex.org/W1980766827","doi":"https://doi.org/10.1109/grc.2009.5255064","title":"Multi-objective particle swarm optimization algorithm for engineering constrained optimization problems","display_name":"Multi-objective particle swarm optimization algorithm for engineering constrained optimization problems","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W1980766827","doi":"https://doi.org/10.1109/grc.2009.5255064","mag":"1980766827"},"language":"en","primary_location":{"id":"doi:10.1109/grc.2009.5255064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2009.5255064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Granular Computing","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/A5109105801","display_name":"Dekun Tan","orcid":null},"institutions":[{"id":"https://openalex.org/I141103825","display_name":"Nanchang Institute of Technology","ror":"https://ror.org/00avfj807","country_code":"CN","type":"education","lineage":["https://openalex.org/I141103825"]},{"id":"https://openalex.org/I4210120015","display_name":"Nanchang Institute of Science & Technology","ror":"https://ror.org/02q5y6156","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210120015"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dekun Tan","raw_affiliation_strings":["Department of Computer Science & Technology, Nanchang Institute of Technology, Nanchang, Jiangxi, China","Department of Computer Science & Technology, Nanchang Institute of Technology, Jiangxi Province, China 330099"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Technology, Nanchang Institute of Technology, Nanchang, Jiangxi, China","institution_ids":["https://openalex.org/I4210120015","https://openalex.org/I141103825"]},{"raw_affiliation_string":"Department of Computer Science & Technology, Nanchang Institute of Technology, Jiangxi Province, China 330099","institution_ids":["https://openalex.org/I141103825"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Wenhai Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I141103825","display_name":"Nanchang Institute of Technology","ror":"https://ror.org/00avfj807","country_code":"CN","type":"education","lineage":["https://openalex.org/I141103825"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenhai Luo","raw_affiliation_strings":["Department of Civil Engineering & Architecture, Nanchang Institute of Technology, Nanchang, Jiangxi, China","Department of Civil Engineering & Architecture, Nanchang Institute of Technology, Jiangxi Province, China 330099"],"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering & Architecture, Nanchang Institute of Technology, Nanchang, Jiangxi, China","institution_ids":["https://openalex.org/I141103825"]},{"raw_affiliation_string":"Department of Civil Engineering & Architecture, Nanchang Institute of Technology, Jiangxi Province, China 330099","institution_ids":["https://openalex.org/I141103825"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087872098","display_name":"Qing Liu","orcid":"https://orcid.org/0000-0003-2745-3440"},"institutions":[{"id":"https://openalex.org/I141649914","display_name":"Nanchang University","ror":"https://ror.org/042v6xz23","country_code":"CN","type":"education","lineage":["https://openalex.org/I141649914"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qing Liu","raw_affiliation_strings":["School of Information Engineering, University of Nanchang, Nanchang, Jiangxi, China","School of Information Engineering, Nanchang University, Jiangxi Province, China 330046"],"affiliations":[{"raw_affiliation_string":"School of Information Engineering, University of Nanchang, Nanchang, Jiangxi, China","institution_ids":["https://openalex.org/I141649914"]},{"raw_affiliation_string":"School of Information Engineering, Nanchang University, Jiangxi Province, China 330046","institution_ids":["https://openalex.org/I141649914"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109105801"],"corresponding_institution_ids":["https://openalex.org/I141103825","https://openalex.org/I4210120015"],"apc_list":null,"apc_paid":null,"fwci":1.0602,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.75889222,"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":"523","last_page":"528"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9997000098228455,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.7907180190086365},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7793326377868652},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7654812335968018},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.7480840682983398},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.7030615210533142},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5814878344535828},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5806156396865845},{"id":"https://openalex.org/keywords/imperialist-competitive-algorithm","display_name":"Imperialist competitive algorithm","score":0.5491696000099182},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5099879503250122},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5085581541061401},{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"Derivative-free optimization","score":0.49383243918418884},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45215556025505066},{"id":"https://openalex.org/keywords/engineering-optimization","display_name":"Engineering optimization","score":0.44500941038131714},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4327147901058197},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4277886152267456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.372952938079834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2744975984096527}],"concepts":[{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.7907180190086365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7793326377868652},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7654812335968018},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.7480840682983398},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.7030615210533142},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5814878344535828},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5806156396865845},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.5491696000099182},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5099879503250122},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5085581541061401},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.49383243918418884},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45215556025505066},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.44500941038131714},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4327147901058197},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4277886152267456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.372952938079834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2744975984096527},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/grc.2009.5255064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/grc.2009.5255064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Granular Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324827","display_name":"Mutuelle G\u00e9n\u00e9rale de l'Education Nationale","ror":"https://ror.org/029vj4k86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2079676794","https://openalex.org/W2109364787","https://openalex.org/W2110673081","https://openalex.org/W2320902319","https://openalex.org/W2356093689","https://openalex.org/W2368335624"],"related_works":["https://openalex.org/W2113650225","https://openalex.org/W2393398569","https://openalex.org/W2351868275","https://openalex.org/W2885991329","https://openalex.org/W2391889613","https://openalex.org/W2371869200","https://openalex.org/W2893292693","https://openalex.org/W2355013257","https://openalex.org/W2353640252","https://openalex.org/W2107369277"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3],"modified":[4],"particle":[5,99],"swarm":[6,100],"optimization":[7,11,88,101,111],"algorithm":[8,102,121],"for":[9],"engineering":[10,86],"problems":[12],"with":[13,114],"constraints,":[14],"in":[15,68],"which":[16,76],"the":[17,23,29,33,46,51,62,69,79,93,97,108,119],"penalty":[18],"function":[19],"is":[20,90],"employed":[21],"to":[22,39,44,106],"traditional":[24],"PSO":[25,41],"algorithm,":[26],"and":[27,36,92,126],"at":[28],"same":[30],"time":[31],"adjusts":[32],"personal":[34],"optimum":[35,38],"global":[37],"make":[40],"being":[42],"able":[43],"solve":[45,107],"non-linear":[47],"programming":[48],"problems,":[49],"then":[50],"multi-objective":[52,98,109],"problem":[53,89],"can":[54,103,122],"be":[55,104],"converted":[56],"into":[57],"single":[58],"objective":[59],"problem.":[60,112],"Moreover,":[61],"constraint":[63,80],"term":[64],"played":[65],"its":[66],"role":[67],"process":[70],"of":[71],"generating":[72],"particles,":[73],"those":[74],"pariticles":[75],"don't":[77],"meet":[78],"condition":[81],"are":[82],"eliminated.":[83],"The":[84],"actual":[85],"design":[87],"tested":[91],"results":[94],"show":[95],"that":[96,118],"used":[105],"constrained":[110],"Comparison":[113],"Genetic":[115],"Algorithm":[116],"confirms":[117],"proposed":[120],"find":[123],"better":[124],"solutions,":[125],"converge":[127],"quickly.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}