{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:58:58Z","timestamp":1743119938093,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642309755"},{"type":"electronic","value":"9783642309762"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30976-2_26","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T16:58:11Z","timestamp":1339520291000},"page":"217-224","source":"Crossref","is-referenced-by-count":10,"title":["Novel Binary Biogeography-Based Optimization Algorithm for the Knapsack Problem"],"prefix":"10.1007","author":[{"given":"BiBingyan","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Changshou","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Yanling","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hu","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2004.09.036","volume":"171","author":"F. Masako","year":"2006","unstructured":"Masako, F., Takeo, Y.: An exact algorithm for the Knapsack sharing problem with common items. European Journal of Operational Research\u00a0171(2), 693\u2013707 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jpdc.2004.10.004","volume":"65","author":"E.B. Didier","year":"2005","unstructured":"Didier, E.B., Moussa, E.: Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 Knapsack Problem. Journal of Parallel and Distributed Computing\u00a065(1), 74\u201384 (2005)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"26_CR3","first-page":"64","volume":"39","author":"C.H. Stephen","year":"2010","unstructured":"Stephen, C.H., Leung, Z.D.F., Zhou, C.L., Wu, T.: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional Knapsack packing problem. Computers & Operations Research\u00a039(1), 64\u201373 (2010)","journal-title":"Computers & Operations Research"},{"issue":"8","key":"26_CR4","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., Peng, T., Kao, Y.C.: A new ant colony optimization algorithm for the multidimensional Knapsack Problem. Computers & Operations Research\u00a035(8), 2672\u20132683 (2008)","journal-title":"Computers & Operations Research"},{"issue":"11","key":"26_CR5","doi-asserted-by":"publisher","first-page":"3458","DOI":"10.1016\/j.cor.2006.02.008","volume":"34","author":"J.A. Maria","year":"2007","unstructured":"Maria, J.A., Marla, A., Motg, A.: A multiobjective Tchebycheff based genetic algorithm for the multidimensional Knapsack Problem. Computers & Operations Research\u00a034(11), 3458\u20133470 (2007)","journal-title":"Computers & Operations Research"},{"issue":"9","key":"26_CR6","first-page":"917","volume":"24","author":"L. Zhang","year":"2001","unstructured":"Zhang, L., Zhang, B.: Good point set based genetic algorithm. Chinese Journal of Computers\u00a024(9), 917\u2013922 (2001)","journal-title":"Chinese Journal of Computers"},{"issue":"18","key":"26_CR7","first-page":"23","volume":"32","author":"X.J. Shen","year":"2006","unstructured":"Shen, X.J., Wang, W.W., Zheng, P.J.: Modified particle swarm optimization for 0\/1 Knapsack problem. Computer Engineering\u00a032(18), 23\u201324, 38 (2006)","journal-title":"Computer Engineering"},{"issue":"2","key":"26_CR8","first-page":"125","volume":"11","author":"T. Gao","year":"2002","unstructured":"Gao, T., Wang, M.G.: The research for the reductive dimension and replacive variable algorithm of special restrict ILP. Systems Engineering Theory Methodology Applications\u00a011(2), 125\u2013130 (2002)","journal-title":"Systems Engineering Theory Methodology Applications"},{"issue":"6","key":"26_CR9","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D. Simon","year":"2008","unstructured":"Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput.\u00a012(6), 702\u2013713 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Simon, D., Mehmet, E., Dawei, D.: Population Distributions in Biogeography-based Optimization algorithms with Elitism. In: SMC, pp. 1\u20136 (2009)","DOI":"10.1109\/ICSMC.2009.5346058"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TSMCB.2010.2051149","volume":"41","author":"D. Simon","year":"2011","unstructured":"Simon, D., Mehmet, E., Dawei, D., Rick, R.: Markov Models for Biogeography-Based Optimization. IEEE Transactions on Systems, Man, and Cybernetics\u2014PART B: Cybernetics\u00a041(1), 299\u2013306 (2011)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics\u2014PART B: Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30976-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T21:04:33Z","timestamp":1676149473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30976-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642309755","9783642309762"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30976-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}