{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:08:34Z","timestamp":1763726914433,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319164670"},{"type":"electronic","value":"9783319164687"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16468-7_7","type":"book-chapter","created":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T15:40:06Z","timestamp":1426347606000},"page":"74-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Jun","family":"He","sequence":"first","affiliation":[]},{"given":"Yong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,15]]},"reference":[{"key":"7_CR1","unstructured":"Louis, S.J., Rawlins, G.: Pareto optimality, GA-easiness and deception. In: Proceedings of 5th International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 118\u2013123 (1993)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-44719-9_19","volume-title":"Evolutionary Multi-Criterion Optimization","author":"JD Knowles","year":"2001","unstructured":"Knowles, J.D., Watson, R.A., Corne, D.W.: Reducing local optima in single-objective problems by multi-objectivization. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, p. 269. Springer, Heidelberg (2001)"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10852-005-2582-2","volume":"3","author":"MT Jensen","year":"2005","unstructured":"Jensen, M.T.: Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation. J. Math. Model. Algorithms 3(4), 323\u2013347 (2005)","journal-title":"J. Math. Model. Algorithms"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11047-006-9004-x","volume":"5","author":"F Neumann","year":"2006","unstructured":"Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. Nat. Comput. 5(3), 305\u2013319 (2006)","journal-title":"Nat. Comput."},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.ejor.2006.08.005","volume":"181","author":"F Neumann","year":"2007","unstructured":"Neumann, F.: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. Eur. J. Oper. Res. 181(3), 1620\u20131629 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. Evol. Comput. 18(4), 617\u2013633 (2010)","journal-title":"Evol. Comput."},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10288-013-0248-x","volume":"11","author":"C Segura","year":"2013","unstructured":"Segura, C., Coello, C.A.C., Miranda, G., Le\u00f3n, C.: Using multi-objective evolutionary algorithms for single-objective optimization. 4OR 11(3), 201\u2013228 (2013)","journal-title":"4OR"},{"key":"7_CR8","unstructured":"Zhou, Y., Li, Y., He, J., Kang, L.: Multi-objective and MGG evolutionary algorithm for constrained optimisation. In: Proceedings of 2003 IEEE Congress on Evolutionary Computation, Canberra, Australia, pp. 1\u20135. IEEE Press (2003)"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/TEVC.2006.872344","volume":"10","author":"Z Cai","year":"2006","unstructured":"Cai, Z., Wang, Y.: A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans. Evol. Comput. 10(6), 658\u2013675 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1109\/TSMCB.2006.886164","volume":"37","author":"Y Wang","year":"2007","unstructured":"Wang, Y., Cai, Z., Guo, G., Zhou, Y.: Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans. Syst. Man Cybern. Part B 37(3), 560\u2013575 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/TEVC.2007.902851","volume":"12","author":"Y Wang","year":"2008","unstructured":"Wang, Y., Cai, Z., Zhou, Y., Zeng, W.: An adaptive tradeoff model for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 12(1), 80\u201392 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ins.2013.03.002","volume":"239","author":"L Jiao","year":"2013","unstructured":"Jiao, L., Li, L., Shang, R., Liu, F., Stolkin, R.: A novel selection evolutionary strategy for constrained optimization. Inf. Sci. 239, 122\u2013141 (2013)","journal-title":"Inf. Sci."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2010.2093582","volume":"16","author":"Y Wang","year":"2012","unstructured":"Wang, Y., Cai, Z.: Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans. Evol. Comput. 16(1), 117\u2013134 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TSMCB.2011.2161467","volume":"42","author":"Y Wang","year":"2012","unstructured":"Wang, Y., Cai, Z.: A dynamic hybrid framework for constrained evolutionary optimization. IEEE Trans. Syst. Man Cybern. Part B Cybern. 42(1), 203\u2013217 (2012)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1162\/evco.2009.17.4.17401","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., Oliveto, P., Sudholt, D., Witt, C.: Analysis of diversity-preserving mechanisms for global exploration. Evol. Comput. 17(4), 455\u2013476 (2009)","journal-title":"Evol. Comput."},{"issue":"5","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE Trans. Evol. Comput. 13(5), 1006\u20131029 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"7_CR17","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/TEVC.2013.2291790","volume":"18","author":"X Lai","year":"2014","unstructured":"Lai, X., Zhou, Y., He, J., Zhang, J.: Performance analysis of evolutionary algorithms for the minimum label spanning tree problem. IEEE Trans. Evol. Comput. 18(6), 860\u2013872 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR18","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"7_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-58495-1_14","volume-title":"Methodologies for Intelligent Systems","author":"Z Michalewicz","year":"1994","unstructured":"Michalewicz, Z., Arabas, J.: Genetic algorithms for the 0\/1 knapsack problem. In: Ra\u015b, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 134\u2013143. Springer, Heidelberg (1994)"},{"key":"7_CR21","doi-asserted-by":"publisher","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, 3rd edn. Springer, New York (1996)","edition":"3"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2006.03.007","volume":"358","author":"R Kumar","year":"2006","unstructured":"Kumar, R., Banerjee, N.: Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem. Theor. Comput. Sci. 358(1), 104\u2013120 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"7_CR23","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TEVC.2006.888929","volume":"11","author":"Y Zhou","year":"2007","unstructured":"Zhou, Y., He, J.: A runtime analysis of evolutionary algorithms for constrained optimization problems. IEEE Trans. Evol. Comput. 11(5), 608\u2013619 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16468-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T19:47:15Z","timestamp":1674848835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16468-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319164670","9783319164687"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16468-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}