{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:18:37Z","timestamp":1780636717835,"version":"3.54.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031578076","type":"print"},{"value":"9783031578083","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-57808-3_17","type":"book-chapter","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T15:02:05Z","timestamp":1712329325000},"page":"233-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Indicator Based Evolutionary Algorithm for\u00a0Multiparty Multiobjective Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Zhen","family":"Song","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjian","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peilan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zipeng","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kesheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,6]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Abdelaziz, F.B., Krichen, S., Chaouachi, J.: A hybrid heuristic for multiobjective knapsack problems. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 205\u2013212 (1999)","DOI":"10.1007\/978-1-4615-5775-3_14"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2007.09.009","volume":"36","author":"C Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0\u20131 multiobjective knapsack problem. Comput. Oper. Res. 36(1), 260\u2013279 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems-an overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res., 105693 (2022)","DOI":"10.1016\/j.cor.2021.105693"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.eswa.2016.11.007","volume":"71","author":"B Chabane","year":"2017","unstructured":"Chabane, B., Basseur, M., Hao, J.K.: R2-IBMOLS applied to a practical case of the multiobjective knapsack problem. Expert Syst. Appl. 71, 457\u2013468 (2017)","journal-title":"Expert Syst. Appl."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Chang, Y., Luo, W., Lin, X., She, Z., Shi, Y.: Multiparty multiobjective optimization by MOEA\/D. In: Proceedings of 2022 IEEE Congress on Evolutionary Computation (CEC), pp. 01\u201308. IEEE (2022)","DOI":"10.1109\/CEC55065.2022.9870294"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete-variable extremum problems. Oper. Res. 5(2), 266\u2013288 (1957)","journal-title":"Oper. Res."},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-88908-3_3","volume-title":"Multi objective Optimization","author":"K Deb","year":"2008","unstructured":"Deb, K.: Introduction to evolutionary multiobjective optimization. In: Branke, J., Deb, K., Miettinen, K., S\u0142owi\u0144ski, R. (eds.) Multi objective Optimization. LNCS, vol. 5252, pp. 59\u201396. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88908-3_3"},{"issue":"2","key":"17_CR9","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., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.eswa.2018.09.004","volume":"116","author":"R Denysiuk","year":"2019","unstructured":"Denysiuk, R., Gaspar-Cunha, A., Delbem, A.C.: Neuroevolution for solving multiobjective knapsack problems. Expert Syst. Appl. 116, 65\u201377 (2019)","journal-title":"Expert Syst. Appl."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-44634-6_20","volume-title":"Algorithms and Data Structures","author":"T Erlebach","year":"2001","unstructured":"Erlebach, T., Kellerer, H., Pferschy, U.: Approximating Multi-objective Knapsack Problems. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 210\u2013221. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44634-6_20"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1023\/A:1009682532542","volume":"6","author":"X Gandibleux","year":"2000","unstructured":"Gandibleux, X., Freville, A.: Tabu search based procedure for solving the 0\u20131 multiobjective knapsack problem: the two objectives case. J. Heurist. 6(3), 361\u2013383 (2000)","journal-title":"J. Heurist."},{"key":"17_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108606","volume":"119","author":"Y Hu","year":"2022","unstructured":"Hu, Y., et al.: A two-archive model based evolutionary algorithm for multimodal multi-objective optimization problems. Appl. Soft Comput. 119, 108606 (2022)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TEVC.2014.2315442","volume":"19","author":"H Ishibuchi","year":"2014","unstructured":"Ishibuchi, H., Akedo, N., Nojima, Y.: Behavior of multiobjective evolutionary algorithms on many-objective knapsack problems. IEEE Trans. Evol. Comput. 19(2), 264\u2013283 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-31880-4_26","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Ishibuchi","year":"2005","unstructured":"Ishibuchi, H., Kaige, S., Narukawa, K.: Comparison between lamarckian and baldwinian repair on multiobjective 0\/1 knapsack problems. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 370\u2013385. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_26"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Pang, L.M., Shang, K.: A new framework of evolutionary multi-objective algorithms with an unbounded external archive. Authorea Preprints (2023)","DOI":"10.1145\/3638530.3648424"},{"issue":"4","key":"17_CR17","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem-a comparative experiment. IEEE Trans. Evol. Comput. 6(4), 402\u2013412 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104588","volume":"109","author":"S Kahloul","year":"2022","unstructured":"Kahloul, S., Zouache, D., Brahmi, B., Got, A.: A multi-external archive-guided henry gas solubility optimization algorithm for solving multi-objective optimization problems. Eng. Appl. Artif. Intell. 109, 104588 (2022)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.enconman.2017.12.092","volume":"159","author":"K Liu","year":"2018","unstructured":"Liu, K., Li, K., Ma, H., Zhang, J., Peng, Q.: Multi-objective optimization of charging patterns for lithium-ion battery management. Energy Convers. Manage. 159, 151\u2013162 (2018)","journal-title":"Energy Convers. Manage."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Liu, W., Luo, W., Lin, X., Li, M., Yang, S.: Evolutionary approach to multiparty multiobjective optimization problems with common pareto optimal solutions. In: Proceedings of 2020 IEEE Congress on Evolutionary Computation (CEC), pp.\u00a01\u20139. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185747"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ins.2013.04.018","volume":"243","author":"TC Lu","year":"2013","unstructured":"Lu, T.C., Yu, G.R.: An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0\/1 knapsack problems. Inf. Sci. 243, 39\u201356 (2013)","journal-title":"Inf. Sci."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Luna, F., Zavala, G.R., Nebro, A.J., Durillo, J.J., Coello, C.A.C.: Solving a real-world structural optimization problem with a distributed SMS-EMOA algorithm. In: 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 600\u2013605. IEEE (2013)","DOI":"10.1109\/3PGCIC.2013.104"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Martins, M.S., Delgado, M.R., Santana, R., L\u00fcders, R., Gon\u00e7alves, R.A., Almeida, C.P.D.: HMOBEDA: Hybrid multi-objective Bayesian estimation of distribution algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 357\u2013364 (2016)","DOI":"10.1145\/2908812.2908826"},{"key":"17_CR24","unstructured":"Neubauer, A.: Theory of the simple genetic algorithm with $$\\alpha $$-selection, uniform crossover and bitwise mutation. WSEAS Trans Syst., ISSN 11092777, 989\u2013998 (2010)"},{"issue":"9","key":"17_CR25","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32(9), 2271\u20132284 (2005)","journal-title":"Comput. Oper. Res."},{"key":"17_CR26","unstructured":"Poli, R., Langdon, W.B.: A new schema theorem for genetic programming with one-point crossover and point mutation. Cognitive Science Research Papers-University of Birmingham CSRP (1997)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Riquelme, N., Von\u00a0L\u00fccken, C., Baran, B.: Performance metrics in multi-objective optimization. In: Proceedings of 2015 Latin American computing conference (CLEI), pp. 1\u201311. IEEE (2015)","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-030-78811-7_6","volume-title":"Advances in Swarm Intelligence","author":"Z She","year":"2021","unstructured":"She, Z., Luo, W., Chang, Y., Lin, X., Tan, Y.: A new evolutionary approach to multiparty multiobjective optimization. In: Tan, Y., Shi, Y. (eds.) ICSI 2021. LNCS, vol. 12690, pp. 58\u201369. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78811-7_6"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/j.procs.2020.04.149","volume":"171","author":"N Singh","year":"2020","unstructured":"Singh, N., Vardhan, M.: Computing optimal block size for blockchain based applications with contradictory objectives. Procedia Comput. Sci. 171, 1389\u20131398 (2020)","journal-title":"Procedia Comput. Sci."},{"key":"17_CR30","unstructured":"Soares, D., Arroyo, J.: A grasp algorithm for the multi-objective knapsack problem. In: Proceedings of XXIV International Conference of the Chilean Computer Science Society, Arica, Chile (2004)"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Song, Z., Luo, W., Lin, X., She, Z., Zhang, Q.: On multiobjective knapsack problems with multiple decision makers. In: Proceedings of 2022 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 156\u2013163. IEEE (2022)","DOI":"10.1109\/SSCI51031.2022.10022188"},{"issue":"4","key":"17_CR32","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a matlab platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Wang, H., Peng, K., Zhao, B.: A multi-objective optimization method for latency-sensitive applications in MEC-enabled smart campus using SMS-EMOA. In: International Conference on Mobile Networks and Management, pp. 63\u201377. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-32443-7_5","DOI":"10.1007\/978-3-031-32443-7_5"},{"key":"17_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.108297","volume":"116","author":"Z Wang","year":"2022","unstructured":"Wang, Z., Gong, M., Li, P., Gu, J., Tian, W.: A hypervolume distribution entropy guided computation resource allocation mechanism for the multiobjective evolutionary algorithm based on decomposition. Appl. Soft Comput. 116, 108297 (2022)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"17_CR35","first-page":"94","volume":"24","author":"E Yakici","year":"2018","unstructured":"Yakici, E.: A multiobjective fleet location problem solved by adaptation of evolutionary algorithms NSGA-II and SMS-EMOA. Pamukkale \u00dcniversitesi M\u00fchendislik Bilimleri Dergisi 24(1), 94\u2013100 (2018)","journal-title":"Pamukkale \u00dcniversitesi M\u00fchendislik Bilimleri Dergisi"},{"key":"17_CR36","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm. TIK report 103 (2001)"},{"key":"17_CR37","series-title":"Lecture Notes in Computer Science","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 \u2014 a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"},{"issue":"4","key":"17_CR38","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective 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."},{"issue":"2","key":"17_CR39","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligent Information Processing XII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57808-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T19:55:39Z","timestamp":1731700539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57808-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031578076","9783031578083"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57808-3_17","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iip2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mi.hitsz.edu.cn\/iip2024.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair online submission","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"49","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":"5","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":"84% - 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":"4","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":"4","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)"}},{"value":"7 Abstracts include 4 Keynotes speakers and 3 Invited Speakers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}