{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:53:43Z","timestamp":1725915223310},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319685410"},{"type":"electronic","value":"9783319685427"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68542-7_77","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T11:23:50Z","timestamp":1509535430000},"page":"849-854","source":"Crossref","is-referenced-by-count":0,"title":["A Developmental Evolutionary Algorithm for 0-1 Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Ming","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"77_CR1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/MCI.2011.942584","volume":"6","author":"J Zhang","year":"2011","unstructured":"Zhang, J., Zhan, Z., Lin, Y., et al.: Evolutionary computation meets machine learning: a survey. IEEE Comput. Intell. Mag. 6, 68\u201375 (2011)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"77_CR2","first-page":"1","volume":"4","author":"T Hu","year":"2010","unstructured":"Hu, T., Banzhaf, W.: Evolvability and speed of evolutionary algorithms in the light of recent developments in biology. J. Artif. Evol. Appl. 4, 1\u20135 (2010). Article no. 1","journal-title":"J. Artif. Evol. Appl."},{"key":"77_CR3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","volume":"295","author":"X Wen","year":"2015","unstructured":"Wen, X., Shao, L., Xue, Y., et al.: A rapid learning algorithm for vehicle classification. Inf. Sci. 295, 395\u2013406 (2015)","journal-title":"Inf. Sci."},{"key":"77_CR4","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvjsf433","volume-title":"The Structure of Evolutionary Theory","author":"SJ Gould","year":"2002","unstructured":"Gould, S.J.: The Structure of Evolutionary Theory. Harvard University Press, Cambridge (2002)"},{"key":"77_CR5","doi-asserted-by":"crossref","first-page":"4002","DOI":"10.1002\/sec.1582","volume":"9","author":"Q Liu","year":"2016","unstructured":"Liu, Q., Cai, W., Shen, J., et al.: A speculative approach to spatial-temporal efficiency with multi-objective optimization in a heterogeneous cloud environment. Secur. Commun. Netw. 9, 4002\u20134012 (2016)","journal-title":"Secur. Commun. Netw."},{"key":"77_CR6","unstructured":"Bin, G., Sheng, V.S., Li, S.: Bi-parameter space partition for cost-sensitive SVM. In: Proceedings of the 24th International Conference on Artificial Intelligence, pp. 3532\u20133539. AAAI Press (2015)"},{"key":"77_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.knosys.2016.10.016","volume":"115","author":"Y Kong","year":"2016","unstructured":"Kong, Y., Zhang, M., Ye, D.: A belief propagation-based method for task allocation in open and dynamic cloud environments. Knowl.-Based Syst. 115, 123\u2013132 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"77_CR8","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1002\/sec.864","volume":"7","author":"Z Xia","year":"2014","unstructured":"Xia, Z., Wang, X., Sun, X., et al.: Steganalysis of least significant bit matching using multi-order differences. Secur. Commun. Netw. 7, 1283\u20131291 (2014)","journal-title":"Secur. Commun. Netw."},{"key":"77_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR10","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1016\/j.asoc.2012.04.008","volume":"13","author":"J Bai","year":"2013","unstructured":"Bai, J., Yang, G.K., Chen, Y.W., et al.: A model induced max-min ant colony optimization for asymmetric traveling salesman problem. Appl. Soft Comput. 13, 1365\u20131375 (2013)","journal-title":"Appl. Soft Comput."},{"key":"77_CR11","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1109\/TEVC.2008.2003010","volume":"13","author":"MD Platel","year":"2009","unstructured":"Platel, M.D., Schliebs, S., Kasabov, N.: Quantum-inspired evolutionary algorithm: a multimodel EDA. IEEE Trans. Evol. Comput. 13, 1218\u20131232 (2009)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Cloud Computing and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68542-7_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T08:53:21Z","timestamp":1570265601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68542-7_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319685410","9783319685427"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68542-7_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}