{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T17:23:17Z","timestamp":1786555397158,"version":"3.56.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,12,28]],"date-time":"2015-12-28T00:00:00Z","timestamp":1451260800000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00521-015-2135-1","type":"journal-article","created":{"date-parts":[[2015,12,28]],"date-time":"2015-12-28T06:54:10Z","timestamp":1451285650000},"page":"1619-1634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":125,"title":["Solving 0\u20131 knapsack problem by a novel binary monarch butterfly optimization"],"prefix":"10.1007","volume":"28","author":[{"given":"Yanhong","family":"Feng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gai-Ge","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suash","family":"Deb","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang-Jun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,28]]},"reference":[{"key":"2135_CR1","volume-title":"Design and analysis of approximation algorithms","author":"DZ Du","year":"2011","unstructured":"Du DZ, Ko KI, Hu X (2011) Design and analysis of approximation algorithms. Springer, Berlin"},{"issue":"1","key":"2135_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2007.03.010","volume":"187","author":"G Mavrotas","year":"2008","unstructured":"Mavrotas G, Diakoulaki D, Kourentzis A (2008) Selection among ranked projects under segmentation, policy and logical constraints. Eur J Oper Res 187(1):177\u2013192. doi:\n                        10.1016\/j.ejor.2007.03.010","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2135_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.future.2008.07.006","volume":"25","author":"DC Vanderster","year":"2009","unstructured":"Vanderster DC, Dimopoulos NJ, Parra-Hernandez R et al (2009) Resource allocation on computational grids using a utility model and the knapsack problem. Future Gener Comput Syst 25(1):35\u201350. doi:\n                        10.1016\/j.future.2008.07.006","journal-title":"Future Gener Comput Syst"},{"issue":"10","key":"2135_CR4","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1016\/j.cor.2009.12.006","volume":"37","author":"Salman FS PeetaS","year":"2010","unstructured":"PeetaS Salman FS, Gunnec D et al (2010) Pre-disaster investment decisions for strengthening a highway network. Comput Oper Res 37(10):1708\u20131719. doi:\n                        10.1016\/j.cor.2009.12.006","journal-title":"Comput Oper Res"},{"issue":"4","key":"2135_CR5","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1016\/j.cie.2011.06.011","volume":"61","author":"J Yates","year":"2011","unstructured":"Yates J, Lakshmanan K (2011) A constrained binary knapsack approximation for shortest path network interdiction. Comput Ind Eng 61(4):981\u2013992. doi:\n                        10.1016\/j.cie.2011.06.011","journal-title":"Comput Ind Eng"},{"issue":"2","key":"2135_CR6","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete-variable extremum problems. Oper Res 5(2):266\u2013288","journal-title":"Oper Res"},{"key":"2135_CR7","doi-asserted-by":"publisher","DOI":"10.2307\/3009639","author":"W Shih","year":"1979","unstructured":"Shih W (1979) A branch and bound method for the multi-constraint zero-one knapsack problem. J Oper Res Soc. doi:\n                        10.2307\/3009639","journal-title":"J Oper Res Soc"},{"issue":"1","key":"2135_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02243880","volume":"25","author":"P Toth","year":"1980","unstructured":"Toth P (1980) Dynamic programing algorithms for the zero-one knapsack problem. Computing 25(1):29\u201345. doi:\n                        10.1007\/BF02243880","journal-title":"Computing"},{"key":"2135_CR9","first-page":"277","volume":"49","author":"G Plateau","year":"1985","unstructured":"Plateau G, Elkihel M (1985) A hybrid method for the 0\u20131 knapsack problem. Methods Oper Res 49:277\u2013293","journal-title":"Methods Oper Res"},{"issue":"4","key":"2135_CR10","first-page":"226","volume":"32","author":"J Thiel","year":"1994","unstructured":"Thiel J, Voss S (1994) Some experiences on solving multi constraint zero-one knapsack problems with genetic algorithms. INFOR 32(4):226\u2013242","journal-title":"INFOR"},{"key":"2135_CR11","doi-asserted-by":"publisher","unstructured":"Chen P, Li J, Liu ZM (2008) Solving 0\u20131 knapsack problems by a discrete binary version of differential evolution. In: Second international symposium on intelligent information technology application, vol 2, pp 513\u2013516. doi:\n                        10.1109\/IITA.2008.538","DOI":"10.1109\/IITA.2008.538"},{"key":"2135_CR12","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. doi:\n                        10.1016\/j.asoc.2014.02.010","journal-title":"Appl Soft Comput"},{"key":"2135_CR13","doi-asserted-by":"publisher","unstructured":"Feng YH, Jia K, and He YC (2014) An improved hybrid encoding cuckoo search algorithm for 0\u20131 knapsack problems. Comput Intell Neurosci 2014:970456. doi:\n                        10.1155\/2014\/970456","DOI":"10.1155\/2014\/970456"},{"key":"2135_CR14","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/857254","author":"YH Feng","year":"2014","unstructured":"Feng YH, Wang GG, Feng QJ, Zhao XJ (2014) An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0\u20131 knapsack problems. Comput Intell Neurosci. doi:\n                        10.1155\/2014\/857254","journal-title":"Comput Intell Neurosci"},{"issue":"1","key":"2135_CR15","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.asoc.2011.08.038","volume":"12","author":"MH Kashan","year":"2012","unstructured":"Kashan MH, Nahavandi N, Kashan AH (2012) DisABC: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12(1):342\u2013352. doi:\n                        10.1016\/j.asoc.2011.08.038","journal-title":"Appl Soft Comput"},{"issue":"2","key":"2135_CR16","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556\u20131564. doi:\n                        10.1016\/j.asoc.2010.07.019","journal-title":"Appl Soft Comput"},{"issue":"12","key":"2135_CR17","doi-asserted-by":"publisher","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"X Kong","year":"2015","unstructured":"Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst Appl 42(12):5337\u20135355. doi:\n                        10.1016\/j.eswa.2015.02.015","journal-title":"Expert Syst Appl"},{"key":"2135_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-015-9465-y","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Li L, Ma M (2015) A complex-valued encoding bat algorithm for solving 0\u20131 knapsack problem. Neural Process Lett. doi:\n                        10.1007\/s11063-015-9465-y","journal-title":"Neural Process Lett"},{"key":"2135_CR19","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80\u201398","journal-title":"Adv Eng Softw"},{"issue":"3","key":"2135_CR20","first-page":"223","volume":"22","author":"XS Yang","year":"2014","unstructured":"Yang XS, Deb S, Fong S (2014) Bat algorithm is better than intermittent search strategy. J Multi-Valued Log Soft Comput 22(3):223\u2013237","journal-title":"J Multi-Valued Log Soft Comput"},{"issue":"6","key":"2135_CR21","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702\u2013713. doi:\n                        10.1109\/TEVC.2008.919004","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"2135_CR22","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.amc.2011.05.110","volume":"218","author":"X Li","year":"2011","unstructured":"Li X, Wang J, Zhou J, Yin M (2011) A perturb biogeography based optimization with mutation for global numerical optimization. Appl Math Comput 218(2):598\u2013609. doi:\n                        10.1016\/j.amc.2011.05.110","journal-title":"Appl Math Comput"},{"issue":"3\u20134","key":"2135_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00707-009-0270-4","volume":"213","author":"A Kaveh","year":"2010","unstructured":"Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213(3\u20134):267\u2013289. doi:\n                        10.1007\/s00707-009-0270-4","journal-title":"Acta Mech"},{"issue":"S12","key":"2135_CR24","first-page":"68","volume":"8","author":"PR Srivastava","year":"2012","unstructured":"Srivastava PR, Chis M, Deb S et al (2012) An efficient optimization algorithm for structural software testing. Int J Artif Intell\u2122 8(S12):68\u201377","journal-title":"Int J Artif Intell\u2122"},{"issue":"16","key":"2135_CR25","first-page":"4811","volume":"9","author":"G-G Wang","year":"2012","unstructured":"Wang G-G, Guo LH, Duan H et al (2012) A hybrid meta-heuristic DE\/CS algorithm for UCAV path planning. J Inform Comput Sci 9(16):4811\u20134818","journal-title":"J Inform Comput Sci"},{"key":"2135_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1502-7","author":"G-G Wang","year":"2014","unstructured":"Wang G-G, Gandomi AH, Zhao XJ et al (2014) Hybridizing harmony search algorithm with cuckoo search for global numerical optimization. Soft Comput. doi:\n                        10.1007\/s00500-014-1502-7","journal-title":"Soft Comput"},{"issue":"7\u20138","key":"2135_CR27","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1007\/s00521-013-1433-8","volume":"24","author":"X Li","year":"2014","unstructured":"Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7\u20138):1867\u20131877. doi:\n                        10.1007\/s00521-013-1433-8","journal-title":"Neural Comput Appl"},{"issue":"3\u20134","key":"2135_CR28","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00521-012-1304-8","volume":"24","author":"G-G Wang","year":"2014","unstructured":"Wang G-G, Guo LH, Wang HQ et al (2014) Incorporating mutation scheme into krill herd algorithm for global numerical optimization. Neural Comput Appl 24(3\u20134):853\u2013871. doi:\n                        10.1007\/s00521-012-1304-8","journal-title":"Neural Comput Appl"},{"key":"2135_CR29","unstructured":"Wang GG, Gandomi AH, Yang XS, et al (2012) A new hybrid method based on krill herd and cuckoo search for global optimization tasks. Int J Bio-Inspired Comput"},{"key":"2135_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1914-z","author":"G-G Wang","year":"2015","unstructured":"Wang G-G, Gandomi AH, Alavi AH et al (2015) A hybrid method based on krill herd and quantum-behaved particle swarm optimization. Neural Comput Appl. doi:\n                        10.1007\/s00521-015-1914-z","journal-title":"Neural Comput Appl"},{"key":"2135_CR31","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.ins.2014.02.123","volume":"274","author":"G-G Wang","year":"2014","unstructured":"Wang G-G, Guo LH, Gandomi AH et al (2014) Chaotic krill herd algorithm. Inf Sci 274:17\u201334","journal-title":"Inf Sci"},{"key":"2135_CR32","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.neucom.2013.08.031","volume":"128","author":"G-G Wang","year":"2014","unstructured":"Wang G-G, Gandomi AH, Alavi AH (2014) Stud krill herd algorithm. Neurocomputing 128:363\u2013370","journal-title":"Neurocomputing"},{"key":"2135_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1836-9","author":"S Fong","year":"2015","unstructured":"Fong S, Deb S, Yang XS (2015) A heuristic optimization method inspired by wolf preying behavior. Neural Comput Appl. doi:\n                        10.1007\/s00521-015-1836-9","journal-title":"Neural Comput Appl"},{"issue":"2","key":"2135_CR34","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1504\/IJBIC.2013.053507","volume":"5","author":"Z Cui","year":"2013","unstructured":"Cui Z, Fan S, Zeng J et al (2013) Artificial plant optimization algorithm with three-period photosynthesis. Int J Bio-Inspired Comput 5(2):133\u2013139. doi:\n                        10.1504\/IJBIC.2013.053507","journal-title":"Int J Bio-Inspired Comput"},{"key":"2135_CR35","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.asoc.2015.06.004","volume":"34","author":"L Wang","year":"2015","unstructured":"Wang L, Yang R, Ni H et al (2015) A human learning optimization algorithm and its application to multi-dimensional knapsack problems. Appl Soft Comput 34:736\u2013743. doi:\n                        10.1016\/j.asoc.2015.06.004","journal-title":"Appl Soft Comput"},{"key":"2135_CR36","doi-asserted-by":"crossref","unstructured":"Fong S, Yang XS, Deb S (2013) Swarm search for feature selection in classification. In: Computational science and engineering (CSE), 2013 IEEE 16th international conference on. IEEE, pp 902\u2013909","DOI":"10.1109\/CSE.2013.135"},{"key":"2135_CR37","doi-asserted-by":"crossref","unstructured":"Wang G-G, Deb S, Coelho LDS (2015) Earthworm optimization algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Int J Bio-Inspired Comput in press","DOI":"10.1504\/IJBIC.2015.10004283"},{"key":"2135_CR38","unstructured":"Mirjalili SA, Hashim SZM (2011). BMOA: binary magnetic optimization algorithm. In: 2011 3rd international conference on machine learning and computing (ICMLC 2011), Singapore, pp 201\u2013206"},{"key":"2135_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1923-y","author":"G-G Wang","year":"2015","unstructured":"Wang G-G, Deb S, Cui Z (2015) Monarch butterfly optimization. Neural Comput Appl. doi:\n                        10.1007\/s00521-015-1923-y","journal-title":"Neural Comput Appl"},{"key":"2135_CR40","unstructured":"Wang G-G, Zhao XC, Deb S (2015). A novel monarch butterfly optimization with greedy strategy and self-adaptive crossover operator. In: the 2015 2nd international conference on soft computing & machine intelligence (ISCMI 2015), Hong Kong. IEEE"},{"key":"2135_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9717-1","author":"Y He","year":"2014","unstructured":"He Y, Zhang X, Li W et al (2014) Algorithms for randomized time-varying knapsack problems. J Comb Optim. doi:\n                        10.1007\/s10878-014-9717-1","journal-title":"J Comb Optim"},{"key":"2135_CR42","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, Frome"},{"key":"2135_CR43","doi-asserted-by":"publisher","unstructured":"Joines JA, Houck CR (1994) On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA\u2019s. In: Evolutionary computation, 1994. IEEE World Congress on computational intelligence. Proceedings of the first IEEE conference on. IEEE, pp 579\u2013584. doi:\n                        10.1109\/ICEC.1994.349995","DOI":"10.1109\/ICEC.1994.349995"},{"key":"2135_CR44","doi-asserted-by":"publisher","unstructured":"Olsen AL (1994) Penalty functions and the knapsack problem. In: Evolutionary computation, 1994. IEEE World congress on computational intelligence. Proceedings of the first IEEE conference on. IEEE, pp 554\u2013558. doi:\n                        10.1109\/ICEC.1994.350000","DOI":"10.1109\/ICEC.1994.350000"},{"key":"2135_CR45","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Boston"},{"key":"2135_CR46","volume-title":"Evolutionary optimization algorithms","author":"D Simon","year":"2013","unstructured":"Simon D (2013) Evolutionary optimization algorithms. Wiley, New York"},{"issue":"3","key":"2135_CR47","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459\u2013471. doi:\n                        10.1007\/s10898-007-9149-x","journal-title":"J Glob Optim"},{"key":"2135_CR48","doi-asserted-by":"publisher","unstructured":"Yang XS, Deb S (2009) Cuckoo search via Levy flights. In: Nature & biologically inspired computing, 2009. NaBIC 2009. World Congress on. IEEE, pp 210\u2013214. doi:\n                        10.1109\/NABIC.2009.5393690","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"4","key":"2135_CR49","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359. doi:\n                        10.1023\/A:1008202821328","journal-title":"J Glob Optim"},{"key":"2135_CR50","volume-title":"Genetic algorithms\u00a0+\u00a0data structures\u00a0=\u00a0evolution programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic algorithms\u00a0+\u00a0data structures\u00a0=\u00a0evolution programs. Springer, Berlin"},{"key":"2135_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1925-9","author":"XS Yang","year":"2015","unstructured":"Yang XS, Deb S, Hanne T, He XS (2015) Attraction and diffusion in nature-inspired optimization algorithms. Neural Comput Appl. doi:\n                        10.1007\/s00521-015-1925-9","journal-title":"Neural Comput Appl"},{"key":"2135_CR52","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2005","unstructured":"Montgomery DC (2005) Design and analysis of experiments. Wiley, Arizona"},{"key":"2135_CR53","doi-asserted-by":"crossref","unstructured":"Feng YH, Wang G-G (2015) An Improved hybrid encoding firefly algorithm for randomized time-varying knapsack problems. In: The 2015 2nd international conference on soft computing & machine intelligence (ISCMI 2015), Hong Kong. IEEE","DOI":"10.1109\/ISCMI.2015.24"},{"issue":"7","key":"2135_CR54","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1108\/EC-10-2012-0232","volume":"31","author":"G-G Wang","year":"2014","unstructured":"Wang G-G, Hossein Gandomi A, Yang XS et al (2014) A novel improved accelerated particle swarm optimization algorithm for global numerical optimization. Eng Comput 31(7):1198\u20131220","journal-title":"Eng Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-015-2135-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2135-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2135-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2135-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T02:21:26Z","timestamp":1559096486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-015-2135-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,28]]},"references-count":54,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["2135"],"URL":"https:\/\/doi.org\/10.1007\/s00521-015-2135-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,28]]}}}