{"id":"https://openalex.org/W2051225371","doi":"https://doi.org/10.1109/icnc.2014.6975886","title":"Cellular competitive decision algorithm for binary knapsack problem","display_name":"Cellular competitive decision algorithm for binary knapsack problem","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2051225371","doi":"https://doi.org/10.1109/icnc.2014.6975886","mag":"2051225371"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2014.6975886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2014.6975886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Natural Computation (ICNC)","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":null,"display_name":"Xiaohua Xiong","orcid":null},"institutions":[{"id":"https://openalex.org/I135905480","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64","country_code":"CN","type":"education","lineage":["https://openalex.org/I135905480"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaohua Xiong","raw_affiliation_strings":["College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China","[College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China]"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China","institution_ids":["https://openalex.org/I135905480"]},{"raw_affiliation_string":"[College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China]","institution_ids":["https://openalex.org/I135905480"]}]},{"author_position":"last","author":{"id":null,"display_name":"Aibing Ning","orcid":null},"institutions":[{"id":"https://openalex.org/I135905480","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64","country_code":"CN","type":"education","lineage":["https://openalex.org/I135905480"]},{"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":false,"raw_author_name":"Aibing Ning","raw_affiliation_strings":["College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China","School of Management, University of Shanghai for Science and Technology , Shanghai, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information, Shanghai Second Polytechnic University, Shanghai, China","institution_ids":["https://openalex.org/I135905480"]},{"raw_affiliation_string":"School of Management, University of Shanghai for Science and Technology , Shanghai, China","institution_ids":["https://openalex.org/I148128674"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135905480"],"apc_list":null,"apc_paid":null,"fwci":0.624,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.75784191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":null,"first_page":"503","last_page":"507"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9977999925613403,"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.9897504448890686},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7727819085121155},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6409995555877686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5835698246955872},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.558026909828186},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5574889183044434},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5448195934295654},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5334019660949707},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5289556980133057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4894479811191559},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.47245457768440247},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.452285498380661},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.4512667655944824},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4344303607940674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3638876974582672}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9897504448890686},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7727819085121155},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6409995555877686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5835698246955872},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.558026909828186},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5574889183044434},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5448195934295654},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5334019660949707},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5289556980133057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4894479811191559},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47245457768440247},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.452285498380661},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.4512667655944824},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4344303607940674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3638876974582672},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2014.6975886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2014.6975886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Natural Computation (ICNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320329022","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1513303009","https://openalex.org/W1530657679","https://openalex.org/W1972746086","https://openalex.org/W2045625203","https://openalex.org/W2056380589","https://openalex.org/W2082351821","https://openalex.org/W2390281937","https://openalex.org/W3216829238","https://openalex.org/W4205636972","https://openalex.org/W4252095619","https://openalex.org/W6630739389","https://openalex.org/W6804939965"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2005493932","https://openalex.org/W2412614002","https://openalex.org/W2020081923","https://openalex.org/W1538797328","https://openalex.org/W2993365626","https://openalex.org/W2087209118","https://openalex.org/W2076844787","https://openalex.org/W1985289934","https://openalex.org/W2361806215"],"abstract_inverted_index":{"Classical":[0],"binary":[1,89,104,114],"or":[2],"0-1":[3],"knapsack":[4,90,105,115],"problem":[5,23,83,91,106],"is":[6,24,50,56,74,107,145],"one":[7],"of":[8,21,67,72,82,88,98,113,125,137,156],"the":[9,18,68,79,96,111,121,126,135,142,157],"most":[10,69],"widely":[11],"studied":[12],"problems":[13],"in":[14],"combinatorial":[15,60],"optimization.":[16],"Though":[17],"optimization":[19],"version":[20],"this":[22],"NP-hard,":[25],"practical":[26],"solution":[27],"techniques":[28],"don't":[29],"require":[30],"optimality.":[31],"Many":[32],"different":[33],"heuristics":[34],"and":[35,123,154],"approximation":[36],"algorithms":[37],"have":[38],"been":[39],"used":[40],"to":[41,76,94,119,133,150],"solve":[42],"t":[43],"it.":[44],"Cellular":[45],"competitive":[46],"decision":[47],"algorithm":[48,144],"(CCDA)":[49],"a":[51,101],"heuristic":[52],"proposed":[53,143],"recently,":[54],"which":[55],"good":[57],"at":[58],"solving":[59],"problems,":[61],"especially":[62],"those":[63],"NP-hard":[64],"problems.":[65],"One":[66],"obvious":[70],"features":[71],"CCDA":[73,102],"easy":[75],"integrate":[77],"with":[78,148],"mathematical":[80,86],"properties":[81,87],"itself.":[84],"Firstly,":[85],"are":[92],"analyzed":[93],"reduce":[95],"scale":[97],"problem.":[99,116],"Then":[100],"for":[103],"presented":[108],"based":[109],"on":[110],"feature":[112],"In":[117],"addition":[118],"validate":[120],"effect":[122],"efficiency":[124],"algorithm,":[127],"we":[128],"conducted":[129],"many":[130],"computational":[131],"investigations":[132],"verify":[134],"feasibility":[136],"CCDA.":[138],"The":[139],"results":[140],"suggest":[141],"extremely":[146],"well":[147],"regard":[149],"both":[151],"running":[152],"time":[153],"quality":[155],"solutions":[158],"found.":[159]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}