{"id":"https://openalex.org/W1996126443","doi":"https://doi.org/10.1109/icnc.2012.6234615","title":"New Particle Swarm Optimization algorithm for knapsack problem","display_name":"New Particle Swarm Optimization algorithm for knapsack problem","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W1996126443","doi":"https://doi.org/10.1109/icnc.2012.6234615","mag":"1996126443"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234615","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","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/A5057492228","display_name":"Ling Ouyang","orcid":null},"institutions":[{"id":"https://openalex.org/I132586189","display_name":"Zhongyuan University of Technology","ror":"https://ror.org/0360zcg91","country_code":"CN","type":"education","lineage":["https://openalex.org/I132586189"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ling Ouyang","raw_affiliation_strings":["Electrical Department, Zhongyuan University of Technology, Zhengzhou, China","[Electrical Department, Zhongyuan University of Technology, Zhengzhou, China]"],"affiliations":[{"raw_affiliation_string":"Electrical Department, Zhongyuan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I132586189"]},{"raw_affiliation_string":"[Electrical Department, Zhongyuan University of Technology, Zhengzhou, China]","institution_ids":["https://openalex.org/I132586189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034199636","display_name":"Dongyun Wang","orcid":"https://orcid.org/0000-0003-1042-6817"},"institutions":[{"id":"https://openalex.org/I132586189","display_name":"Zhongyuan University of Technology","ror":"https://ror.org/0360zcg91","country_code":"CN","type":"education","lineage":["https://openalex.org/I132586189"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dongyun Wang","raw_affiliation_strings":["Electrical Department, Zhongyuan University of Technology, Zhengzhou, China","[Electrical Department, Zhongyuan University of Technology, Zhengzhou, China]"],"affiliations":[{"raw_affiliation_string":"Electrical Department, Zhongyuan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I132586189"]},{"raw_affiliation_string":"[Electrical Department, Zhongyuan University of Technology, Zhengzhou, China]","institution_ids":["https://openalex.org/I132586189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057492228"],"corresponding_institution_ids":["https://openalex.org/I132586189"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.07604376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"786","last_page":"788"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983999729156494,"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.9983999729156494,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9806886315345764},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.8033086657524109},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6935653686523438},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.6546032428741455},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6495360732078552},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5421105623245239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.515826404094696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4955216646194458},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.47208094596862793},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.46525177359580994},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4534064829349518},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4219197630882263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3658860921859741}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9806886315345764},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.8033086657524109},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6935653686523438},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.6546032428741455},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6495360732078552},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5421105623245239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.515826404094696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4955216646194458},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.47208094596862793},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.46525177359580994},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4534064829349518},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4219197630882263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3658860921859741},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234615","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","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":11,"referenced_works":["https://openalex.org/W1580876177","https://openalex.org/W2109364787","https://openalex.org/W2115053914","https://openalex.org/W2116400650","https://openalex.org/W2135646341","https://openalex.org/W2152195021","https://openalex.org/W2170526082","https://openalex.org/W2349453249","https://openalex.org/W2354424531","https://openalex.org/W2373760145","https://openalex.org/W6677098786"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W2005493932","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2145407993","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"it":[3],"proposes":[4],"an":[5],"improved":[6,88],"Particle":[7],"Swarm":[8],"Optimization":[9],"(PSO)":[10],"algorithm":[11,18,25,89],"for":[12,26],"the":[13,22,28,45,49,53,60,64,68,71,75,77,87,96],"knapsack":[14,50,98],"problem.":[15,99],"The":[16,83],"new":[17],"is":[19,51,67,90],"based":[20],"on":[21],"standard":[23,31],"PSO":[24,32],"overcoming":[27],"shortcomings":[29],"that":[30,86],"traps":[33],"into":[34],"local":[35],"optima":[36],"easily":[37],"and":[38,92],"has":[39],"a":[40],"low":[41],"convergence":[42],"accuracy.":[43],"When":[44,59],"load-bearing":[46],"quantity":[47],"of":[48,63,74],"exceeded,":[52],"fitness":[54],"will":[55,80],"be":[56,81],"sit":[57],"zero.":[58],"best":[61,72],"position":[62,73,79],"individual":[65],"particle":[66],"same":[69],"with":[70],"population,":[76],"particle's":[78],"reinitialized.":[82],"simulation":[84],"shows":[85],"simple":[91],"effective":[93],"to":[94],"solve":[95],"small-scale":[97]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}