{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:28:23Z","timestamp":1775143703941,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031138690","type":"print"},{"value":"9783031138706","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-13870-6_5","type":"book-chapter","created":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T09:03:13Z","timestamp":1660467793000},"page":"51-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Mixed-Factor Evolutionary Algorithm for Multi-objective Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Yanlian","family":"Du","sequence":"first","affiliation":[]},{"given":"Zejing","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Yijun","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"5_CR1","unstructured":"Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications. Lawrence Erlbaum Associates. Inc. Publishers (1985)"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the pareto archived evolution strategy. Evol. Comput. 8(2), 149\u2013172 (2000)","journal-title":"Evol. Comput."},{"key":"5_CR3","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm. TIK-report, p. 103 (2001)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-Based Selection in Multiobjective Search. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN VIII. Lecture Notes in Computer Science, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"issue":"6","key":"5_CR5","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.swevo.2019.02.003","volume":"46","author":"H Li","year":"2019","unstructured":"Li, H., Deb, K., Zhang, Q., Suganthan, P.N., Chen, L.: Comparison between MOEA\/D and NSGA-III on a set of many and multi-objective benchmark problems with challenging difficulties. Swarm Evol. Comput. 46, 104\u2013117 (2019). https:\/\/doi.org\/10.1016\/j.swevo.2019.02.003","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., et al.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TEVC.2012.2227145","volume":"17","author":"S Yang","year":"2013","unstructured":"Yang, S., Li, M., Liu, X., et al.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17(5), 721\u2013736 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"9","key":"5_CR10","doi-asserted-by":"publisher","first-page":"3757","DOI":"10.1007\/s12652-019-01570-1","volume":"11","author":"F Moslehi","year":"2019","unstructured":"Moslehi, F., Haeri, A.: An evolutionary computation-based approach for feature selection. J. Ambient. Intell. Humaniz. Comput. 11(9), 3757\u20133769 (2019). https:\/\/doi.org\/10.1007\/s12652-019-01570-1","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"issue":"10","key":"5_CR11","doi-asserted-by":"publisher","first-page":"3975","DOI":"10.1007\/s12652-019-01631-5","volume":"11","author":"A Ragmani","year":"2019","unstructured":"Ragmani, A., Elomri, A., Abghour, N., Moussaid, K., Rida, M.: FACO: a hybrid fuzzy ant colony optimization algorithm for virtual machine scheduling in high-performance cloud computing. J. Ambient. Intell. Humaniz. Comput. 11(10), 3975\u20133987 (2019). https:\/\/doi.org\/10.1007\/s12652-019-01631-5","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"184","DOI":"10.3390\/math7020184","volume":"7","author":"P Wang","year":"2019","unstructured":"Wang, P., Xue, F., Li, H., Cui, Z., Xie, L., Chen, J.: A multi-objective DV-hop localization algorithm based on NSGA-II in internet of things. Mathematics 7(2), 184 (2019). https:\/\/doi.org\/10.3390\/math7020184","journal-title":"Mathematics"},{"key":"5_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.002","author":"D Corus","year":"2019","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithm. Theoret. Comput. Sci. (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.03.002","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary Learning: Advances in Theories and Algorithms","author":"Z Zhou","year":"2019","unstructured":"Zhou, Z., Yang, Y., Qian, C.: Evolutionary Learning: Advances in Theories and Algorithms, pp. 6\u20139. Springer, Berlin (2019). https:\/\/doi.org\/10.1007\/978-981-13-5956-9"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1111\/j.1475-3995.2011.00840.x","volume":"19","author":"T Lust","year":"2012","unstructured":"Lust, T., Teghem, J.: The multi-objective multidimensional knapsack problem: A survey and a new approach. Int. Trans. Oper. Res. 19(4), 495\u2013520 (2012)","journal-title":"Int. Trans. Oper. Res."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer US, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"5_CR17","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 multi-objective evolutionary algorithm on the 0\u20131 knapsack problem. Theoret. Comput. Sci. 358(1), 104\u2013120 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ejor.2017.06.058","volume":"264","author":"D Zouache","year":"2018","unstructured":"Zouache, D., Moussaoui, A., et al.: A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the knapsack problem. European J. Oper. Res. 264(1), 74\u201388 (2018)","journal-title":"European J. Oper. Res."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., Sudholt, D.: On the runtime analysis of stochastic ageing mechanisms. In: Proceedings of the GECCO 2014, pp. 113\u2013120 (2014)","DOI":"10.1145\/2576768.2598328"},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multi-objective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen, D.A., Lamont, G.B.: On measuring multi-objective evolutionary algorithm performance. In: Proceedings of the 2000 Congress on Evolutionary Computation 2000, pp. 204\u2013211. IEEE (2000)","DOI":"10.1109\/CEC.2000.870296"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014A comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature\u2014PPSN V, pp. 292\u2013301. Springer Berlin Heidelberg, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"},{"key":"5_CR23","unstructured":"Schott, J.R.: Fault tolerant design using single and multicriteria genetic algorithm optimization. AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH (1995)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13870-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T18:08:28Z","timestamp":1727806108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13870-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031138690","9783031138706"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13870-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2022\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IC-ICC-CN","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"449","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"209","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}