{"id":"https://openalex.org/W2121589303","doi":"https://doi.org/10.1109/cec.2012.6256113","title":"A fast particle swarm optimization algorithm for the multidimensional knapsack problem","display_name":"A fast particle swarm optimization algorithm for the multidimensional knapsack problem","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2121589303","doi":"https://doi.org/10.1109/cec.2012.6256113","mag":"2121589303"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256113","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary 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/A5003490724","display_name":"Mohammad Reza Bonyadi","orcid":"https://orcid.org/0000-0003-0061-4902"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Mohammad Reza Bonyadi","raw_affiliation_strings":["Department of Computer Science, University of Adelaide, Adelaide, SA, Australia","Department of Computer Science, The University of Adelaide, SA 5005, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"Department of Computer Science, The University of Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072022501","display_name":"Zbigniew Michalewicz","orcid":"https://orcid.org/0000-0001-5609-5457"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Zbigniew Michalewicz","raw_affiliation_strings":["Department of Computer Science, University of Adelaide, Adelaide, SA, Australia","Department of Computer Science, The University of Adelaide, SA 5005, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Adelaide, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I5681781"]},{"raw_affiliation_string":"Department of Computer Science, The University of Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003490724"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.22464202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.991599977016449,"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/T12707","display_name":"Vehicle License Plate Recognition","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/knapsack-problem","display_name":"Knapsack problem","score":0.9475209712982178},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7543882131576538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6296058297157288},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.572097659111023},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5432381629943848},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4717610478401184},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.4572564661502838},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.4424511194229126},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.438210129737854},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.41029423475265503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22425499558448792}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9475209712982178},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7543882131576538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6296058297157288},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.572097659111023},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5432381629943848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4717610478401184},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.4572564661502838},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.4424511194229126},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.438210129737854},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.41029423475265503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22425499558448792}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cec.2012.6256113","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/74051","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/74051","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1109/cec.2012.6256113","raw_type":"Conference paper"},{"id":"pmh:oai:espace.library.uq.edu.au:UQ:396260","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402388","display_name":"Queensland's institutional digital repository (The University of Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165143802","host_organization_name":"The University of Queensland","host_organization_lineage":["https://openalex.org/I165143802"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W102487131","https://openalex.org/W254944847","https://openalex.org/W1549861824","https://openalex.org/W1586409345","https://openalex.org/W1970652116","https://openalex.org/W1972314001","https://openalex.org/W1986834168","https://openalex.org/W2010795210","https://openalex.org/W2011039300","https://openalex.org/W2017316844","https://openalex.org/W2021328726","https://openalex.org/W2024418868","https://openalex.org/W2030722793","https://openalex.org/W2045472634","https://openalex.org/W2049967755","https://openalex.org/W2102543230","https://openalex.org/W2108388069","https://openalex.org/W2111223279","https://openalex.org/W2119980860","https://openalex.org/W2146879413","https://openalex.org/W2152195021","https://openalex.org/W2165299997","https://openalex.org/W2169245194","https://openalex.org/W2171682893","https://openalex.org/W2395511881","https://openalex.org/W2402846924","https://openalex.org/W2543580944","https://openalex.org/W4252732074","https://openalex.org/W6684237752"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3169691842","https://openalex.org/W3166857172","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W1601835603","https://openalex.org/W1556368910"],"abstract_inverted_index":{"A":[0],"fast":[1],"particle":[2,77],"swarm":[3,78],"optimization":[4,79],"method":[5,157],"for":[6,73,180],"the":[7,16,26,33,38,42,51,54,60,85,94,105,120,148,155,175,181,185,192],"multidimensional":[8],"knapsack":[9],"problem":[10,39],"is":[11,65,81,158,177,189],"presented.":[12],"In":[13],"this":[14],"approach":[15,124],"potential":[17],"solutions":[18,163],"are":[19,117,135],"represented":[20],"by":[21,88,100],"vectors":[22],"of":[23,28,35,37,44,47,53,62,71,96,144,167,187,194],"real":[24],"values;":[25],"dimension":[27],"each":[29,63,74],"vector":[30],"corresponds":[31],"to":[32,67,83,93,160],"number":[34,43,186,193],"constraints":[36,188],"rather":[40],"than":[41,165,191],"items.":[45,195],"Each":[46],"these":[48,102],"values":[49],"measures":[50],"significance":[52],"corresponding":[55],"constraint":[56],"and,":[57],"together":[58],"with":[59,137],"value":[61],"item,":[64],"used":[66,82],"define":[68],"a":[69,109],"ratio":[70,95],"\u201cgoodness\u201d":[72],"item.":[75],"The":[76,122],"algorithm":[80,176],"find":[84,161],"best":[86],"profit":[87],"sorting":[89],"all":[90],"items":[91,103],"according":[92],"their":[97],"goodness":[98],"and":[99,113,132,147],"picking":[101],"in":[104,142,183],"sorted":[106],"order.":[107],"Also,":[108,170],"special":[110],"initialization":[111],"phase":[112,116],"an":[114],"improvement":[115],"incorporated":[118],"into":[119],"algorithm.":[121],"proposed":[123,156],"was":[125],"tested":[126],"on":[127],"several":[128],"standard":[129],"test":[130],"benchmarks":[131],"its":[133],"results":[134],"compared":[136],"some":[138],"other":[139,168],"heuristic":[140],"methods":[141],"terms":[143],"solution":[145],"quality":[146,162],"CPU":[149],"time.":[150],"These":[151],"comparisons":[152],"show":[153,173],"that":[154,174],"able":[159],"faster":[164],"most":[166],"methods.":[169],"our":[171],"experiments":[172],"more":[178],"efficient":[179],"problems":[182],"which":[184],"smaller":[190]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}