{"id":"https://openalex.org/W1965902053","doi":"https://doi.org/10.7148/2009-0093-0098","title":"Solving A Multi-Dimensional Knapsack Problem Using A Hybrid Particle Swarm Optimization Algorithm","display_name":"Solving A Multi-Dimensional Knapsack Problem Using A Hybrid Particle Swarm Optimization Algorithm","publication_year":2009,"publication_date":"2009-06-09","ids":{"openalex":"https://openalex.org/W1965902053","doi":"https://doi.org/10.7148/2009-0093-0098","mag":"1965902053"},"language":"en","primary_location":{"id":"doi:10.7148/2009-0093-0098","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2009-0093-0098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2009 Proceedings edited by J. Otamendi, A. Bargiela, J. L. Montes, L. M. Doncel Pedrera","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/A5054876602","display_name":"Nam Fai Wan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nam Fai Wan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012562282","display_name":"Lars Nolle","orcid":null},"institutions":[{"id":"https://openalex.org/I52590639","display_name":"Nottingham Trent University","ror":"https://ror.org/04xyxjd90","country_code":"GB","type":"education","lineage":["https://openalex.org/I52590639"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Lars Nolle","raw_affiliation_strings":["Nottingham Trent University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nottingham Trent University","institution_ids":["https://openalex.org/I52590639"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.05706333,"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":"93","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14082","display_name":"Modeling, Simulation, and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14082","display_name":"Modeling, Simulation, and Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9128999710083008,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.845831573009491},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7533289790153503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6088507175445557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6074987649917603},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5698839426040649},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5465694069862366},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5287111401557922},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5100303292274475},{"id":"https://openalex.org/keywords/imperialist-competitive-algorithm","display_name":"Imperialist competitive algorithm","score":0.4594349265098572},{"id":"https://openalex.org/keywords/test-suite","display_name":"Test suite","score":0.4148210883140564},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.4147578775882721},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2544197738170624},{"id":"https://openalex.org/keywords/test-case","display_name":"Test case","score":0.25387638807296753},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.11170613765716553},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.1038796603679657},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.0654861330986023}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.845831573009491},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7533289790153503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6088507175445557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6074987649917603},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5698839426040649},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5465694069862366},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5287111401557922},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5100303292274475},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.4594349265098572},{"id":"https://openalex.org/C151552104","wikidata":"https://www.wikidata.org/wiki/Q7705809","display_name":"Test suite","level":4,"score":0.4148210883140564},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.4147578775882721},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2544197738170624},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.25387638807296753},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.11170613765716553},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.1038796603679657},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0654861330986023},{"id":"https://openalex.org/C152877465","wikidata":"https://www.wikidata.org/wiki/Q208042","display_name":"Regression analysis","level":2,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7148/2009-0093-0098","is_oa":false,"landing_page_url":"https://doi.org/10.7148/2009-0093-0098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ECMS 2009 Proceedings edited by J. Otamendi, A. Bargiela, J. L. Montes, L. M. Doncel Pedrera","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/W1586409345","https://openalex.org/W1594945786","https://openalex.org/W1968375151","https://openalex.org/W1994210759","https://openalex.org/W2027045220","https://openalex.org/W2066671865","https://openalex.org/W2123826923","https://openalex.org/W2125213524","https://openalex.org/W2134437265","https://openalex.org/W2152195021","https://openalex.org/W4285719527"],"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,99],"paper,":[2],"an":[3,93],"optimisation":[4],"technique":[5],"based":[6],"on":[7,55],"the":[8,18,23,29,47,61,82,86,96],"Particle":[9],"Swarm":[10],"Optimization":[11],"(PSO)":[12],"algorithm":[13,32,42,48,62,83],"will":[14],"be":[15,106],"experimented":[16],"upon":[17,108],"Multi-dimensional":[19],"Knapsack":[20],"Problem.":[21],"Through":[22],"merging":[24],"of":[25,28,36,90,98],"fundamental":[26],"concepts":[27],"existing":[30],"PSO":[31],"and":[33],"selected":[34],"features":[35],"evolutionary":[37],"algorithms,":[38],"a":[39,50],"novel":[40],"hybrid":[41],"is":[43,63,84],"created.":[44],"When":[45],"testing":[46],"against":[49],"test":[51],"suite":[52],"publicly":[53],"available":[54,73],"OR-LIB,":[56],"it":[57],"was":[58],"discovered":[59,75],"that":[60],"able":[64],"to":[65,71,105],"locate":[66],"fitness":[67],"values":[68],"very":[69,87],"close":[70],"best":[72],"results":[74],"using":[76],"Linear":[77],"Programming":[78],"techniques,":[79],"even":[80],"though":[81],"at":[85],"early":[88],"stage":[89],"development.":[91],"Such":[92],"observation":[94],"reveals":[95],"potential":[97],"algorithm,":[100],"calling":[101],"for":[102],"further":[103],"research":[104],"made":[107],"it.":[109]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}