{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:52Z","timestamp":1773752212982,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T00:00:00Z","timestamp":1425081600000},"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":["J Math Model Algor"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10852-015-9275-2","type":"journal-article","created":{"date-parts":[[2015,2,27]],"date-time":"2015-02-27T02:42:04Z","timestamp":1425004924000},"page":"313-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Solving Large 0\u20131 Multidimensional Knapsack Problems by a New Simplified Binary Artificial Fish Swarm Algorithm"],"prefix":"10.1007","volume":"14","author":[{"given":"Md. Abul Kalam","family":"Azad","sequence":"first","affiliation":[]},{"given":"Ana Maria A. C.","family":"Rocha","sequence":"additional","affiliation":[]},{"given":"Edite M. G. P.","family":"Fernandes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,28]]},"reference":[{"key":"9275_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10479-006-0150-4","volume":"150","author":"Y Ak\u00e7ay","year":"2007","unstructured":"Ak\u00e7ay, Y., Li, H., Xu, S.H.: Greedy algorithm for the general multidimensional knapsack problem. Ann. Oper. Res. 150, 17\u201329 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9275_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cor.2009.04.015","volume":"37","author":"S Al-Shihabi","year":"2010","unstructured":"Al-Shihabi, S., \u00d3lafsson, S.: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem. Comput. Oper. Res. 37, 247\u2013255 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9275_CR3","doi-asserted-by":"crossref","unstructured":"Azad, M.A.K., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Solving multidimensional 0-1 knapsack problem with an artificial fish swarm algorithm. In: Murgante, B. et al. (eds.) Computational Science and Its Applications, ICCSA 2012, Part III, LNCS, vol. 7335, pp. 72\u201386. Springer-Verlag, Heidelberg (2012)","DOI":"10.1007\/978-3-642-31137-6_6"},{"key":"9275_CR4","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1016\/j.cam.2013.09.052","volume":"259","author":"MAK Azad","year":"2014","unstructured":"Azad, M.A.K., Rocha, A.M.A.C., Fernandes, E.M.G.P.: A simplified binary artificial fish swarm algorithm for 0\u20131 quadratic knapsack problems. J. Comput. Appl. Math. 259, 897\u2013904 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"9275_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ejor.2006.02.058","volume":"166","author":"S Balev","year":"2008","unstructured":"Balev, S., Yanev, N., Fr\u00e9ville, A., Andonov, R.: A dynamic programming based reduction procedure for the multidimensional 0\u20131 knapsack problem. Eur. J. Oper. Res. 166, 63\u201376 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"22","key":"9275_CR6","doi-asserted-by":"crossref","first-page":"11042","DOI":"10.1016\/j.amc.2012.05.001","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal, J.C., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Appl. Math. Comput. 218(22), 11042\u201311061 (2012)","journal-title":"Appl. Math. Comput."},{"key":"9275_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s12351-010-0084-0","volume":"12","author":"MR Bonyadi","year":"2012","unstructured":"Bonyadi, M.R., Li, X.: A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators. Oper. Res. - Int. J. 12, 229\u2013252 (2012)","journal-title":"Oper. Res. - Int. J."},{"key":"9275_CR8","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2007.06.068","volume":"199","author":"V Boyer","year":"2009","unstructured":"Boyer, V., Elkihel, M., Baz, D.E.: Heuristics for the 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 199, 658\u2013664 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR9","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1287\/opre.18.2.306","volume":"18","author":"AV Cabot","year":"1970","unstructured":"Cabot, A.V.: An enumeration algorithm for knapsack problems. Oper. Res. 18, 306\u2013311 (1970)","journal-title":"Oper. Res."},{"key":"9275_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4, 63\u201386 (1998)","journal-title":"J. Heuristics"},{"key":"9275_CR11","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1016\/j.cam.2013.08.017","volume":"259","author":"MFP Costa","year":"2014","unstructured":"Costa, M.F.P., Rocha, A.M.A.C., Fernandes, E.M.G.P.: An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method. J. Comput. Appl. Math. 259, 868\u2013876 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"9","key":"9275_CR12","first-page":"443","volume":"3","author":"F Djannaty","year":"2008","unstructured":"Djannaty, F., Doostdar, S.: A hybrid genetic algorithm for the multidimensional knapsack problem. Int. J. Contemp. Math. Sci. 3(9), 443\u2013456 (2008)","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"9275_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A Drexl","year":"1988","unstructured":"Drexl, A.: A simulated annealing approach to the multiconstraint zero\u2013one knapsack problem. Computing 40, 1\u20138 (1988)","journal-title":"Computing"},{"key":"9275_CR14","doi-asserted-by":"crossref","first-page":"4751","DOI":"10.1088\/0305-4470\/28\/17\/011","volume":"28","author":"JF Fontanari","year":"1995","unstructured":"Fontanari, J.F.: A statistical analysis of the knapsack problem. J. Phys. A Math. Gen. 28, 4751\u20134759 (1995)","journal-title":"J. Phys. A Math. Gen."},{"key":"9275_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville, A.: The multidimensional 0\u20131 knapsack problem: an overview. Eur. J. Oper. Res. 155, 1\u201321 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF00247210","volume":"2","author":"A Fr\u00e9ville","year":"1996","unstructured":"Fr\u00e9ville, A., Plateau, G.: The 0\u20131 bidimensional knapsack problem: Towards an efficient high-level primitive tool. J. Heuristics 2, 147\u2013167 (1996)","journal-title":"J. Heuristics"},{"key":"9275_CR17","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B Gavish","year":"1985","unstructured":"Gavish, B., Pirkul, H.: Efficient algorithms for solving multiconstraint zero\u2013one knapsack problems to optimality. Math. Program. 31, 78\u2013105 (1985)","journal-title":"Math. Program."},{"key":"9275_CR18","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/S0377-2217(97)00296-8","volume":"106","author":"S Hanafi","year":"1998","unstructured":"Hanafi, S., Fr\u00e9ville, A.: An efficient tabu search approach for the 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 106, 659\u2013675 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cor.2010.06.009","volume":"39","author":"RR Hill","year":"2012","unstructured":"Hill, R.R., Cho, Y.K., Moore, J.T.: Problem reduction heuristic for the 0\u20131 multidimensional knapsack problem. Comput. Oper. Res. 39, 19\u201326 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9275_CR20","doi-asserted-by":"crossref","unstructured":"Jiang, M., Mastorakis, N., Yuan, D., Lagunas, M.A.: Image segmentation with improved artificial fish swarm algorithm. In: Mastorakis, N. et al. (eds.) ECC 2008, LNEE, vol. 28, pp. 133\u2013138. Springer-Verlag, Heidelberg (2009)","DOI":"10.1007\/978-0-387-85437-3_12"},{"key":"9275_CR21","doi-asserted-by":"crossref","unstructured":"Jiang, M., Wang, Y., Pfletschinger, S., Lagunas, M.A., Yuan, D.: Optimal multiuser detection with artificial fish swarm algorithm. In: Huang, D.S. et al. (eds.) ICIC 2007, CCIS, vol. 2, pp. 1084\u20131093. Springer-Verlag, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74282-1_121"},{"key":"9275_CR22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10732-008-9087-x","volume":"16","author":"L Ke","year":"2010","unstructured":"Ke, L., Feng, Z., Ren, Z., Wei, X.: An ant colony optimization approach for the multidimensional knapsack problem. J. Heuristics 16, 65\u201383 (2010)","journal-title":"J. Heuristics"},{"key":"9275_CR23","doi-asserted-by":"crossref","first-page":"2672","DOI":"10.1016\/j.cor.2006.12.029","volume":"35","author":"M Kong","year":"2008","unstructured":"Kong, M., Tian, P., Kao, Y.: A new ant colony optimization algorithm for the multidimensional knapsack problem. Comput. Oper. Res. 35, 2672\u20132683 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9275_CR24","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, A.P.: Set-based particle swarm optimization applied to the multidimensional knapsack problem. Swarm Intell. 6, 297\u2013342 (2012)","journal-title":"Swarm Intell."},{"key":"9275_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms+Data Structures=Evolution Programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms+Data Structures=Evolution Programs. Springer, Berlin (1996)"},{"key":"9275_CR26","doi-asserted-by":"crossref","unstructured":"Neshat, M., Sepidnam, G., Sargolzaei, M., Toosi, A.N.: Artificial fish swarm algorithm: a survey of the state-of-the-art, hybridization, combinatorial and indicative applications. Artif. Intell. Rev 42(4), 965\u2013997 (2014)","DOI":"10.1007\/s10462-012-9342-2"},{"issue":"9","key":"9275_CR27","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","volume":"13","author":"CC Petersen","year":"1967","unstructured":"Petersen, C.C.: Computational experience with variants of the Balas algorithm applied to the selection of R&D projects. Manag. Sci. 13(9), 736\u2013750 (1967)","journal-title":"Manag. Sci."},{"key":"9275_CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H Pirkul","year":"1987","unstructured":"Pirkul, H.: A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Nav. Res. Logist. 34, 161\u2013172 (1987)","journal-title":"Nav. Res. Logist."},{"key":"9275_CR29","unstructured":"Pisinger, D.: Algorithms for knapsack problems. Ph.D. thesis, Department of Computer Science, University of Copenhagen, Denmark. http:\/\/www.diku.dk\/hjemmesider\/ansatte\/pisinger\/ (1995)"},{"issue":"2","key":"9275_CR30","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/ijoc.1090.0344","volume":"22","author":"J Puchinger","year":"2010","unstructured":"Puchinger, J., Raidl, G.R., Pferschy, U.: The multidimensional knapsack problem: structure and algorithms. INFORMS J. Comput 22(2), 250\u2013265 (2010)","journal-title":"INFORMS J. Comput"},{"key":"9275_CR31","doi-asserted-by":"crossref","unstructured":"Rocha, A.M.A.C., Fernandes, E.M.G.P., Martins, T.F.M.C.: Novel fish swarm heuristics for bound constrained global optimization problems. In: Murgante, B., et al. (eds.) Computational Science and Its Applications, ICCSA 2011, Part III, LNCS, vol. 6784, pp 185\u2013199. Springer-Verlag, Heidelberg (2011)","DOI":"10.1007\/978-3-642-21931-3_16"},{"key":"9275_CR32","doi-asserted-by":"crossref","first-page":"4611","DOI":"10.1016\/j.cam.2010.04.020","volume":"235","author":"AMAC Rocha","year":"2011","unstructured":"Rocha, A.M.A.C, Martins, T.F.M.C, Fernandes, E.M.G.P.: An augmented Lagrangian fish swarm based method for global optimization. J. Comput. Appl. Math. 235, 4611\u20134620 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"9275_CR33","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/S0377-2217(02)00149-2","volume":"144","author":"M Sakawa","year":"2003","unstructured":"Sakawa, M., Kato, K.: Genetic algorithms with double strings for 0\u20131 programming problems. Eur. J. Oper. Res. 144, 581\u2013597 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR34","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0377-2217(90)90303-S","volume":"46","author":"KE Schilling","year":"1990","unstructured":"Schilling, K.E.: The growth of m\u2013constraint random knapsacks. Eur. J. Oper. Res. 46, 109\u2013112 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR35","first-page":"369","volume":"30","author":"W Shih","year":"1979","unstructured":"Shih, W.: A branch and bound method for the multiconstraint zero\u2013one knapsack problem. J. Oper. Res. Soc. 30, 369\u2013378 (1979)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR36","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0377-2217(78)90093-0","volume":"2","author":"AL Soyster","year":"1978","unstructured":"Soyster, A.L., Lev, B., Slivka, W.: Zero\u2013one programming with many variables and few constraints. Eur. J. Oper. Res. 2, 195\u2013201 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR37","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M Vasquez","year":"2005","unstructured":"Vasquez, M., Vimont, Y.: Improved results on the 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 165, 70\u201381 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9275_CR38","doi-asserted-by":"crossref","unstructured":"Wang, C.R., Zhou, C.-L., Ma, J.-W.: An improved artificial fish swarm algorithm and its application in feed-forward neural networks. In: Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, pp. 2890\u20132894 (2005)","DOI":"10.1109\/ICMLC.2005.1527436"},{"key":"9275_CR39","doi-asserted-by":"crossref","unstructured":"Wang, X., Gao, N., Cai, S., Huang, M.: An artificial fish swarm algorithm based and abc supported QoS unicast routing scheme in NGI. In: Min, G., et al. (eds.) ISPA 2006, LNCS, vol. 4331, pp. 205\u2013214. Springer-Verlag, Heidelberg (2006)","DOI":"10.1007\/11942634_22"},{"key":"9275_CR40","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"HM Weingartner","year":"1967","unstructured":"Weingartner, H.M., Ness, D.N.: Methods for the solution of the multidimensional 0\/1 knapsack problem. Oper. Res. 15, 83\u2013103 (1967)","journal-title":"Oper. Res."}],"container-title":["Journal of Mathematical Modelling and Algorithms in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-015-9275-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-015-9275-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-015-9275-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:22:34Z","timestamp":1747714954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-015-9275-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,28]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9275"],"URL":"https:\/\/doi.org\/10.1007\/s10852-015-9275-2","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,28]]}}}