{"id":"https://openalex.org/W2517885257","doi":"https://doi.org/10.1109/icis.2016.7550941","title":"A diversity reserved quantum particle swarm optimization algorithm for MMKP","display_name":"A diversity reserved quantum particle swarm optimization algorithm for MMKP","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2517885257","doi":"https://doi.org/10.1109/icis.2016.7550941","mag":"2517885257"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2016.7550941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","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/A5072710254","display_name":"Hongbin Dong","orcid":"https://orcid.org/0000-0001-5046-1532"},"institutions":[{"id":"https://openalex.org/I151727225","display_name":"Harbin Engineering University","ror":"https://ror.org/03x80pn82","country_code":"CN","type":"education","lineage":["https://openalex.org/I151727225"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hongbin Dong","raw_affiliation_strings":["Computer Science and Technology College, Harbin Engineering University, Harbin, China"],"affiliations":[{"raw_affiliation_string":"Computer Science and Technology College, Harbin Engineering University, Harbin, China","institution_ids":["https://openalex.org/I151727225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114859142","display_name":"Xue Yang","orcid":"https://orcid.org/0000-0002-7929-1626"},"institutions":[{"id":"https://openalex.org/I151727225","display_name":"Harbin Engineering University","ror":"https://ror.org/03x80pn82","country_code":"CN","type":"education","lineage":["https://openalex.org/I151727225"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xue Yang","raw_affiliation_strings":["Computer Science and Technology College, Harbin Engineering University, Harbin, China"],"affiliations":[{"raw_affiliation_string":"Computer Science and Technology College, Harbin Engineering University, Harbin, China","institution_ids":["https://openalex.org/I151727225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048135942","display_name":"Xuyang Teng","orcid":"https://orcid.org/0000-0001-5484-9462"},"institutions":[{"id":"https://openalex.org/I151727225","display_name":"Harbin Engineering University","ror":"https://ror.org/03x80pn82","country_code":"CN","type":"education","lineage":["https://openalex.org/I151727225"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuyang Teng","raw_affiliation_strings":["Computer Science and Technology College, Harbin Engineering University, Harbin, China"],"affiliations":[{"raw_affiliation_string":"Computer Science and Technology College, Harbin Engineering University, Harbin, China","institution_ids":["https://openalex.org/I151727225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084054177","display_name":"Yuhai Sha","orcid":null},"institutions":[{"id":"https://openalex.org/I151727225","display_name":"Harbin Engineering University","ror":"https://ror.org/03x80pn82","country_code":"CN","type":"education","lineage":["https://openalex.org/I151727225"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuhai Sha","raw_affiliation_strings":["Computer Science and Technology College, Harbin Engineering University, Harbin, China"],"affiliations":[{"raw_affiliation_string":"Computer Science and Technology College, Harbin Engineering University, Harbin, China","institution_ids":["https://openalex.org/I151727225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5072710254"],"corresponding_institution_ids":["https://openalex.org/I151727225"],"apc_list":null,"apc_paid":null,"fwci":0.857,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84022829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"35","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983000159263611,"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.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8909848928451538},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6656357645988464},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6418834924697876},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6105983853340149},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.5497834086418152},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5319706797599792},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5145749449729919},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49855947494506836},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4858131408691406},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.479576051235199},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4746597111225128},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.45506900548934937},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.4296948313713074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42377611994743347},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4205765724182129},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41537630558013916}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8909848928451538},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6656357645988464},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6418834924697876},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6105983853340149},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.5497834086418152},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5319706797599792},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5145749449729919},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49855947494506836},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4858131408691406},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.479576051235199},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4746597111225128},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.45506900548934937},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.4296948313713074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42377611994743347},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4205765724182129},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41537630558013916},{"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icis.2016.7550941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W4608260","https://openalex.org/W98156974","https://openalex.org/W142750658","https://openalex.org/W1490182363","https://openalex.org/W1503898840","https://openalex.org/W1540850845","https://openalex.org/W1566399673","https://openalex.org/W1595074394","https://openalex.org/W2033108330","https://openalex.org/W2040332029","https://openalex.org/W2080988231","https://openalex.org/W2084794731","https://openalex.org/W2088495063","https://openalex.org/W2091599385","https://openalex.org/W2133745942","https://openalex.org/W2402846924","https://openalex.org/W2543580944","https://openalex.org/W6605791273","https://openalex.org/W6629184126","https://openalex.org/W7033674197"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W2799046353","https://openalex.org/W1984121220","https://openalex.org/W1556368910","https://openalex.org/W2900218461","https://openalex.org/W2222484777","https://openalex.org/W1601835603","https://openalex.org/W2098281589","https://openalex.org/W3155769677"],"abstract_inverted_index":{"As":[0,35],"a":[1,22,48,79,98,115],"variant":[2],"of":[3,28,37,97,123,140,149],"the":[4,8,25,38,52,61,67,95,102,107,111,121,128,138,147],"classical":[5],"knapsack":[6,11],"problem,":[7,24],"multi-dimension":[9],"multi-choice":[10],"problem":[12],"(MMKP)":[13],"is":[14,21,87,152],"widely":[15],"used":[16],"in":[17,33,89,154],"practical":[18],"applications.":[19],"It":[20],"NP-complete":[23],"exact":[26],"solution":[27],"MMKP":[29,86],"cannot":[30],"be":[31],"founded":[32],"polynomial-time.":[34],"one":[36],"heuristic":[39],"algorithms,":[40],"quantum":[41],"particle":[42,99],"swarm":[43],"optimization":[44],"(QPSO)":[45],"algorithm":[46,84,131],"provides":[47],"sight":[49],"to":[50,60,73,93,119],"get":[51],"approximately":[53],"optimal":[54],"result":[55],"for":[56,85],"MMKP.":[57],"However,":[58],"due":[59],"multiple":[62],"constraints":[63],"among":[64],"dimensions":[65],"and":[66,106,142],"dispersing":[68],"feasible":[69],"regions,":[70],"QPSO":[71,83],"tends":[72],"fall":[74],"into":[75],"local":[76,150],"convergence.":[77],"Hence":[78],"modified":[80],"diversity":[81,122],"reserved":[82],"proposed":[88,129],"this":[90],"paper:":[91],"(i)":[92],"measure":[94],"availability":[96],"by":[100],"comparing":[101],"position":[103,116],"between":[104],"itself":[105],"next":[108],"alternative":[109],"during":[110],"generation;":[112],"(ii)":[113],"import":[114],"disturbance":[117],"operator":[118],"increase":[120],"population.":[124],"Experiments":[125],"demonstrate":[126],"that":[127,146],"evolutionary":[130],"could":[132],"find":[133],"better":[134],"near-optimal":[135],"results.":[136],"And":[137],"analysis":[139],"convergence":[141,151],"execution":[143],"time":[144],"suggest":[145],"probability":[148],"declined":[153],"our":[155],"algorithm.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}