{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:30Z","timestamp":1725551610449},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304623"},{"type":"electronic","value":"9783540316527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589990_20","type":"book-chapter","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T06:28:03Z","timestamp":1132986483000},"page":"176-185","source":"Crossref","is-referenced-by-count":4,"title":["A Hybrid Adaptive Multi-objective Memetic Algorithm for 0\/1 Knapsack Problem"],"prefix":"10.1007","author":[{"given":"XiuPing","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZhiMing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GenKe","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bosman, P.A.N., Thierens, D.: The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans. on Evolutionary Computation\u00a0(7), 174\u2013188 (2003)","DOI":"10.1109\/TEVC.2003.810761"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Fieldsend, J.E., Everson, R.M., Singh, S.: Using unconstrained elite archives for multiobjective optimization. IEEE Trans. on Evolutionary Computation\u00a0(7), 305\u2013323 (2003)","DOI":"10.1109\/TEVC.2003.810733"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation\u00a0(6), 182\u2013197 (2002)","DOI":"10.1109\/4235.996017"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Corne, D.W.: The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation, pp. 98\u2013105 (1999)","DOI":"10.1109\/CEC.1999.781913"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Yang, S.M., Shao, D.G., Luo, Y.J.: A novel evolution strategy for multiobjective optimization problem. In: Applied Mathematics and Computation, pp. 1\u201324 (2005)","DOI":"10.1016\/j.amc.2004.12.025"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. on Evolutionary Computation\u00a0(3), 257\u2013271 (1999)","DOI":"10.1109\/4235.797969"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Corne, D.W.: M-PAES: a memetic algorithm for multiobjective optimization. In: Proceedings of the 2000 Congress on Evolutionary Computation, pp. 325\u2013332 (2000)","DOI":"10.1109\/CEC.2000.870313"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst., Man. & Cybern\u00a0(28), 392\u2013403 (1998)","DOI":"10.1109\/5326.704576"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. on Evolutionary Computation\u00a0(7), 204\u2013223 (2003)","DOI":"10.1109\/TEVC.2003.810752"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Jaszkiewicz, A.: Genetic local search for multiple objective combinatorial optimization. European J. of Oper. Res.\u00a0(137), 50\u201371 (2002)","DOI":"10.1016\/S0377-2217(01)00104-7"},{"key":"20_CR11","unstructured":"http:\/\/www.tik.ee.ethz.ch\/ziztler\/testdata.html"},{"key":"20_CR12","unstructured":"http:\/\/www-idss.cs.put.poznan.pl\/jaszkiewicz\/mokp"},{"key":"20_CR13","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm. TIK-Report 103, Switxerland (2001)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Yen, G.G., Haiming, L.: Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation. IEEE Trans. on Evolutionary Computation\u00a0(7), 253\u2013274 (2003)","DOI":"10.1109\/TEVC.2003.810068"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Tan, K.C., Lee, T.H., Khor, E.F.: Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization. IEEE Trans. On Evolutionary Computation\u00a0(5), 565\u2013588 (2001)","DOI":"10.1109\/4235.974840"}],"container-title":["Lecture Notes in Computer Science","AI 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589990_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:48:07Z","timestamp":1619506087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589990_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304623","9783540316527"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11589990_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}