{"id":"https://openalex.org/W2352575332","doi":null,"title":"Binary improved particle swarm optimization algorithm for knapsack problem","display_name":"Binary improved particle swarm optimization algorithm for knapsack problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2352575332","mag":"2352575332"},"language":"en","primary_location":{"id":"mag:2352575332","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-HDGY200601007.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764529691","display_name":"Journal of the University of Shanghai for Science and Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4327872771","host_organization_name":"University of Shanghai for Science and Technology","host_organization_lineage":["https://openalex.org/P4327872771"],"host_organization_lineage_names":["University of Shanghai for Science and Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of the University of Shanghai for Science and Technology","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5100321566","display_name":"Shuang Zhang","orcid":"https://orcid.org/0000-0002-8314-9286","observed_orcids":["https://orcid.org/0000-0002-8314-9286","https://orcid.org/0009-0007-3731-6788"]},"institutions":[{"id":"https://openalex.org/I148128674","display_name":"University of Shanghai for Science and Technology","ror":"https://ror.org/00ay9v204","country_code":"CN","type":"education","lineage":["https://openalex.org/I148128674"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shuang Zhang","raw_affiliation_strings":["College of management, University of Shanghai for Science and Technology, Shanghai 200093,China"],"raw_orcid":"https://orcid.org/0000-0002-8314-9286","affiliations":[{"raw_affiliation_string":"College of management, University of Shanghai for Science and Technology, Shanghai 200093,China","institution_ids":["https://openalex.org/I148128674"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100321566"],"corresponding_institution_ids":["https://openalex.org/I148128674"],"apc_list":null,"apc_paid":null,"fwci":0.7071,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.77968589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9961000084877014,"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.9961000084877014,"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.003000000026077032,"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/T13371","display_name":"Military Defense Systems Analysis","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/binary-particle-swarm-optimization","display_name":"binary particle swarm optimization","score":0.9480000138282776},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"knapsack problem","score":1.0},{"id":"https://openalex.org/keywords/memory-mechanisms","display_name":"memory mechanisms","score":0.9729999899864197},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.7570000290870667},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"discrete optimization","score":0.9800000190734863},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.5400000214576721}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8928272724151611},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6055058836936951},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.6007301211357117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5941914319992065},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5829640626907349},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.5553426742553711},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5482526421546936},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5417178273200989},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.49020081758499146},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.48982760310173035},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48661527037620544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4796319603919983},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.47671693563461304},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4731539189815521},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.4680929481983185},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4138953685760498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36450403928756714},{"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2352575332","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-HDGY200601007.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764529691","display_name":"Journal of the University of Shanghai for Science and Technology","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4327872771","host_organization_name":"University of Shanghai for Science and Technology","host_organization_lineage":["https://openalex.org/P4327872771"],"host_organization_lineage_names":["University of Shanghai for Science and Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of the University of Shanghai for Science and Technology","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2143313202","https://openalex.org/W100554200","https://openalex.org/W2381376219","https://openalex.org/W2351531244","https://openalex.org/W2094859983","https://openalex.org/W2160694327","https://openalex.org/W2117563571","https://openalex.org/W1996126443","https://openalex.org/W2354559041","https://openalex.org/W4385988464"],"abstract_inverted_index":{"The":[0],"binary":[1,34],"improved":[2],"particle":[3],"swarm":[4],"optimization(PSO)":[5],"algorithm":[6,18,52,58,62,75],"for":[7],"knapsack":[8],"problem":[9],"is":[10,19,29,54],"brought":[11],"forward,and":[12],"the":[13,17,25,32,51,64,72],"detailed":[14],"realization":[15],"of":[16,66],"illustrated.In":[20],"order":[21],"to":[22,80],"speed":[23,70],"up":[24],"convergence,the":[26],"memory":[27],"mechanism":[28],"implanted":[30],"in":[31,37,63],"traditional":[33],"PSO.Some":[35],"examples":[36],"other":[38,81],"references":[39],"are":[40,45],"recomputed":[41],"and":[42,59,71],"both":[43],"results":[44],"compared.It":[46],"can":[47,77],"be":[48,78],"found":[49],"that":[50],"presented":[53],"better":[55],"than":[56],"genetic":[57],"simulated":[60],"annealing":[61],"ability":[65],"finding":[67],"optimal":[68],"value,the":[69],"computation":[73],"stability.The":[74],"proposed":[76],"applied":[79],"discrete":[82],"optimization":[83],"problems.":[84]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-11T09:32:39.932853","created_date":"2016-06-24T00:00:00"}