{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:30:47Z","timestamp":1742959847207,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811941085"},{"type":"electronic","value":"9789811941092"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-4109-2_3","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:38:26Z","timestamp":1659364706000},"page":"23-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Multi-objective Algorithm with High Abundant Elite Information and Evolutionary Phase Self-adjusting for Many Objective Optimization"],"prefix":"10.1007","author":[{"given":"Lei","family":"Yang","sequence":"first","affiliation":[]},{"given":"Bin Jie","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Xiong wen","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Shu Min","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"3_CR1","unstructured":"Farina, M., Amato, P.: On the optimal solution definition for many criteria optimization problems. In: Proceedings of the 2002 Annual Meeting of the North American Fuzzy Information Processing Society. NAFIPS-FLINT 2002 (Cat. No. 02TH8622), pp. 233\u2013238. IEEE (2002)"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li, B., Li, J.: Many-objective evolutionary algorithms: A survey. ACM Comput. Surv. (CSUR) 48(1), 13 (2015)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"p182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), p182-197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR4","unstructured":"Zitzler, E., Laumanns, M.: SPEA2: Improving the strength pareto evolutionary algorithm. TIK-report 103 (2001)"},{"issue":"6","key":"3_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 multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst. Man Cybern. Part C (Applications and Reviews) 28(3), 392\u2013403 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C (Applications and Reviews)"},{"key":"3_CR7","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, pp. 832\u2013842. Springer Berlin Heidelberg, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"key":"3_CR8","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"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-540-24694-7_71","volume-title":"MICAI 2004: Advances in Artificial Intelligence","author":"CA Coello Coello","year":"2004","unstructured":"Coello Coello, C.A., Reyes Sierra, M.: A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds.) MICAI 2004. LNCS (LNAI), vol. 2972, pp. 688\u2013697. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24694-7_71"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Deb, K., Thiele, L., Laumanns, M.: Scalable multi-objective optimization test problems. In: Proceedings of the 2002 Congress on Evolutionary Computation CEC 2002 (Cat. No.02TH8600), vol. 1, pp. 825\u2013830 (2002)","DOI":"10.1109\/CEC.2002.1007032"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-31880-4_5","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Emmerich","year":"2005","unstructured":"Emmerich, M., Beume, N., Naujoks, B.: An EMO Algorithm Using the Hypervolume Measure as Selection Criterion. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 62\u201376. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_5"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader, J., Zitzler, E.: HypE: An algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45\u201376 (2011)","journal-title":"Evol. Comput."},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TEVC.2020.2964705","volume":"24","author":"K Shang","year":"2020","unstructured":"Shang, K., Ishibuchi, H.: A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 24(5), 839\u2013852 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"3_CR14","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."},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TEVC.2018.2791283","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun, Y., Yen, G.G., Yi, Z.: IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans. Evol. Comput. 23(2), 173\u2013187 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1109\/TEVC.2014.2350995","volume":"19","author":"X Cai","year":"2015","unstructured":"Cai, X., Li, Y., Fan, Z., Zhang, Q.: An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization. IEEE Trans. Evol. Comput. 19(4), 508\u2013523 (2015)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Exploration of Novel Intelligent Optimization Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-4109-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T12:00:27Z","timestamp":1727697627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-4109-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811941085","9789811941092"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-4109-2_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISICA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligence Computation and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Giangzhou","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isica2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gdstinfo.scau.edu.cn\/isica2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","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":"48","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":"48% - 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":"3","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)"}}]}}