{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:57Z","timestamp":1773752217066,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642311369","type":"print"},{"value":"9783642311376","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31137-6_6","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T09:17:55Z","timestamp":1340011075000},"page":"72-86","source":"Crossref","is-referenced-by-count":5,"title":["Solving Multidimensional 0\u20131 Knapsack Problem with an Artificial Fish Swarm Algorithm"],"prefix":"10.1007","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","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","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.\u00a0150, 17\u201329 (2007)","journal-title":"Ann. Oper. Res."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2006.02.058","volume":"186","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.\u00a0186, 63\u201376 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01719249","volume":"17","author":"R. Battiti","year":"1995","unstructured":"Battiti, R., Tecchiolli, G.: Local search with memory: benchmarking RTS. OR Spektrum\u00a017, 67\u201386 (1995)","journal-title":"OR Spektrum"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library; Distributing test problems by electronic mail. J. Oper. Res. Soc.\u00a041, 1069\u20131072 (1990), http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR5","doi-asserted-by":"publisher","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.\u00a0199, 658\u2013664 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1287\/opre.18.2.306","volume":"18","author":"A.V. Cabot","year":"1970","unstructured":"Cabot, A.V.: An enumeratuion algorithm for knapsack problems. Oper. Res.\u00a018, 306\u2013311 (1970)","journal-title":"Oper. Res."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics\u00a04, 63\u201386 (1998)","journal-title":"J. Heuristics"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Deep, K., Bansal, J.C.: A socio-cognitive particle swarm optimization for multi-dimensional knapsack problem. In: Proceedings of the First International Conference on Emerging Trends in Engineering and Technology, pp. 355\u2013360 (2008)","DOI":"10.1109\/ICETET.2008.163"},{"issue":"9","key":"6_CR9","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.\u00a03(9), 443\u2013456 (2008)","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"6_CR10","doi-asserted-by":"publisher","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\u00a040, 1\u20138 (1988)","journal-title":"Computing"},{"key":"6_CR11","unstructured":"Fernandes, E.M.G.P., Martins, T.F.M.C., Rocha, A.M.A.C.: Fish swarm intelligent algorithm for bound constrained global optimization. In: Aguiar, J.V. (ed.) CMMSE 2009, pp. 461\u2013472 (2009)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"4751","DOI":"10.1088\/0305-4470\/28\/17\/011","volume":"28","author":"J.F. Fontanari","year":"1995","unstructured":"Fontanari, J.F.: A statistical analysis of the knapsack problem. J. Phys. A: Math. Gen.\u00a028, 4751\u20134759 (1995)","journal-title":"J. Phys. A: Math. Gen."},{"key":"6_CR13","doi-asserted-by":"publisher","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\u00a02, 147\u2013167 (1996)","journal-title":"J. Heuristics"},{"key":"6_CR14","doi-asserted-by":"publisher","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.\u00a0155, 1\u201321 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR15","doi-asserted-by":"publisher","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.\u00a031, 78\u2013105 (1985)","journal-title":"Math. Program."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P.C. Gilmore","year":"1966","unstructured":"Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Oper. Res.\u00a014, 1045\u20131075 (1966)","journal-title":"Oper. Res."},{"key":"6_CR17","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"6_CR18","doi-asserted-by":"publisher","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.\u00a0106, 659\u2013675 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"He, J., Miao, Z., Zhang, Z., Shi, X.: Solving multidimensional 0\u20131 knapsack problem by tissue P systems with cell division. In: Proceedings of the Fourth International Conference on Bio-Inspired Computing BIC\u2013TA 2009, pp. 249\u2013253 (2009)","DOI":"10.1109\/BICTA.2009.5338106"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.cor.2010.06.009","volume":"39","author":"R.R. 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.\u00a039, 19\u201326 (2012)","journal-title":"Comput. Oper. Res."},{"key":"6_CR21","series-title":"CCIS","first-page":"1084","volume-title":"ICIC 2007","author":"M. Jiang","year":"2007","unstructured":"Jiang, M., Wang, Y., Pfletschinger, S., Lagunas, M.A., Yuan, D.: Optimal Multiuser Detection with Artificial Fish Swarm Algorithm. In: Huang, D.-S., Heutte, L., Loog, M. (eds.) ICIC 2007, Part 22. CCIS, vol.\u00a02, pp. 1084\u20131093. Springer, Heidelberg (2007)"},{"key":"6_CR22","series-title":"LNEE","first-page":"133","volume-title":"ECC 2008","author":"M. Jiang","year":"2009","unstructured":"Jiang, M., Mastorakis, N., Yuan, D., Lagunas, M.A.: Image Segmentation with Improved Artificial Fish Swarm Algorithm. In: Mastorakis, N., Mladenov, V., Kontargyri, V.T. (eds.) ECC 2008. LNEE, vol.\u00a028, pp. 133\u2013138. Springer, Heidelberg (2009)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Khuri, S., B\u00e4ck, T., Heitk\u00f6tter, J.: The zero\/one multiple knapsack problem and genetic algorithm. In: Proceedings of the 1994 ACM Symposium on Applied Computing, pp. 188\u2013193 (1994)","DOI":"10.1145\/326619.326694"},{"key":"6_CR24","doi-asserted-by":"publisher","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.\u00a035, 2672\u20132683 (2008)","journal-title":"Comput. Oper. Res."},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/11881070_94","volume-title":"Advances in Natural Computation","author":"H. Li","year":"2006","unstructured":"Li, H., Jiao, Y.-C., Zhang, L., Gu, Z.-W.: Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems. In: Jiao, L., Wang, L., Gao, X.-b., Liu, J., Wu, F. (eds.) ICNC 2006, Part I. LNCS, vol.\u00a04221, pp. 696\u2013705. Springer, Heidelberg (2006)"},{"key":"6_CR26","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)"},{"issue":"9","key":"6_CR27","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","volume":"13","author":"C.C. 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.\u00a013(9), 736\u2013750 (1967)","journal-title":"Manag. Sci."},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"4611","DOI":"10.1016\/j.cam.2010.04.020","volume":"235","author":"A.M.A.C. 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.\u00a0235, 4611\u20134620 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-21931-3_16","volume-title":"Computational Science and Its Applications - ICCSA 2011","author":"A.M.A.C. Rocha","year":"2011","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., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part III. LNCS, vol.\u00a06784, pp. 185\u2013199. Springer, Heidelberg (2011)"},{"key":"6_CR30","doi-asserted-by":"publisher","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.\u00a0144, 581\u2013597 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0377-2217(90)90303-S","volume":"46","author":"K.E. Schilling","year":"1990","unstructured":"Schilling, K.E.: The growth of m\u2013constraint random knapsacks. Eur. J. Oper. Res.\u00a046, 109\u2013112 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR32","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","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.\u00a030, 369\u2013378 (1979)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0377-2217(78)90093-0","volume":"2","author":"A.L. Soyster","year":"1978","unstructured":"Soyster, A.L., Lev, B., Slivka, W.: Zero\u2013one programming with many variables and few constraints. Eur. J. Oper. Res.\u00a02, 195\u2013201 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR34","doi-asserted-by":"publisher","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.\u00a0165, 70\u201381 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"6_CR35","first-page":"259","volume":"4","author":"K.K. Veni","year":"2010","unstructured":"Veni, K.K., Balachandar, S.R.: A new heuristic approach for large size zero\u2013one multi knapsack problem using intercept matrix. Int. J. Comput. Math. Sci.\u00a04(5), 259\u2013263 (2010)","journal-title":"Int. J. Comput. Math. Sci."},{"key":"6_CR36","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 4th ICMLC, pp. 2890\u20132894 (2005)","DOI":"10.1109\/ICMLC.2005.1527436"},{"key":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11942634_22","volume-title":"Frontiers of High Performance Computing and Networking \u2013 ISPA 2006 Workshops","author":"X. Wang","year":"2006","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., Di Martino, B., Yang, L.T., Guo, M., R\u00fcnger, G. (eds.) ISPA Workshops 2006. LNCS, vol.\u00a04331, pp. 205\u2013214. Springer, Heidelberg (2006)"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"H.M. Weingartner","year":"1967","unstructured":"Weingartner, H.M., Ness, D.N.: Methods for the solution of the multidimensional 0\/1 knapsack problem. Oper. Res.\u00a015, 83\u2013103 (1967)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31137-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T16:13:45Z","timestamp":1743524025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31137-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311369","9783642311376"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31137-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}