{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:29:01Z","timestamp":1768523341837,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,8,25]],"date-time":"2017-08-25T00:00:00Z","timestamp":1503619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61174124"],"award-info":[{"award-number":["61174124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61233003"],"award-info":[{"award-number":["61233003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673361"],"award-info":[{"award-number":["61673361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Doctoral Program of Higher Education of China","award":["20123402110029"],"award-info":[{"award-number":["20123402110029"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["JZ2015HGBZ0493"],"award-info":[{"award-number":["JZ2015HGBZ0493"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10489-017-1025-x","type":"journal-article","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T23:02:30Z","timestamp":1503615750000},"page":"1582-1595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["A modified artificial bee colony approach for the 0-1 knapsack problem"],"prefix":"10.1007","volume":"48","author":[{"given":"Jie","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoqun","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaonong","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"issue":"22","key":"1025_CR1","first-page":"11:042","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218(22):11:042\u201311:061","journal-title":"Appl Math Comput"},{"issue":"10","key":"1025_CR2","doi-asserted-by":"publisher","first-page":"12:415","DOI":"10.1016\/j.eswa.2011.04.022","volume":"38","author":"E Bas","year":"2011","unstructured":"Bas E (2011) A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0\u20131 bidimensional knapsack model. Expert Systems with Applications 38(10):12:415\u201312:422","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"1025_CR3","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0377-2217(03)00244-3","volume":"157","author":"A Billionnet","year":"2004","unstructured":"Billionnet A, Soutif \u00c9 (2004) An exact method based on lagrangian decomposition for the 0\u20131 quadratic knapsack problem. Eur J Oper Res 157(3):565\u2013575","journal-title":"Eur J Oper Res"},{"key":"1025_CR4","unstructured":"Chaharsooghi SK, Kermani AHM (2008) An intelligent multi-colony multi-objective ant colony optimization (aco) for the 0\u20131 knapsack problem. In: IEEE congress on evolutionary computation, 2008. CEC 2008. (IEEE world congress on computational intelligence). IEEE, pp 1195\u20131202"},{"issue":"20","key":"1025_CR5","first-page":"7423","volume":"11","author":"S Chen","year":"2015","unstructured":"Chen S, Gao C, Li X, Lu Y, Zhang Z (2015) A rank-based ant system algorithm for solving 0\/1 knapsack problem. J Comput Inf Syst 11(20):7423\u20137430","journal-title":"J Comput Inf Syst"},{"issue":"6","key":"1025_CR6","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1080\/18756891.2016.1256577","volume":"9","author":"Y Feng","year":"2016","unstructured":"Feng Y, Wang GG, Gao XZ (2016) A novel hybrid cuckoo search algorithm with global harmony search for 0-1 knapsack problems. Intern J Comput Intell Syst 9(6):1174\u20131190","journal-title":"Intern J Comput Intell Syst"},{"key":"1025_CR7","unstructured":"Feng Y, Yang J, Wu C, Lu M, Zhao XJ (2016) Solving 0\u20131 knapsack problems by chaotic monarch butterfly optimization algorithm with gaussian mutation. Memetic Computing, pp 1\u201316"},{"issue":"6","key":"1025_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec2005 special session on real parameter optimization. J Heuristics 15(6):617","journal-title":"J Heuristics"},{"key":"1025_CR9","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.ins.2016.01.090","volume":"348","author":"S Gheisari","year":"2016","unstructured":"Gheisari S, Meybodi M (2016) Bnc-pso: structure learning of bayesian networks by particle swarm optimization. Inf Sci 348:272\u2013289","journal-title":"Inf Sci"},{"issue":"6","key":"1025_CR10","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P Gilmore","year":"1966","unstructured":"Gilmore P, Gomory R (1966) The theory and computation of knapsack functions. Oper Res 14(6):1045\u20131074","journal-title":"Oper Res"},{"issue":"10","key":"1025_CR11","doi-asserted-by":"publisher","first-page":"4653","DOI":"10.1016\/j.eswa.2015.01.049","volume":"42","author":"B Haddar","year":"2015","unstructured":"Haddar B, Khemakhem M, Hanafi S, Wilbaut C (2015) A hybrid heuristic for the 0\u20131 knapsack sharing problem. Expert Syst Appl 42(10):4653\u20134666","journal-title":"Expert Syst Appl"},{"key":"1025_CR12","doi-asserted-by":"crossref","unstructured":"Ji J, Wei H, Liu C, Yin B (2013) Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem. Math Probl Eng, 2013","DOI":"10.1155\/2013\/676275"},{"key":"1025_CR13","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Tech. rep., Technical report-tr06, Erciyes university, engineering faculty, computer engineering department"},{"issue":"3","key":"1025_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"issue":"9","key":"1025_CR15","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"PJ Kolesar","year":"1967","unstructured":"Kolesar PJ (1967) A branch and bound algorithm for the knapsack problem. Manag Sci 13(9):723\u2013735","journal-title":"Manag Sci"},{"issue":"12","key":"1025_CR16","doi-asserted-by":"publisher","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"X Kong","year":"2015","unstructured":"Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst Appl 42(12):5337\u20135355","journal-title":"Expert Syst Appl"},{"key":"1025_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.asoc.2015.11.045","volume":"41","author":"J Lv","year":"2016","unstructured":"Lv J, Wang X, Huang M, Cheng H, Li F (2016) Solving 0-1 knapsack problem by greedy degree and expectation efficiency. Appl Soft Comput 41:94\u2013103","journal-title":"Appl Soft Comput"},{"key":"1025_CR18","doi-asserted-by":"crossref","unstructured":"Marinakis Y, Marinaki M, Matsatsinis N (2009) A hybrid discrete artificial bee colony-grasp algorithm for clustering. In: International conference on computers & industrial engineering, 2009. CIE 2009. IEEE, pp 548\u2013553","DOI":"10.1109\/ICCIE.2009.5223810"},{"issue":"3","key":"1025_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S Martello","year":"1977","unstructured":"Martello S, Toth P (1977) An upper bound for the zero-one knapsack problem and a branch and bound algorithm. Eur J Oper Res 1(3):169\u2013175","journal-title":"Eur J Oper Res"},{"key":"1025_CR20","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley"},{"issue":"3","key":"1025_CR21","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0-1 knapsack problem. Manag Sci 45(3):414\u2013424","journal-title":"Manag Sci"},{"issue":"5","key":"1025_CR22","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R Merkle","year":"1978","unstructured":"Merkle R, Hellman M (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24(5):525\u2013 530","journal-title":"IEEE Trans Inf Theory"},{"key":"1025_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili S, Lewis A (2013) S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1\u201314","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"1025_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"RM Nauss","year":"1976","unstructured":"Nauss RM (1976) An efficient algorithm for the 0-1 knapsack problem. Manag Sci 23(1):27\u201331","journal-title":"Manag Sci"},{"key":"1025_CR25","doi-asserted-by":"crossref","unstructured":"Nguyen BH, Xue B, Andreae P (2017) A novel binary particle swarm optimization algorithm and its applications on knapsack and feature selection problems. In: Proceedings of the intelligent and evolutionary systems: the 20th Asia Pacific symposium, IES 2016, Canberra, Australia, November 2016. Springer, pp 319\u2013 332","DOI":"10.1007\/978-3-319-49049-6_23"},{"key":"1025_CR26","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ins.2014.10.060","volume":"297","author":"C Ozturk","year":"2015","unstructured":"Ozturk C, Hancer E, Karaboga D (2015) A novel binary artificial bee colony algorithm based on genetic operators. Inf Sci 297:154\u2013170","journal-title":"Inf Sci"},{"key":"1025_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.swevo.2016.02.006","volume":"29","author":"R Pavithr","year":"2016","unstructured":"Pavithr R et al (2016) Quantum inspired social evolution (qse) algorithm for 0-1 knapsack problem. Swarm Evol Comput 29:33\u201346","journal-title":"Swarm Evol Comput"},{"issue":"10","key":"1025_CR28","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1016\/j.cor.2009.12.006","volume":"37","author":"S Peeta","year":"2010","unstructured":"Peeta S, Salman FS, Gunnec D, Viswanath K (2010) Pre-disaster investment decisions for strengthening a highway network. Comput Oper Res 37(10):1708\u20131719","journal-title":"Comput Oper Res"},{"key":"1025_CR29","doi-asserted-by":"crossref","unstructured":"Peng C, Jian L, Zhiming L (2008) Solving 0-1 knapsack problems by a discrete binary version of differential evolution. In: Second international symposium on intelligent information technology application, 2008. IITA\u201908, vol 2. IEEE, pp 513\u2013516","DOI":"10.1109\/IITA.2008.538"},{"issue":"11","key":"1025_CR30","doi-asserted-by":"publisher","first-page":"2056","DOI":"10.1111\/risa.12036","volume":"33","author":"GL Reniers","year":"2013","unstructured":"Reniers GL, S\u00f6rensen K (2013) An approach for optimal allocation of safety resources: Using the knapsack problem to take aggregated cost-efficient preventive measures. Risk Anal 33(11):2056\u20132067","journal-title":"Risk Anal"},{"key":"1025_CR31","doi-asserted-by":"crossref","unstructured":"Shi H (2006) Solution to 0\/1 knapsack problem based on improved ant colony algorithm. In: 2006 IEEE international conference on information acquisition. IEEE, pp 1062\u20131066","DOI":"10.1109\/ICIA.2006.305887"},{"issue":"4","key":"1025_CR32","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","journal-title":"J Glob Optim"},{"key":"1025_CR33","doi-asserted-by":"crossref","unstructured":"Sundar S, Singh A, Rossi A (2010) An artificial bee colony algorithm for the 0\u20131 multidimensional knapsack problem. In: International conference on contemporary computing. Springer, pp 141\u2013151","DOI":"10.1007\/978-3-642-14834-7_14"},{"key":"1025_CR34","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Pan QK, Liang YC, Suganthan PN (2007) A discrete differential evolution algorithm for the total earliness and tardiness penalties with a common due year on a single-machine. In: 2007 IEEE symposium on computational intelligence in scheduling. IEEE, pp 271\u2013278","DOI":"10.1109\/SCIS.2007.367701"},{"issue":"8","key":"1025_CR35","first-page":"1987","volume":"10","author":"N Tian","year":"2016","unstructured":"Tian N, Wang M, Gu Y (2016) An improved binary particle swarm optimization for 0-1 knapsack problem. ICIC Express Letters 10(8):1987\u20131994","journal-title":"ICIC Express Letters"},{"issue":"1","key":"1025_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02243880","volume":"25","author":"P Toth","year":"1980","unstructured":"Toth P (1980) Dynamic programming algorithms for the zero-one knapsack problem. Computing 25(1):29\u201345","journal-title":"Computing"},{"key":"1025_CR37","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.endm.2014.11.035","volume":"47","author":"S Toumi","year":"2015","unstructured":"Toumi S, Cheikh M, Jarboui B (2015) 0\u20131 quadratic knapsack problem solved with vns algorithm. Electron Notes Discrete Math 47:269\u2013276","journal-title":"Electron Notes Discrete Math"},{"issue":"2","key":"1025_CR38","first-page":"1","volume":"6","author":"DC Tran","year":"2014","unstructured":"Tran DC, Wu Z (2014) New approaches of binary artificial bee colony algorithm for solving 0-1 knapsack problem. Adv Inf Sci Serv Sci 6(2):1","journal-title":"Adv Inf Sci Serv Sci"},{"key":"1025_CR39","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.knosys.2014.11.018","volume":"74","author":"DH Tran","year":"2015","unstructured":"Tran DH, Cheng MY, Cao MT (2015) Hybrid multiple objective artificial bee colony with differential evolution for the time\u2013cost\u2013quality tradeoff problem. Knowl-Based Syst 74:176\u2013186","journal-title":"Knowl-Based Syst"},{"issue":"22","key":"1025_CR40","first-page":"464","volume":"4","author":"L Wei","year":"2012","unstructured":"Wei L, Ben N, Hanning C (2012) Binary artificial bee colony algorithm for solving 0-1 knapsack problem. Adv Inf Sci Serv Sci 4(22):464\u2013470","journal-title":"Adv Inf Sci Serv Sci"},{"key":"1025_CR41","doi-asserted-by":"crossref","unstructured":"Zhao J, Huang T, Pang F, Liu Y (2009) Genetic algorithm based on greedy strategy in the 0-1 knapsack problem. In: 3rd international conference on genetic and evolutionary computing, 2009. WGEC\u201909. IEEE, pp 105\u2013107","DOI":"10.1109\/WGEC.2009.43"},{"key":"1025_CR42","unstructured":"Zhou Y, Bao Z, Luo Q, Zhang S (2016) A complex-valued encoding wind driven optimization for the 0-1 knapsack problem. Appl Intell, pp 1\u201319"},{"key":"1025_CR43","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0-1 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1025_CR44","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556\u20131564","journal-title":"Appl Soft Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-1025-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1025-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1025-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T07:22:16Z","timestamp":1583220136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-1025-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,25]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["1025"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-1025-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,25]]},"assertion":[{"value":"25 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}