{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T06:28:31Z","timestamp":1772173711249,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T00:00:00Z","timestamp":1506988800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T00:00:00Z","timestamp":1506988800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2019,3,1]]},"DOI":"10.1007\/s13042-017-0731-3","type":"journal-article","created":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T05:32:50Z","timestamp":1507008770000},"page":"495-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["A modified nature inspired meta-heuristic whale optimization algorithm for solving 0\u20131 knapsack problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Mohamed","family":"Abdel-Basset","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doaa","family":"El-Shahat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun Kumar","family":"Sangaiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,3]]},"reference":[{"issue":"1","key":"731_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.13328\/j.cnki.jos.005139","volume":"281","author":"XZ Wang","year":"2017","unstructured":"Wang XZ, He YC (2017) A survey on evolutionary algorithms of solving knapsack problems. J Softw (Chinese) 281(1):1\u201316. doi: 10.13328\/j.cnki.jos.005139","journal-title":"J Softw (Chinese)"},{"issue":"3","key":"731_CR2","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S De Vries","year":"2003","unstructured":"De Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284\u2013309","journal-title":"INFORMS J Comput"},{"key":"731_CR3","first-page":"483","volume-title":"Introduction to NP-completeness of knapsack problems. Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Introduction to NP-completeness of knapsack problems. Knapsack problems. Springer, Berlin Heidelberg, pp\u00a0483\u2013493"},{"key":"731_CR4","first-page":"491","volume-title":"International Conference on Intelligent Computing","author":"M Abdel-Basset","year":"2017","unstructured":"Abdel-Basset M et al (2017) Solving 0\u20131 knapsack problems by binary dragonfly algorithm. In: International Conference on Intelligent Computing. Springer, Cham, pp\u00a0491\u2013502"},{"key":"731_CR5","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1007\/978-0-387-30164-8_630","volume-title":"Particle swarm optimization. Encyclopedia of machine learning","author":"J Kennedy","year":"2011","unstructured":"Kennedy J (2011) Particle swarm optimization. Encyclopedia of machine learning. Springer, US, pp\u00a0760\u2013766"},{"key":"731_CR6","doi-asserted-by":"crossref","unstructured":"Abdel-Raouf O, Abdel-Baset Metwally M (2013) A survey of harmony search algorithm. Int J Comput Appl 70(28)","DOI":"10.5120\/12255-8261"},{"key":"731_CR7","unstructured":"Abdel-Basset M, Hessin AN, Abdel-Fatah L (2016) A comprehensive study of cuckoo-inspired algorithms. Neural Comput Applic 1\u201317"},{"issue":"6","key":"731_CR8","first-page":"19","volume":"6","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf O, Abdel-Baset M, El-henawy I (2014) Chaotic firefly algorithm for solving definite integral. Int J Inf Technol Comput Sci (IJITCS) 6(6):19","journal-title":"Int J Inf Technol Comput Sci (IJITCS)"},{"issue":"2","key":"731_CR9","first-page":"1","volume":"4","author":"O Abdel-Raouf","year":"2014","unstructured":"Abdel-Raouf O, Abdel-Baset M (2014) A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int J Appl Oper Res Open Access J 4(2):1\u201313","journal-title":"Int J Appl Oper Res Open Access J"},{"key":"731_CR10","doi-asserted-by":"crossref","unstructured":"Srikanth K, Panwar LK, Panigrahi BK, Herrera-Viedma E, Sangaiah AK, Wang GG (2017) Meta-heuristic framework: quantum inspired binary grey wolf optimizer for unit commitment problem. Comput Electr Eng","DOI":"10.1016\/j.compeleceng.2017.07.023"},{"key":"731_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compeleceng.2017.01.025","volume":"58","author":"DV Medhane","year":"2017","unstructured":"Medhane DV, Sangaiah AK (2017) Search space-based multi-objective optimization evolutionary algorithm. Comput Electr Eng 58:126\u2013143","journal-title":"Comput Electr Eng"},{"key":"731_CR12","unstructured":"El-Shahat D, Abdel-Basset M, El-Henawy I, Sangaiah AK (2017). A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Comput, 1\u201319"},{"key":"731_CR13","unstructured":"Zhu H, He Y, Tsang E, Wang X. Discrete differential evolution for the discounted {0\u20131} Knapsack problem. J Bio-Inspired Comput Int J Bio-Inspired Comput X(Y):200x"},{"key":"731_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.05.044","author":"Y He","year":"2017","unstructured":"He Y, Xie H, Wong TL, Wang X (2017) A novel binary artificial bee colony algorithm for the set-union knapsack problem. Accepted (May). Future Gener Comput Syst. doi:10.1016\/j.future.2017.05.044","journal-title":"Future Gener Comput Syst"},{"key":"731_CR15","doi-asserted-by":"publisher","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. doi:10.1016\/j.ins.2016.07.037","journal-title":"Inf Sci"},{"issue":"12","key":"731_CR16","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":"3","key":"731_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.11591\/ijeecs.v1.i3.pp411-418","volume":"1","author":"PH Nguyen","year":"2016","unstructured":"Nguyen PH, Wang D, Truong TK (2016) A new hybrid particle swarm optimization and greedy for 0\u20131 Knapsack problem. Indones J Electr Eng Comput Sci 1(3):411\u2013418","journal-title":"Indones J Electr Eng Comput Sci"},{"key":"731_CR18","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 et al (2016) Solving 0\u20131 knapsack problem by greedy degree and expectation efficiency. Appl Soft Comput 41:94\u2013103","journal-title":"Appl Soft Comput"},{"issue":"2","key":"731_CR19","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11063-015-9465-y","volume":"44","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Li L, Ma M (2016) A complex-valued encoding bat algorithm for solving 0\u20131 knapsack problem. Neural Process Lett 44(2):407\u2013430","journal-title":"Neural Process Lett"},{"issue":"3","key":"731_CR20","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/s10489-016-0855-2","volume":"46","author":"Y Zhou","year":"2017","unstructured":"Zhou Y et al (2017) A complex-valued encoding wind driven optimization for the 0\u20131 knapsack problem. Appl Intell 46(3):684\u2013702","journal-title":"Appl Intell"},{"key":"731_CR21","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\u20131 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"},{"issue":"2","key":"731_CR22","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 et al (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"},{"key":"731_CR23","doi-asserted-by":"crossref","unstructured":"Kulkarni AJ, Krishnasamy G, Abraham A (2017) Solution to 0\u20131 knapsack problem using cohort intelligence algorithm. cohort intelligence: a socio-inspired optimization method. Springer International Publishing pp\u00a055\u201374","DOI":"10.1007\/978-3-319-44254-9_5"},{"issue":"7","key":"731_CR24","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1007\/s00500-015-1681-x","volume":"20","author":"D Zouache","year":"2016","unstructured":"Zouache D, Nouioua F, Moussaoui A (2016) Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems. Soft Comput 20(7):2781\u20132799","journal-title":"Soft Comput"},{"key":"731_CR25","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2014.12.016","volume":"299","author":"Z Beheshti","year":"2015","unstructured":"Beheshti Z, Shamsuddin SM, Hasan S (2015) Memetic binary particle swarm optimization for discrete optimization problems. Inf Sci 299:58\u201384","journal-title":"Inf Sci"},{"issue":"4","key":"731_CR26","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1016\/j.apm.2013.08.009","volume":"38","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 Modell 38(4):1338\u20131350","journal-title":"Appl Math Modell"},{"key":"731_CR27","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.asoc.2014.10.030","volume":"26","author":"M Chih","year":"2015","unstructured":"Chih M (2015) Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem. Appl Soft Comput 26:378\u2013389","journal-title":"Appl Soft Comput"},{"key":"731_CR28","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.procs.2015.08.158","volume":"60","author":"W Nakbi","year":"2015","unstructured":"Nakbi W, Alaya I, Zouari W (2015) A hybrid lagrangian search ant colony optimization algorithm for the multidimensional knapsack problem. Proc Comput Sci 60:1109\u20131119","journal-title":"Proc Comput Sci"},{"key":"731_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.asoc.2016.11.023","volume":"50","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 50:79\u201393","journal-title":"Appl Soft Comput"},{"issue":"4","key":"731_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1504\/IJBIC.2012.048063","volume":"4","author":"A Gherboudj","year":"2012","unstructured":"Gherboudj A, Layeb A, Chikhi S (2012) Solving 0\u20131 knapsack problems by a discrete binary version of cuckoo search algorithm. Int J Bio-Inspired Comput 4(4):229\u2013236","journal-title":"Int J Bio-Inspired Comput"},{"issue":"5","key":"731_CR31","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1504\/IJBIC.2011.042260","volume":"3","author":"A Layeb","year":"2011","unstructured":"Layeb A (2011) A novel quantum inspired cuckoo search for knapsack problems. Int J Bio-inspired Comput 3(5):297\u2013305","journal-title":"Int J Bio-inspired Comput"},{"key":"731_CR32","doi-asserted-by":"publisher","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 Software 95:51\u201367","journal-title":"Adv Eng Software"},{"key":"731_CR33","doi-asserted-by":"publisher","first-page":"6168","DOI":"10.1109\/ACCESS.2017.2695498","volume":"5","author":"Y Ling","year":"2017","unstructured":"Ling Y, Zhou Y, Luo Q (2017) L\u00e9vy flight trajectory-based whale optimization algorithm for global optimization. IEEE Access 5:6168\u20136186","journal-title":"IEEE Access"},{"issue":"9","key":"731_CR34","first-page":"1476","volume":"44","author":"Y He","year":"2007","unstructured":"He Y, Wang X, Kou Y (2007) A binary differential evolution algorithm with hybrid encoding. Jisuanji Yanjiu yu Fazhan (Comput Res Dev) 44(9):1476\u20131484","journal-title":"Jisuanji Yanjiu yu Fazhan (Comput Res Dev)"},{"key":"731_CR35","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation, vol\u00a05, pp\u00a04104\u20134108. IEEE","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"731_CR36","unstructured":"Beasly JE (2014) OR-library. Acesso em 10. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib \/files\/"},{"issue":"23","key":"731_CR37","doi-asserted-by":"publisher","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 the 0\u20131 multidimensional knapsack problem. Appl Math Modell 40(23):9788\u20139805","journal-title":"Appl Math Modell"},{"key":"731_CR38","unstructured":"L\u00f3pez LFM, Blas NG, Albert AA (2017). Multidimensional knapsack problem optimization using a binary particle swarm model with genetic operations. Soft Comput 1\u201316"},{"issue":"3","key":"731_CR39","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1504\/IJWMC.2017.084802","volume":"12","author":"H Li","year":"2017","unstructured":"Li H, Bai P, Wu HS (2017) Hybrid binary wolf pack algorithm for the 0\u20131 multidimensional knapsack problem. Int J Wireless Mobile Comput 12(3):291\u2013304","journal-title":"Int J Wireless Mobile Comput"},{"issue":"5","key":"731_CR40","doi-asserted-by":"publisher","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":"5","key":"731_CR41","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1103\/PhysRevE.49.4677","volume":"49","author":"RN Mantegna","year":"1994","unstructured":"Mantegna RN (1994) Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes. Phys Rev E 49(5):4677","journal-title":"Phys Rev E"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-017-0731-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-017-0731-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-017-0731-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T23:55:20Z","timestamp":1750895720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-017-0731-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,3]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,3,1]]}},"alternative-id":["731"],"URL":"https:\/\/doi.org\/10.1007\/s13042-017-0731-3","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,3]]},"assertion":[{"value":"10 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interests regarding the publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research involving human and animal rights"}}]}}