{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T21:43:36Z","timestamp":1783979016781,"version":"3.55.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T00:00:00Z","timestamp":1549238400000},"content-version":"tdm","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,12]]},"DOI":"10.1007\/s13042-019-00931-8","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T19:20:36Z","timestamp":1549308036000},"page":"3445-3465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":72,"title":["Binary multi-verse optimization algorithm for global optimization and discrete problems"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0980-7559","authenticated-orcid":false,"given":"Nailah","family":"Al-Madi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hossam","family":"Faris","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seyedali","family":"Mirjalili","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,2,4]]},"reference":[{"key":"931_CR1","unstructured":"Knapsack problem benchmark set. http:\/\/pages.mtu.edu\/~kreher\/cages\/Data.html . Accessed 1 Oct 2018"},{"key":"931_CR2","first-page":"491","volume-title":"International conference on intelligent computing","author":"M Abdel-Basset","year":"2017","unstructured":"Abdel-Basset M, Luo Q, Miao F, Zhou Y (2017) Solving 0\u20131 knapsack problems by binary dragonfly algorithm. International conference on intelligent computing. Springer, New York, pp 491\u2013502"},{"key":"931_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed S, Mafarja M, Faris H, Aljarah I (2018) Feature selection using salp swarm algorithm with chaos. In: Proceedings of the 2nd international conference on intelligent systems, metaheuristics & swarm intelligence. ACM, pp 65\u201369","DOI":"10.1145\/3206185.3206198"},{"key":"931_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/ICABME.2013.6648863","volume-title":"Advances in biomedical engineering (ICABME), 2013 2nd international conference on","author":"D Alamedine","year":"2013","unstructured":"Alamedine D, Marque C, Khalil M (2013) Binary particle swarm optimization for feature selection on uterine electrohysterogram signal. Advances in biomedical engineering (ICABME), 2013 2nd international conference on. IEEE, Piscataway, pp 125\u2013128"},{"key":"931_CR5","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1016\/j.asoc.2018.07.040","volume":"71","author":"Ibrahim Aljarah","year":"2018","unstructured":"Aljarah I, Mafarja M, Heidari AA, Faris H, Zhang Y, Mirjalili S (2018) Asynchronous accelerating multi-leader salp chains for feature selection. Appl Soft Comput 71:964\u2013979","journal-title":"Applied Soft Computing"},{"issue":"3","key":"931_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","volume":"46","author":"NS Altman","year":"1992","unstructured":"Altman NS (1992) An introduction to kernel and nearest-neighbor nonparametric regression. Am Stat 46(3):175\u2013185","journal-title":"Am Stat"},{"issue":"4","key":"931_CR7","doi-asserted-by":"publisher","first-page":"3177","DOI":"10.1016\/j.eswa.2009.09.064","volume":"37","author":"\u0130 Babaoglu","year":"2010","unstructured":"Babaoglu \u0130, Findik O, \u00dclker E (2010) A comparison of feature selection models utilizing binary particle swarm optimization and genetic algorithm in determining coronary artery disease using support vector machine. Expert Syst Appl 37(4):3177\u20133183","journal-title":"Expert Syst Appl"},{"issue":"22","key":"931_CR8","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. Appl Math Comput 218(22):11042\u201311061","journal-title":"Appl Math Comput"},{"key":"931_CR9","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl Soft Comput 19:252\u2013263","journal-title":"Appl Soft Comput"},{"key":"931_CR10","first-page":"1","volume-title":"Industrial engineering and operations management (IEOM), 2015 international conference on","author":"KK Bhattacharjee","year":"2015","unstructured":"Bhattacharjee KK, Sarmah SP (2015) A binary cuckoo search algorithm for knapsack problems. Industrial engineering and operations management (IEOM), 2015 international conference on. IEEE, Piscataway, pp 1\u20135"},{"issue":"4","key":"931_CR11","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/00207160108805080","volume":"77","author":"JG Digalakis","year":"2001","unstructured":"Digalakis JG, Margaritis KG (2001) On benchmarking functions for genetic algorithms. Int J Comput Math 77(4):481\u2013506","journal-title":"Int J Comput Math"},{"issue":"4","key":"931_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"931_CR13","first-page":"1","volume-title":"Advances in Intelligent Systems and Computing","author":"E. Emary","year":"2015","unstructured":"Emary E, Zawbaa HM, Grosan C, Hassenian AE (2015) Feature subset selection approach by gray-wolf optimization. In: Afro-European conference for industrial advancement. Springer, New York, pp 1\u201313"},{"key":"931_CR14","doi-asserted-by":"publisher","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 grey wolf optimization approaches for feature selection. Neurocomputing 172:371\u2013381","journal-title":"Neurocomputing"},{"issue":"2","key":"931_CR15","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/s10489-016-0767-1","volume":"45","author":"H Faris","year":"2016","unstructured":"Faris H, Aljarah I, Mirjalili S (2016) Training feedforward neural networks using multi-verse optimizer for binary classification problems. Appl Intell 45(2):322\u2013332","journal-title":"Appl Intell"},{"key":"931_CR16","unstructured":"Faris H, Hassonah MA, Al-Zoubi AM, Mirjalili S, Aljarah I (2017) A multi-verse optimizer approach for feature selection and optimizing svm parameters based on a robust system architecture. Neural Comput Appl pp 1\u201315"},{"key":"931_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.inffus.2018.08.002","volume":"48","author":"Hossam Faris","year":"2019","unstructured":"Faris H, Ala\u2019M AZ, Heidari AA, Aljarah I, Mafarja M, Hassonah MA, Fujita H (2019) An intelligent system for spam detection and identification of the most relevant features based on evolutionary random weight networks. Inf Fusion 48:67\u201383","journal-title":"Information Fusion"},{"issue":"7","key":"931_CR18","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","volume":"28","author":"Y Feng","year":"2017","unstructured":"Feng Y, Wang GG, Deb S, Lu M, Zhao XJ (2017) Solving 0\u20131 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28(7):1619\u20131634","journal-title":"Neural Comput Appl"},{"key":"931_CR19","unstructured":"Haupt RL, Haupt SE (2004) The binary genetic algorithm, 2nd edn. In: Practical genetic algorithms, pp 27\u201350"},{"key":"931_CR20","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"},{"key":"931_CR21","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. Systems, man, and cybernetics, 1997. Computational cybernetics and simulation. 1997 IEEE international conference on, vol 5. IEEE, Piscataway, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"931_CR22","unstructured":"Kennedy R (1995) J. and eberhart, particle swarm optimization. In: Proceedings of IEEE international conference on neural networks IV, pages, vol 1000"},{"key":"931_CR23","unstructured":"Khanesar MA, Teshnehlab M, Shoorehdeli MA (2007) A novel binary particle swarm optimization. In: Control & automation, 2007. MED\u201907. Mediterranean conference on. IEEE, Piscataway, pp 1\u20136"},{"issue":"1","key":"931_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1):273\u2013324","journal-title":"Artif Intell"},{"key":"931_CR25","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1007\/11785231_119","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2006","author":"Min Kong","year":"2006","unstructured":"Kong M, Tian P (2006) Apply the particle swarm optimization to the multidimensional knapsack problem. In: International conference on artificial intelligence and soft computing. Springer, New York, pp 1140\u20131149"},{"issue":"3","key":"931_CR26","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s13042-014-0272-y","volume":"7","author":"AJ Kulkarni","year":"2016","unstructured":"Kulkarni AJ, Shabir H (2016) Solving 0\u20131 knapsack problem using cohort intelligence algorithm. Int J Mach Learn Cybern 7(3):427\u2013441","journal-title":"Int J Mach Learn Cybern"},{"key":"931_CR27","unstructured":"Lazinica A (2009) Novel binary particle swarm optimization. In: Particle swarm optimization. InTech Kirchengasse. 10.5772\/6738"},{"key":"931_CR28","doi-asserted-by":"crossref","unstructured":"Lee CY, Lee ZJ, Su SF (2006) A new approach for solving 0\/1 knapsack problem. In: Systems, man and cybernetics, 2006. SMC\u201906. IEEE international conference on, vol 4. IEEE, Piscataway, pp 3138\u20133143","DOI":"10.1109\/ICSMC.2006.384598"},{"key":"931_CR29","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.eswa.2018.09.015","volume":"117","author":"Majdi Mafarja","year":"2019","unstructured":"Mafarja M, Aljarah I, Faris H, Hammouri AI, Ala\u2019M AZ, Mirjalili S (2019) Binary grasshopper optimisation algorithm approaches for feature selection problems.\u00a0Expert Syst Appl\u00a0117:267\u2013286","journal-title":"Expert Systems with Applications"},{"key":"931_CR30","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":"931_CR31","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27(4):1053\u20131073","journal-title":"Neural Comput Appl"},{"key":"931_CR32","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":"2","key":"931_CR33","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00521-015-1870-7","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495\u2013513","journal-title":"Neural Comput Appl"},{"issue":"3\u20134","key":"931_CR34","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00521-013-1525-5","volume":"25","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Yang XS (2014) Binary bat algorithm. Neural Comput Appl 25(3\u20134):663\u2013681. https:\/\/doi.org\/10.1007\/s00521-013-1525-5","journal-title":"Neural Comput Appl"},{"key":"931_CR35","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell M (1998) An introduction to genetic algorithms. MIT press, Cambridge"},{"key":"931_CR36","unstructured":"Moghadasian M, Hosseini SP (2014) Binary cuckoo optimization algorithm for feature selection in high-dimensional datasets. In: International conference on innovative engineering technologies (ICIET2014), pp 18\u201321"},{"key":"931_CR37","unstructured":"Molga M, Smutnicki C (2005) Test functions for optimization needs. Test functions for optimization needs, p 101"},{"key":"931_CR38","doi-asserted-by":"crossref","unstructured":"Nakamura RY, Pereira LA, Costa K, Rodrigues D, Papa JP, Yang XS (2012) Bba: a binary bat algorithm for feature selection. In: Graphics, patterns and images (SIBGRAPI), 2012 25th SIBGRAPI conference on. IEEE, Piscataway, pp 291\u2013297","DOI":"10.1109\/SIBGRAPI.2012.47"},{"issue":"3","key":"931_CR39","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"},{"issue":"2","key":"931_CR40","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1016\/j.eswa.2009.06.011","volume":"37","author":"A Pal","year":"2010","unstructured":"Pal A, Maiti J (2010) Development of a hybrid methodology for dimensionality reduction in mahalanobis-taguchi system using mahalanobis distance and binary particle swarm optimization. Expert Syst Appl 37(2):1286\u20131293","journal-title":"Expert Syst Appl"},{"key":"931_CR41","doi-asserted-by":"crossref","unstructured":"Qian C, Shi JC, Yu Y, Tang K (2017) On subset selection with general cost constraints. In: Proceedings of the 26th international joint conference on artificial intelligence (IJCAI-2017), pp 2613\u20132619","DOI":"10.24963\/ijcai.2017\/364"},{"key":"931_CR42","unstructured":"Qian C, Shi JC, Yu Y, Tang K, Zhou ZH (2017) Subset selection under noise. In: Advances in neural information processing systems, pp 3560\u20133570"},{"key":"931_CR43","unstructured":"Qian C, Yu Y, Zhou ZH (2015) Subset selection by pareto optimization. In: Advances in neural information processing systems, pp 1774\u20131782"},{"issue":"3","key":"931_CR44","first-page":"496","volume":"34","author":"LY Qiao","year":"2006","unstructured":"Qiao LY, Peng XY, Peng Y (2006) Bpso-svm wrapper for feature subset selection. Dianzi Xuebao (Acta Electronica Sinica) 34(3):496\u2013498","journal-title":"Dianzi Xuebao (Acta Electronica Sinica)"},{"issue":"2","key":"931_CR45","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1504\/IJBIC.2014.060598","volume":"6","author":"S Sabba","year":"2014","unstructured":"Sabba S, Chikhi S (2014) A discrete binary version of bat algorithm for multidimensional knapsack problem. Int J Bio-Inspired Comput 6(2):140\u2013152","journal-title":"Int J Bio-Inspired Comput"},{"key":"931_CR46","first-page":"141","volume-title":"Communications in Computer and Information Science","author":"Shyam Sundar","year":"2010","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, New York, pp 141\u2013151"},{"issue":"3","key":"931_CR47","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ejor.2010.02.032","volume":"206","author":"A Unler","year":"2010","unstructured":"Unler A, Murat A (2010) A discrete particle swarm optimization method for feature selection in binary classification problems. Eur J Oper Res 206(3):528\u2013539","journal-title":"Eur J Oper Res"},{"key":"931_CR48","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.asoc.2016.08.011","volume":"49","author":"Y Wan","year":"2016","unstructured":"Wan Y, Wang M, Ye Z, Lai X (2016) A feature selection method based on modified binary coded ant colony optimization algorithm. Appl Soft Comput 49:248\u2013258","journal-title":"Appl Soft Comput"},{"key":"931_CR49","volume-title":"Data Mining: practical machine learning tools and techniques","author":"IH Witten","year":"2016","unstructured":"Witten IH, Frank E, Hall MA, Pal CJ (2016) Data Mining: practical machine learning tools and techniques. Morgan Kaufmann, Burlington"},{"key":"931_CR50","doi-asserted-by":"crossref","unstructured":"Yang XS (2010) Test problems in optimization. Eng Optim pp 261\u2013266","DOI":"10.1002\/9780470640425.app1"},{"issue":"2","key":"931_CR51","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"931_CR52","first-page":"11","volume":"196","author":"E Yassien","year":"2017","unstructured":"Yassien E, Masadeh R, Alzaqebah A, Shaheen A (2017) Grey wolf optimization applied to the 0\u20131 knapsack problem. Int J Comput Appl 196(5):11\u201315","journal-title":"Int J Comput Appl"},{"key":"931_CR53","doi-asserted-by":"crossref","unstructured":"Zabidi A, Khuan L, Mansor W, Yassin I, Sahak R (2011) Binary particle swarm optimization for feature selection in detection of infants with hypothyroidism. In: Engineering in medicine and biology society, EMBC, 2011 annual international conference of the IEEE. IEEE, Piscataway, pp 2772\u20132775","DOI":"10.1109\/IEMBS.2011.6090759"},{"key":"931_CR54","unstructured":"Zhao H, Han X, Guo S (2016) Dgm (1, 1) model optimized by mvo (multi-verse optimizer) for annual peak load forecasting. Neural Comput Appl, pp 1\u201315"},{"issue":"2","key":"931_CR55","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"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-019-00931-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-019-00931-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-019-00931-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T14:49:13Z","timestamp":1720968553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-019-00931-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,4]]},"references-count":55,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["931"],"URL":"https:\/\/doi.org\/10.1007\/s13042-019-00931-8","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,4]]},"assertion":[{"value":"8 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2019","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":"All authors declare that there is no conflict of interest.","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":"Ethical standard"}}]}}