{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T10:15:06Z","timestamp":1768644906455,"version":"3.49.0"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"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":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s13042-020-01165-9","type":"journal-article","created":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T20:02:31Z","timestamp":1594670551000},"page":"201-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A hybrid grey wolf optimizer for solving the product knapsack problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Zewen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yichao","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"1165_CR1","doi-asserted-by":"publisher","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. Springer, Berlin, Heidelberg"},{"key":"1165_CR2","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":"1","key":"1165_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4(1):63\u201386","journal-title":"J Heuristics"},{"key":"1165_CR4","doi-asserted-by":"publisher","unstructured":"Gallo G, Hammer PL, Simeone B (1980) Quadratic knapsack problems. Springer, Berlin, Heidelberg, pp 132\u2013149. https:\/\/doi.org\/10.1007\/BFb0120892","DOI":"10.1007\/BFb0120892"},{"key":"1165_CR5","volume-title":"A minimal algorithm for the bounded knapsack problem. Integer programming and combinatorial optimization","author":"D Pisinger","year":"1995","unstructured":"Pisinger D (1995) A minimal algorithm for the bounded knapsack problem. Integer programming and combinatorial optimization. Springer, Berlin, Heidelberg"},{"key":"1165_CR6","unstructured":"Guldan B (2007) Heuristic and exact algorithms for discounted knapsack problems. Master thesis, University of Erlangen-Nrnberg, Germany"},{"issue":"6","key":"1165_CR7","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","volume":"41","author":"O Goldschmidt","year":"2015","unstructured":"Goldschmidt O, Nehme D, Gang Y (2015) Note: on the set-union knapsack problem. Naval Res Logist 41(6):833\u2013842","journal-title":"Naval Res Logist"},{"key":"1165_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.33366\/opt.v2i1.897","volume":"2","author":"C D\u2019Ambrosio","year":"2018","unstructured":"D\u2019Ambrosio C, Furini F, Monaci M, Traversi E (2018) On the product knapsack problem. Optim Lett 2:1\u201322","journal-title":"Optim Lett"},{"key":"1165_CR9","unstructured":"Pferschy U, Schauer J, Thielen C (2019) The product Knapsack problem: approximation and complexity. arXiv:1901.00695"},{"issue":"3","key":"1165_CR10","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"2011","unstructured":"Martello S, Pisinger D, Toth P (2011) Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manage Sci 45(3):414\u2013424","journal-title":"Manage Sci"},{"key":"1165_CR11","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge","edition":"3"},{"issue":"1","key":"1165_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332","journal-title":"Evol Comput"},{"key":"1165_CR13","doi-asserted-by":"publisher","unstructured":"Ashlock D (2006) Evolutionary computation for modeling and optimization. Springer, New York. https:\/\/doi.org\/10.1007\/0-387-31909-3","DOI":"10.1007\/0-387-31909-3"},{"key":"1165_CR14","first-page":"2104","volume":"7","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithm in search, optimization, and machine learning. Addison Wesley xiii 7:2104\u20132116","journal-title":"Addison Wesley xiii"},{"key":"1165_CR15","unstructured":"Kennedy J (2011) Particle swarm optimization. In: Proc. of 1995 IEEE Int. Conf. Neural Networks (Perth, Australia), Nov. 27-Dec., vol 4, no 8, pp 1942\u20131948"},{"issue":"5","key":"1165_CR16","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1504\/IJBIC.2016.079568","volume":"8","author":"X Chu","year":"2016","unstructured":"Chu X, Niu B, Liang JJ, Lu Q (2016) An orthogonal-design hybrid particle swarm optimiser with application to capacitated facility location problem. Int J Bio Inspir Comput 8(5):268\u2013285","journal-title":"Int J Bio Inspir Comput"},{"issue":"4","key":"1165_CR17","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\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359","journal-title":"J Global Optim"},{"issue":"2","key":"1165_CR18","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2009","unstructured":"Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398\u2013417","journal-title":"IEEE Trans Evol Comput"},{"key":"1165_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2016.01.004","volume":"27","author":"S Das","year":"2016","unstructured":"Das S, Mullick SS, Suganthan PN (2016) Recent advances in differential evolution\u2014an updated survey. Swarm Evol Comput 27:1\u201330","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"1165_CR20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/CI-M.2006.248054","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, St\u00fctzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"8","key":"1165_CR21","first-page":"2016","volume":"37","author":"Q Nie","year":"2016","unstructured":"Nie Q, Cai T, Wang N (2016) Application of improved ant colony algorithm in resource allocation of cloud computing. Comput Eng Design 37(8):2016\u20132020","journal-title":"Comput Eng Design"},{"issue":"1","key":"1165_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TEVC.2007.894202","volume":"12","author":"Q Zhang","year":"2008","unstructured":"Zhang Q, Zhou A, Jin Y (2008) Rm-meda: a regularity model-based multi-objective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41\u201363","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1165_CR23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/TEVC.2015.2428616","volume":"20","author":"J Wang","year":"2016","unstructured":"Wang J, Tang K, Lozano JA, Yao X (2016) Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems. IEEE Trans Evol Comput 20(1):96\u2013109","journal-title":"IEEE Trans Evol Comput"},{"key":"1165_CR24","doi-asserted-by":"crossref","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","DOI":"10.1007\/s10898-007-9149-x"},{"key":"1165_CR25","doi-asserted-by":"crossref","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":"1165_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-020-01094-7","author":"H Hakli","year":"2020","unstructured":"Hakli H, Kiran MS (2020) An improved artificial bee colony algorithm for balancing local and global search behaviors in continuous optimization. Int J Mach Learn Cyber. https:\/\/doi.org\/10.1007\/s13042-020-01094-7","journal-title":"Int J Mach Learn Cyber"},{"issue":"1","key":"1165_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J Gottlieb","year":"2014","unstructured":"Gottlieb J, Marchiori E, Rossi C (2014) Evolutionary algorithms for the satisfiability problem. Evol Comput 10(1):35\u201350","journal-title":"Evol Comput"},{"issue":"2","key":"1165_CR28","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. J Oper Res Soc 94(2):392\u2013404","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1165_CR29","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.artint.2012.01.001","volume":"180","author":"Y Yu","year":"2012","unstructured":"Yu Y, Yao X, Zhou ZH (2012) On the approximation ability of evolutionary optimization with application to minimum set cover. Artif Intell 180(2):20\u201333","journal-title":"Artif Intell"},{"key":"1165_CR30","doi-asserted-by":"crossref","first-page":"3445","DOI":"10.1007\/s13042-019-00931-8","volume":"10","author":"N Al-Madi","year":"2019","unstructured":"Al-Madi N, Faris H, Mirjalili S (2019) Binary multi-verse optimization algorithm for global optimization and discrete problems. Int J Mach Learn Cybern 10:3445\u20133465","journal-title":"Int J Mach Learn Cybern"},{"key":"1165_CR31","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1007\/s13042-017-0772-7","volume":"9","author":"S Korkmaz","year":"2018","unstructured":"Korkmaz S, Babalik A, Kiran MS (2018) An artificial algae algorithm for solving binary optimization problems. Int J Mach Learn Cybern 9:1233\u20131247","journal-title":"Int J Mach Learn Cybern"},{"issue":"5","key":"1165_CR32","doi-asserted-by":"crossref","first-page":"5593","DOI":"10.1016\/j.eswa.2011.11.058","volume":"39","author":"L Wang","year":"2012","unstructured":"Wang L, Wang SY, Xu Y (2012) An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem. Expert Syst Appl 39(5):5593\u20135599","journal-title":"Expert Syst Appl"},{"issue":"23","key":"1165_CR33","doi-asserted-by":"crossref","first-page":"9788","DOI":"10.1016\/j.apm.2016.06.002","volume":"40","author":"J Liu","year":"2016","unstructured":"Liu J, Wu C, Cao J, Wang X, Teo KL (2016) A binary differential search algorithm for 0\u20131 multidimensional knapsack problem. Appl Math Model 40(23):9788\u20139805","journal-title":"Appl Math Model"},{"issue":"50","key":"1165_CR34","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.asoc.2016.11.023","volume":"715","author":"T Meng","year":"2017","unstructured":"Meng T, Pan QK (2017) An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem. Appl Soft Comput 715(50):79\u201393","journal-title":"Appl Soft Comput"},{"key":"1165_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-020-01085-8","author":"J Garc\u00eda","year":"2020","unstructured":"Garc\u00eda J, Lalla-Ruiz E, Vo\u00df S, Droguett EL (2020) Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem. Int J Mach Learn Cybern. https:\/\/doi.org\/10.1007\/s13042-020-01085-8","journal-title":"Int J Mach Learn Cybern"},{"key":"1165_CR36","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.ins.2016.07.037","volume":"369","author":"YC He","year":"2016","unstructured":"He YC, Wang XZ, He YL, Zhao SL, Li WB (2016) Exact and approximate algorithms for discounted 0\u20131 knapsack problem. Inf Sci 369:634\u2013647","journal-title":"Inf Sci"},{"key":"1165_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.03.002","author":"YC He","year":"2019","unstructured":"He YC, Wang JH, Zhang XL, Li HZ, Liu XJ (2019) Encoding transformation-based differential evolution algorithm for solving knapsack problem with single continuous variable. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2019.03.002","journal-title":"Swarm Evol Comput"},{"key":"1165_CR38","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-04944-6_14","volume-title":"Firefly algorithms for multimodal optimization. Stochastic algorithms: foundations and applications","author":"XS Yang","year":"2009","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. Stochastic algorithms: foundations and applications. Springer, Berlin, Heidelberg, pp 169\u2013178"},{"key":"1165_CR39","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96:120\u2013133","journal-title":"Knowl Based Syst"},{"issue":"3","key":"1165_CR40","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69(3):46\u201361","journal-title":"Adv Eng Softw"},{"key":"1165_CR41","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":"1165_CR42","doi-asserted-by":"crossref","unstructured":"Tan Y, Zhu YC (2010) Fireworks algorithm for optimization. Advances in Swarm intelligence, first international conference, ICSI, Beijing, China, June, Part I. Springer, New York, pp 355\u2013364","DOI":"10.1007\/978-3-642-13495-1_44"},{"issue":"6","key":"1165_CR43","first-page":"559","volume":"45","author":"HB Duan","year":"2015","unstructured":"Duan HB, Qiu HX, Fan YM (2015) Unmanned aerial vehicle close formation cooperative control based on predatory escaping pigeon-inspired optimization. Sci Sinica 45(6):559\u2013572","journal-title":"Sci Sinica"},{"issue":"3","key":"1165_CR44","first-page":"277","volume":"48","author":"HB Duan","year":"2018","unstructured":"Duan HB, Yang ZY (2018) Large civil aircraft receding horizon control based on cauthy mutation pigeon inspired optimization. Sci Sinica 48(3):277\u2013288","journal-title":"Sci Sinica"},{"key":"1165_CR45","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ins.2014.03.128","volume":"279","author":"OA Arqub","year":"2014","unstructured":"Arqub OA, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396\u2013415","journal-title":"Inf Sci"},{"key":"1165_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-019-09343-x","author":"AR Yildiz","year":"2019","unstructured":"Yildiz AR, Abderezak H, Mirjalili S (2019) A comparative study of recent non-traditional methods for mechanical design optimization. Arch Comput Methods Eng. https:\/\/doi.org\/10.1007\/s11831-019-09343-x","journal-title":"Arch Comput Methods Eng"},{"issue":"4","key":"1165_CR47","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11831-015-9155-y","volume":"23","author":"M Kiani","year":"2015","unstructured":"Kiani M, Yildiz AR (2015) A comparative study of non-traditional methods for vehicle crashworthiness and NVH optimization. Arch Comput Methods Eng 23(4):723\u2013734. https:\/\/doi.org\/10.1007\/s11831-015-9155-y","journal-title":"Arch Comput Methods Eng"},{"issue":"61","key":"1165_CR48","first-page":"60","volume":"8","author":"AR Yildiz","year":"2019","unstructured":"Yildiz AR, Y\u0131ld\u0131z BS (2019) The Harris hawks optimization algorithm, SALP swarm algorithm, grasshopper optimization algorithm and dragonfly algorithm for structural design optimization of vehicle components. Mater Testing 8(61):60\u201370","journal-title":"Mater Testing"},{"key":"1165_CR49","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.ijepes.2014.04.034","volume":"62","author":"A Mohamed Imran","year":"2014","unstructured":"Mohamed Imran A, Kowsalya M (2014) A new power system reconfiguration scheme for power loss minimization and voltage problem enhancement using fireworks algorithm. Int J Electr Power Energy Syst 62:312\u2013322","journal-title":"Int J Electr Power Energy Syst"},{"issue":"1","key":"1165_CR50","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"},{"key":"1165_CR51","volume-title":"Sizing optimization of skeletal structures using the enhanced whale optimization algorithm. Applications of Metaheuristic optimization algorithms in civil engineering","author":"A Kaveh","year":"2017","unstructured":"Kaveh A (2017) Sizing optimization of skeletal structures using the enhanced whale optimization algorithm. Applications of Metaheuristic optimization algorithms in civil engineering. Springer, Cham"},{"issue":"8","key":"1165_CR52","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.knosys.2018.04.025","volume":"153","author":"A Al-Zoubi","year":"2018","unstructured":"Al-Zoubi A, Faris H, Alqatawna J, Hassonah MA (2018) Evolving support vector machines using whale optimization algorithm for spam profiles detection on online social networks in different lingual contexts. Knowl Based Syst 153(8):91\u2013104","journal-title":"Knowl Based Syst"},{"issue":"1","key":"1165_CR53","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1016\/j.eswa.2011.07.108","volume":"39","author":"MH Horng","year":"2012","unstructured":"Horng MH (2012) Vector quantization using the firefly algorithm for image compression. Expert Syst Appl 39(1):1078\u20131091","journal-title":"Expert Syst Appl"},{"key":"1165_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-019-04532-1","author":"AR Yildiz","year":"2019","unstructured":"Yildiz AR (2019) A novel hybrid whale\u2013Nelder\u2013Mead algorithm for optimization of design and manufacturing problems. Int J Adv Manuf Technol. https:\/\/doi.org\/10.1007\/s00170-019-04532-1","journal-title":"Int J Adv Manuf Technol"},{"key":"1165_CR55","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s13042-019-00996-5","volume":"11","author":"MA Tawhid","year":"2020","unstructured":"Tawhid MA, Ibrahim AM (2020) Feature selection based on rough set approach, wrapper approach, and binary whale optimization algorithm. Int J Mach Learn Cybern 11:573\u2013602","journal-title":"Int J Mach Learn Cybern"},{"issue":"C","key":"1165_CR56","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.neucom.2015.06.083","volume":"172","author":"E Emary","year":"2016","unstructured":"Emary E, Zawbaa HM, Hassanien AE (2016) Binary gray wolf optimization approaches for feature selection. Neurocomputing 172(C):371\u2013381","journal-title":"Neurocomputing"},{"issue":"1","key":"1165_CR57","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/s10489-014-0645-7","volume":"43","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) How effective is the grey wolf optimizer in training multi-layer perceptrons. Appl Intell 43(1):150\u2013161","journal-title":"Appl Intell"},{"key":"1165_CR58","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.energy.2016.05.105","volume":"111","author":"T Jayabarathi","year":"2016","unstructured":"Jayabarathi T, Raghunathan T, Adarsh B, Suganthan PN (2016) Economic dispatch using hybrid grey wolf optimizer. Energy 111:630\u2013641","journal-title":"Energy"},{"issue":"2","key":"1165_CR59","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.swevo.2017.08.002","volume":"38","author":"LK Panwar","year":"2018","unstructured":"Panwar LK, Reddy S, Verma A, Panigrahi B, Kumar R (2018) Binary grey wolf optimizer for large scale unit commitment problem. Swarm Evol Comput 38(2):251\u2013266","journal-title":"Swarm Evol Comput"},{"key":"1165_CR60","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-018-9634-2","author":"NM Hatta","year":"2018","unstructured":"Hatta NM, Zain AM, Sallehuddin R (2018) Recent studies on optimisation method of Grey Wolf Optimiser (GWO): a review (2014\u20132017). Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-018-9634-2","journal-title":"Artif Intell Rev"},{"key":"1165_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0765-6","author":"AB Deshmukh","year":"2017","unstructured":"Deshmukh AB, Usha RN (2017) Fractional-Grey wolf optimizer-based kernel weighted regression model for multi-view face video super resolution. Int J Mach Learn Cybern. https:\/\/doi.org\/10.1007\/s13042-017-0765-6","journal-title":"Int J Mach Learn Cybern"},{"key":"1165_CR62","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-018-00913-2","author":"H Faris","year":"2019","unstructured":"Faris H, Mirjalili S, Aljarah I (2019) Automatic selection of hidden neurons and weights in neural networks using grey wolf optimizer based on a hybrid encoding scheme. Int J Mach Learn Cybern. https:\/\/doi.org\/10.1007\/s13042-018-00913-2","journal-title":"Int J Mach Learn Cybern"},{"key":"1165_CR63","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, Orlando, FL, USA. IEEE Proc vol 5, pp 4104\u20134108. https:\/\/doi.org\/10.1109\/ICSMC.1997.637339","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"9","key":"1165_CR64","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1360\/crad20070905","volume":"44","author":"YC He","year":"2007","unstructured":"He YC, Wang XZ, Kou YZ (2007) A binary differential evolution algorithm with hybrid encoding. J Comput Res Dev 44(9):1476\u20131484","journal-title":"J Comput Res Dev"},{"issue":"3","key":"1165_CR65","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"T Runarsson","year":"2000","unstructured":"Runarsson T, Xin Y (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284\u2013294","journal-title":"IEEE Trans Evol Comput"},{"issue":"11","key":"1165_CR66","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11):1245\u20131287","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"1","key":"1165_CR67","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10878-014-9717-1","volume":"31","author":"YC He","year":"2016","unstructured":"He YC, Zhang XL, Li WB, Li X, Wu WL, Gao SG (2016) Algorithms for randomized time-varying knapsack problems. J Comb Optim 31(1):95\u2013117","journal-title":"J Comb Optim"},{"key":"1165_CR68","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.future.2017.05.044","volume":"78","author":"YC He","year":"2018","unstructured":"He YC, Xie HR, Wong TL, Wang XZ (2018) A novel binary artificial bee colony algorithm for the set-union knapsack problem. Fut Gener Comput Syst 78:77\u201386. https:\/\/doi.org\/10.1016\/j.future.2017.05.044","journal-title":"Fut Gener Comput Syst"},{"key":"1165_CR69","first-page":"78","volume":"866","author":"AE Eiben","year":"1994","unstructured":"Eiben AE, Rau PE, Ruttkay Z (1994) Genetic algorithms with multi-parent recombination. Proc Parallel Probl Solving Nat 866:78\u201387","journal-title":"Proc Parallel Probl Solving Nat"},{"issue":"2","key":"1165_CR70","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TEVC.2009.2030331","volume":"14","author":"WN Chen","year":"2010","unstructured":"Chen WN, Zhang J, Chung H, Zhong WL, Wu WG, Shi YH (2010) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14(2):278\u2013300","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1165_CR71","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s11721-012-0073-4","volume":"6","author":"J Langeveld","year":"2012","unstructured":"Langeveld J, Engelbrecht AP (2012) Set-based particle swarm optimization applied to the multidimensional knapsack problem. Swarm Intell 6(4):297\u2013342","journal-title":"Swarm Intell"},{"issue":"2","key":"1165_CR72","first-page":"77","volume":"33","author":"M Chih","year":"2014","unstructured":"Chih M, Lin CJ, Chern MS, Ou TY (2014) Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem. Appl Math Model 33(2):77\u2013102","journal-title":"Appl Math Model"},{"issue":"1","key":"1165_CR73","doi-asserted-by":"publisher","first-page":"137","DOI":"10.11772\/j.issn.1001-9081.2017061445","volume":"38","author":"XJ Liu","year":"2018","unstructured":"Liu XJ, He YC, Lu FJ, Wu CC, Cai XF (2018) Chaotic crow search algorithm based on differential evolution strategy for solving discount 0\u20131 knapsack problem. J Comput Appl 38(1):137. https:\/\/doi.org\/10.11772\/j.issn.1001-9081.2017061445","journal-title":"J Comput Appl"},{"issue":"12","key":"1165_CR74","doi-asserted-by":"crossref","first-page":"6263","DOI":"10.3390\/e16126263","volume":"16","author":"Z Guo","year":"2014","unstructured":"Guo Z, Yue X, Zhang K, Wang S, Wu Z (2014) A thermodynamical selection based discrete differential evolution for the 0\u20131 knapsack problem. Entropy 16(12):6263\u20136285","journal-title":"Entropy"},{"issue":"260","key":"1165_CR75","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/01621459.1952.10483441","volume":"47","author":"WH Kruskal","year":"1952","unstructured":"Kruskal WH, Allen Wallis W (1952) Use of ranks in one-criterion variance analysis. Publ Am Stat Assoc 47(260):583\u2013621","journal-title":"Publ Am Stat Assoc"},{"key":"1165_CR76","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.07.045","author":"YC He","year":"2018","unstructured":"He YC, Wang XZ (2018) Group theory-based optimization algorithm for solving knapsack problems. Knowl Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2018.07.045","journal-title":"Knowl Based Syst"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01165-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-020-01165-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01165-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T23:49:45Z","timestamp":1626133785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-020-01165-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,13]]},"references-count":76,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["1165"],"URL":"https:\/\/doi.org\/10.1007\/s13042-020-01165-9","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,13]]},"assertion":[{"value":"16 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}