{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T12:48:18Z","timestamp":1776775698301,"version":"3.51.2"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T00:00:00Z","timestamp":1591315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["F2016403055"],"award-info":[{"award-number":["F2016403055"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10489-020-01722-3","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T11:04:14Z","timestamp":1591355054000},"page":"3350-3366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["A novel discrete whale optimization algorithm for solving knapsack problems"],"prefix":"10.1007","volume":"50","author":[{"given":"Ya","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yichao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuejing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zewen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"key":"1722_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Berlin, Springer"},{"key":"1722_CR2","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller REThatcher JW (ed) Proc. of the complexity of computer computations. Plenum Press, New York, pp 110\u2013137","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1722_CR3","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York"},{"issue":"2","key":"1722_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.knosys.2013.04.003","volume":"48","author":"L Wang","year":"2013","unstructured":"Wang L, Zheng XL, Wang SY (2013) A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowledge-Based Systems 48(2):17\u201323","journal-title":"Knowledge-Based Systems"},{"key":"1722_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.swevo.2015.09.005","volume":"26","author":"C Patvardhan","year":"2016","unstructured":"Patvardhan C, Bansal S, Srivastav A (2016) Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. Swarm & Evolutionary Computation 26:175\u2013190","journal-title":"Swarm & Evolutionary Computation"},{"issue":"1","key":"1722_CR6","first-page":"77","volume":"78","author":"H Yichao","year":"2018","unstructured":"Yichao H, Haoran X, Tak-Lam W, Xizhao W (2018) A novel binary artificial bee colony algorithm for the set-union knapsack problem. Future Generation Computer Systems 78(1):77\u201386","journal-title":"Future Generation Computer Systems"},{"key":"1722_CR7","volume-title":"Minimal algorithm for the bounded knapsack problem, integer programming and combinatorial optimization","author":"DA Pisinger","year":"1995","unstructured":"Pisinger DA (1995) Minimal algorithm for the bounded knapsack problem, integer programming and combinatorial optimization. Springer, Berlin"},{"key":"1722_CR8","unstructured":"Guldan B (2007) Heuristic and exact algorithms for discounted knapsack problems. Master thesis, University of Erlangen-Nnberg, Germany"},{"issue":"1","key":"1722_CR9","first-page":"256","volume":"s1-28","author":"GB Mathews","year":"1988","unstructured":"Mathews GB (1988) On the partition of numbers. Proceedings of the London Mathematical Society s1-28 (1):256\u2013282","journal-title":"Proceedings of the London Mathematical Society"},{"key":"1722_CR10","first-page":"2614","volume":"12","author":"H Yichao","year":"2016","unstructured":"Yichao H, Xizhao W, Wenbin L, Xinlu Z, YiYing C (2016) Research on genetic algorithm for discounted {0-1} knapsack problem. Chinese Journal of Computers 12:2614\u20132630","journal-title":"Chinese Journal of Computers"},{"key":"1722_CR11","first-page":"1314","volume":"12","author":"H JinSong","year":"1999","unstructured":"JinSong H, GuoLiang C, GuangCan G (1999) Solving the 0\/1-knapsack problem on quantum computer. Chinese Journal of Computers 12:1314\u20131316","journal-title":"Chinese Journal of Computers"},{"key":"1722_CR12","first-page":"359","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. Cambridge, MIT Press, pp 359\u2013403","edition":"2nd edn."},{"issue":"4","key":"1722_CR13","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM 22(4):463\u2013468","journal-title":"Journal of the ACM"},{"key":"1722_CR14","volume-title":"Randomized algorithms","author":"AMH Rajeev","year":"1995","unstructured":"Rajeev AMH (1995) Randomized algorithms. Cambridge University Press, Cambridge"},{"key":"1722_CR15","volume-title":"Design and analysis of approximation algorithms","author":"D-Z Du","year":"2012","unstructured":"Du D-Z, Ko K-I, Hu X (2012) Design and analysis of approximation algorithms. Springer, New York"},{"issue":"2","key":"1722_CR16","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.amc.2006.09.020","volume":"187","author":"M Darehmiraki","year":"2007","unstructured":"Darehmiraki M, Nehi HM (2007) Molecular solution to the 0-1 knapsack problem based on DNA computing. Applied Mathematics & Computation 187(2):1033\u20131037","journal-title":"Applied Mathematics & Computation"},{"issue":"12","key":"1722_CR17","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.3724\/SP.J.1016.2008.02207","volume":"31","author":"Y Zhu","year":"2009","unstructured":"Zhu Y, Ren LH, Ding YS, et al. (2009) DNA ligation design and biological realization of knapsack problem. Chinese Journal of Computers 31(12):2207\u20132214","journal-title":"Chinese Journal of Computers"},{"issue":"1","key":"1722_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"2014","unstructured":"Michalewicz Z, Schoenauer M (2014) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332","journal-title":"Evol Comput"},{"issue":"7","key":"1722_CR19","first-page":"2104","volume":"xiii","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search. Optimization and Machine Learning xiii(7):2104\u20132116","journal-title":"Optimization and Machine Learning"},{"key":"1722_CR20","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithm + data structure = evolution programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic algorithm + data structure = evolution programs. Springer, Berlin, pp 631\u2013653"},{"key":"1722_CR21","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, 1995. Proceedings, vol 4, pp 1942\u20131948"},{"issue":"22","key":"1722_CR22","doi-asserted-by":"crossref","first-page":"11042","DOI":"10.1016\/j.amc.2012.05.001","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Applied Mathematics & Computation 218(22):11042\u201311061","journal-title":"Applied Mathematics & Computation"},{"issue":"4","key":"1722_CR23","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","journal-title":"J Glob Optim"},{"issue":"9","key":"1722_CR24","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1360\/crad20070905","volume":"44","author":"H Yichao","year":"2007","unstructured":"Yichao H (2007) A binary differential evolution algorithm with hybrid encoding. Journal of Computer Research & Development 44(9):1476\u20131484","journal-title":"Journal of Computer Research & Development"},{"issue":"4","key":"1722_CR25","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/CI-M.2006.248054","volume":"1","author":"M Dorigo","year":"2007","unstructured":"Dorigo M, Birattari M, Stutzle T (2007) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"1722_CR26","unstructured":"Hanxiao S (2006) Solution to 0\/1 knapsack problem based on improved ant colony algorithm. IEEE International Conference on Information Acquisition, pp 1062\u20131066"},{"issue":"3","key":"1722_CR27","doi-asserted-by":"crossref","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]. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"key":"1722_CR28","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"key":"1722_CR29","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.eswa.2017.04.023","volume":"83","author":"MAE Aziz","year":"2017","unstructured":"Aziz MAE, Ewees AA, Hassanien AE (2017) Whale optimization algorithm and moth-flame optimization for multilevel thresholding image segmentation. Expert Syst Appl 83:242\u2013256","journal-title":"Expert Syst Appl"},{"key":"1722_CR30","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.neucom.2017.04.053","volume":"260","author":"MM Mafarja","year":"2017","unstructured":"Mafarja MM, Mirjalili S (2017) Hybrid whale optimization algorithm with simulated annealing for feature selection[J]. Neurocomputing 260:302\u2013312","journal-title":"Neurocomputing"},{"key":"1722_CR31","doi-asserted-by":"crossref","unstructured":"Nazari-Heris M, Mehdinejad M, Mohammadi-Ivatloo B, et al. (2017) Combined heat and power economic dispatch problem solution by implementation of whale optimization method. Neural Computing & Applications, pp 1\u201316","DOI":"10.1007\/s00521-017-3074-9"},{"key":"1722_CR32","doi-asserted-by":"crossref","unstructured":"Trivedi I, Bhoye N, Bhesdadiya M, An RH, et al. (2017) An emission constraint environment dispatch problem solution with microgrid using whale optimization algorithm. In: Power systems conference. IEEE","DOI":"10.1109\/NPSC.2016.7858899"},{"issue":"1","key":"1722_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00500-016-2442-1","volume":"22","author":"I Aljarah","year":"2016","unstructured":"Aljarah I, Faris H, Mirjalili S (2016) Optimizing connection weights in neural networks using the whale optimization algorithm. Soft Comput 22(1):1\u201315","journal-title":"Soft Comput"},{"issue":"4","key":"1722_CR34","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.aej.2016.10.002","volume":"56","author":"DB Prakash","year":"2016","unstructured":"Prakash DB, Lakshminarayana C (2016) Optimal siting of capacitors in radial distribution network using whale optimization algorithm. Alexandria Engineering Journal 56(4):499\u2013509","journal-title":"Alexandria Engineering Journal"},{"issue":"99","key":"1722_CR35","doi-asserted-by":"crossref","first-page":"6168","DOI":"10.1109\/ACCESS.2017.2695498","volume":"5","author":"L Ying","year":"2017","unstructured":"Ying L, Zhou Y, Luo Q (2017) Levy flight trajectory-based whale optimization algorithm for global optimization. IEEE Access 5(99):6168\u20136186","journal-title":"IEEE Access"},{"key":"1722_CR36","doi-asserted-by":"crossref","unstructured":"Laskar NM, Guha K, Chatterjee I, Chanda S, Baishnab KL, Paul PK (2018) HWPSO: a new hybrid whale-particle swarm optimization algorithm and its application in electronic design optimization problems. Applied Intelligence, pp 1\u201327","DOI":"10.1007\/s10489-018-1247-6"},{"key":"1722_CR37","doi-asserted-by":"crossref","unstructured":"Abdel-Basset M, Gunasekaran M, El-Shahat D, et al. (2018) A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Futur Gener Comput Syst, pp 85","DOI":"10.1016\/j.future.2018.03.020"},{"key":"1722_CR38","first-page":"384","volume":"10941","author":"Z Xu","year":"2018","unstructured":"Xu Z, Yu Y, Yachi H, Ji J, Todo Y, Gao S (2018) A novel memetic whale optimization algorithm for optimization, international conference on swarm intelligence. ICSI 2018: Advances in Swarm Intelligence 10941:384\u2013396","journal-title":"ICSI 2018: Advances in Swarm Intelligence"},{"issue":"9","key":"1722_CR39","first-page":"1243","volume":"14","author":"H Zamani","year":"2016","unstructured":"Zamani H, Nadimi-Shahraki MH (2016) Feature selection based on whale optimization algorithm for diseases diagnosis. International Journal of Computer Science and Information Security (IJCSIS) 14(9):1243\u20131247","journal-title":"International Journal of Computer Science and Information Security (IJCSIS)"},{"key":"1722_CR40","doi-asserted-by":"crossref","unstructured":"Abdel-Basset M, El-Shahat D, Sangaiah AK (2017) A modified nature inspired meta-heuristic whale optimization algorithm for solving 0-1 knapsack problem. International Journal of Machine Learning & Cybernetics 1: 1\u201320","DOI":"10.1007\/s13042-017-0731-3"},{"key":"1722_CR41","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.neucom.2017.04.053","volume":"260","author":"MM Mafarja","year":"2017","unstructured":"Mafarja MM, Mirjalili S (2017) Hybrid whale optimization algorithm with simulated annealing for feature selection. Neurocomputing 260:302\u2013312","journal-title":"Neurocomputing"},{"key":"1722_CR42","doi-asserted-by":"crossref","unstructured":"Hussien AG, Houssein EH, Hassanien AE (2018) A binary whale optimization algorithm with hyperbolic tangent fitness function for feature selection. In: Eighth international conference on intelligent computing and information systems. IEEE, pp 166\u2013 172","DOI":"10.1109\/INTELCIS.2017.8260031"},{"key":"1722_CR43","unstructured":"Reddy KS, Panwar L, Panigrahi BK, et al. (2018) Binary whale optimization algorithm: a new metaheuristic approach for profit-based unit commitment problems in competitive electricity markets. Eng Optim, pp 1\u201321"},{"key":"1722_CR44","doi-asserted-by":"publisher","unstructured":"Hussien AG, Hassanien AE, Houssein EH, et al. (2019) S-shaped binary whale optimization algorithm for feature selection. in press, https:\/\/doi.org\/10.1007\/978-981-10-8863-6_9","DOI":"10.1007\/978-981-10-8863-6_9"},{"issue":"11","key":"1722_CR45","first-page":"1003","volume":"21","author":"WU Shao-Yan","year":"1998","unstructured":"Shao-Yan WU, Zhuo-Qun XU (1998) A heuristic policy for constructing crossover in genetic algorithms. Chinese Journal of Computers 21(11):1003\u20131008","journal-title":"Chinese Journal of Computers"},{"issue":"2","key":"1722_CR46","first-page":"3090","volume":"2009","author":"Z Li","year":"2009","unstructured":"Li Z, Li N (2009) A novel multi-mutation binary particle swarm optimization for 0\/1 knapsack problem. Chinese Control and Decision Conference 2009(2):3090\u20133095","journal-title":"Chinese Control and Decision Conference"},{"issue":"2","key":"1722_CR47","doi-asserted-by":"crossref","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, et al. (2011) Solving 0-1 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556\u20131564","journal-title":"Appl Soft Comput"},{"key":"1722_CR48","first-page":"817","volume-title":"An improved monkey algorithm for a 0-1 knapsack problem","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0-1 knapsack problem. Elsevier Science Publishers B. V., Amsterdam, pp 817\u2013830"},{"issue":"1","key":"1722_CR49","first-page":"83","volume":"21","author":"XF Zhang","year":"2007","unstructured":"Zhang XF, Wang JC, Mu L (2007) A parallel hybrid genetic algorithm of sovling knapsack problem. Journal of Xian University of Engineering Science and Technology 21(1):83\u2013 87","journal-title":"Journal of Xian University of Engineering Science and Technology"},{"issue":"12","key":"1722_CR50","first-page":"1096","volume":"14","author":"E Sonuc","year":"2016","unstructured":"Sonuc E, Sen B, Bayir S (2016) A parallel approach for solving 0\/1 knapsack problem using simulated annealing algorithm on CUDA platform. Int J Comput Sci Inf Sec 14(12):1096","journal-title":"Int J Comput Sci Inf Sec"},{"issue":"12","key":"1722_CR51","first-page":"6921","volume":"218","author":"A Rong","year":"2012","unstructured":"Rong A, Figueira JR, Klamroth K (2012) Dynamic programming based algorithms for the discounted {0-1} knapsackproblem. Appl Math Comput 218(12):6921\u20136933","journal-title":"Appl Math Comput"},{"issue":"5","key":"1722_CR52","first-page":"1292","volume":"37","author":"W Congcong","year":"2017","unstructured":"Congcong W, Yichao H, Yiying C (2017) Mutated bat algorithm for solving discounted {0-1} knapsack problem. Journal of Computer Applications 37(5):1292\u20131299","journal-title":"Journal of Computer Applications"},{"issue":"1","key":"1722_CR53","first-page":"137","volume":"38","author":"L Xuejing","year":"2018","unstructured":"Xuejing L, Yichao H, Fengjia L, et al. (2018) Chaotic crow search algorithm based on differential evolution strategy for solving discount {0-1} knapsack problem. Journal of Computer Applications 38(1):137\u2013145","journal-title":"Journal of Computer Applications"},{"issue":"4","key":"1722_CR54","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","volume":"10","author":"H Zhu","year":"2017","unstructured":"Zhu H, He Y, Wang X, Tang ECC (2017) Discrete differential evolutions for the discounted {0C1} knapsack problem. Int J Bio-Inspired Computation 10(4):219\u2013238","journal-title":"Int J Bio-Inspired Computation"},{"issue":"3","key":"1722_CR55","first-page":"1049","volume":"68","author":"P Niu","year":"2017","unstructured":"Niu P, Wu Z, Ma Y, Shi C, Li J (2017) Prediction of steam turbine heat consumption rate based on whale optimization. CIESC Journal 68(3):1049\u20131057","journal-title":"CIESC Journal"},{"key":"1722_CR56","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: Proc 1997 conf. on systems, man, and cybernetics. IEEE Service Center, Piscataway, pp 4104\u20134109","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"1722_CR57","doi-asserted-by":"crossref","unstructured":"Sundar S, Singh A, Andr Rossi (2010) An artificial bee colony algorithm for the 0-1 multidimensional knapsack problem[C]. International Symposium on Innovations in Intelligent Systems & Applications, IEEE","DOI":"10.1007\/978-3-642-14834-7_14"},{"key":"1722_CR58","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.neucom.2011.11.033","volume":"98","author":"L Wang","year":"2012","unstructured":"Wang L, Fu X, Mao Y, Menhas MI, Fei M (2012) A novel modified binary differential evolution algorithm and its applications. Neurocomput 98:55\u201375","journal-title":"Neurocomput"},{"key":"1722_CR59","doi-asserted-by":"crossref","unstructured":"Nakamura RYM, Pereira LAM, Costa KA, et al. (2012) BBA: a binary bat algorithm for feature selection[C]. In: 2012 25th SIBGRAPI conference on graphics, patterns and images, IEEE","DOI":"10.1109\/SIBGRAPI.2012.47"},{"key":"1722_CR60","doi-asserted-by":"crossref","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 & Evolutionary Computation 9:1\u201314","journal-title":"Swarm & Evolutionary Computation"},{"key":"1722_CR61","doi-asserted-by":"crossref","unstructured":"Mafarja M, Eleyan D, Abdullah S, et al. (2017) S-shaped vs. v-shaped transfer functions for ant lion optimization algorithm in feature selection problem. In: International conference on future networks and distributed systems. ACM, pp 1\u20137","DOI":"10.1145\/3102304.3102325"},{"issue":"9","key":"1722_CR62","doi-asserted-by":"publisher","first-page":"2580","DOI":"10.13328\/j.cnki.jos.005400","volume":"29","author":"H Yichao","year":"2018","unstructured":"Yichao H, Xizhao W, Shuling Z, Xinlu Z (2018) Design and applications of discrete evolutionary algorithm based on encoding transformation. Journal of Software 29(9):2580\u20132594. https:\/\/doi.org\/10.13328\/j.cnki.jos.005400","journal-title":"Journal of Software"},{"key":"1722_CR63","unstructured":"Zewen L, Yichao H, Huanzhe L, Ya L, Xiaohu G (2019) A novel discrete grey wolf optimizer for solving the bounded knapsack problem. In: Peng H, Deng C, Wu Z, Liu Y (eds) Computational intelligence and intelligent systems. ISICA 2018. Communications in computer and information science, vol 986. Springer, Singapore"},{"key":"1722_CR64","doi-asserted-by":"publisher","unstructured":"He YC, Wang XZ, Li WB, Zhao SL (2016) Exact algorithms and evolutionary algorithms for randomized time-varying knapsack problem. Ruan Jian Xue Bao\/Journal of Software. (in Chinese with English abstract). https:\/\/doi.org\/10.13328\/j.cnki.jos.004937. http:\/\/www.jos.org.cn\/1000-9825\/4937.htm","DOI":"10.13328\/j.cnki.jos.004937"},{"issue":"1","key":"1722_CR65","first-page":"1","volume":"28","author":"XZ Wang","year":"2017","unstructured":"Wang XZ, Yi-Chao HE (2017) Evolutionary algorithms for knapsack problems. Journal of Software 28 (1):1\u201316","journal-title":"Journal of Software"},{"issue":"2","key":"1722_CR66","doi-asserted-by":"crossref","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, et al. (2011) Solving 0-1 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556\u20131564","journal-title":"Appl Soft Comput"},{"key":"1722_CR67","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1016\/j.cam.2013.09.052","volume":"259","author":"MAK Azad","year":"2014","unstructured":"Azad MAK, Rocha AMAC, Fernandes EMGP (2014) A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems. Journal of Computational and Applied Mathematics 259:897\u2013904","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"1722_CR68","first-page":"817","volume-title":"An improved monkey algorithm for a 0-1 knapsack problem","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0-1 knapsack problem. Elsevier Science Publishers B.V., Amsterdam, pp 817\u2013830"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01722-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01722-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01722-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:04:34Z","timestamp":1622851474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01722-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,5]]},"references-count":68,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1722"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01722-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,5]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}