{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:44:14Z","timestamp":1743086654295,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":26,"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_7","type":"book-chapter","created":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:38:26Z","timestamp":1659364706000},"page":"62-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Adaptive Reference Vector Strategy with Shape Estimation for Many-Objective Optimization Problem"],"prefix":"10.1007","author":[{"given":"Lei","family":"Yang","sequence":"first","affiliation":[]},{"given":"Shumin","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Binjie","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Song, Y., Liu, L., Ma, H., Vasilakos, A.V.: A biology-based algorithm to minimal exposure problem of wireless sensor networks. IEEE Trans. Netw. Serv. Manag. 11(3), 417\u2013430 (2014)","DOI":"10.1109\/TNSM.2014.2346080"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Liu, L., Song, Y., Zhang, H., Ma, H., Vasilakos, A.V.: Physarum optimization: a biology-inspired algorithm for the steiner tree problem in networks. IEEE Trans. Comput. 64(3), 818\u2013831 (2013)","DOI":"10.1109\/TC.2013.229"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.actaastro.2017.02.023","volume":"136","author":"R Chai","year":"2017","unstructured":"Chai, R., Savvaris, A., Tsourdos, A., Chai, S.: Multi-objective trajectory optimization of space manoeuvre vehicle using adaptive differential evolution and modified game theory. Acta Astronaut. 136, 273\u2013280 (2017)","journal-title":"Acta Astronaut."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.knosys.2015.09.006","volume":"89","author":"L Wu","year":"2015","unstructured":"Wu, L., Zuo, C., Zhang, H.: A cloud model based fruit fly optimization algorithm. Knowl.-Based Syst. 89, 603\u2013617 (2015)","journal-title":"Knowl.-Based Syst."},{"key":"7_CR5","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Springer Science & Business Media (2012)"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TEVC.2013.2258025","volume":"18","author":"Z He","year":"2013","unstructured":"He, Z., Yen, G.G., Zhang, J.: Fuzzy-based pareto optimality for many-objective evolutionary algorithms. IEEE Trans. Evol. Comput. 18(2), 269\u2013285 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2014","unstructured":"Li, K., Deb, K., Zhang, Q., Kwong, S.: An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans. Evol. Comput. 19(5), 694\u2013716 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2015.2443001","volume":"20","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Xu, H., Wang, B., Zhang, B., Yao, X.: Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans. Evol. Comput. 20(2), 180\u2013198 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"7","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1109\/TSMC.2017.2654301","volume":"48","author":"M Elarbi","year":"2017","unstructured":"Elarbi, M., Bechikh, S., Gupta, A., Said, L.B., Ong, Y.S.: A new decompositionbased nsga-ii for many-objective optimization. IEEE Trans. Syst. Man Cybern. Syst. 48(7), 1191\u20131210 (2017)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"5","key":"7_CR10","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773\u2013791 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/TEVC.2018.2848254","volume":"23","author":"C Liu","year":"2018","unstructured":"Liu, C., Zhao, Q., Yan, B., Elsayed, S., Ray, T., Sarker, R.: Adaptive sortingbased evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 23(2), 247\u2013257 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s10489-019-01569-3","volume":"50","author":"W Yang","year":"2020","unstructured":"Yang, W., Chen, L., Wang, Y., et al.: A reference points and intuitionistic fuzzy dominance based particle swarm algorithm for multi\/many-objective optimization. Appl. Intell. 50(4), 1133\u20131154 (2020)","journal-title":"Appl. Intell."},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s11831-020-09415-3","volume":"28","author":"R Behmanesh","year":"2021","unstructured":"Behmanesh, R., Rahimi, I., Gandomi, A.H.: Evolutionary many-objective algorithms for combinatorial optimization problems: a comparative study. Arch. Comput. Meth. Eng. 28(2), 673\u2013688 (2021)","journal-title":"Arch. Comput. Meth. Eng."},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1007\/s10489-020-01874-2","volume":"51","author":"Z Xiong","year":"2021","unstructured":"Xiong, Z., Yang, J., Hu, Z., et al.: Evolutionary many-objective optimization algorithm based on angle and clustering. Appl. Intell. 51(4), 2045\u20132062 (2021)","journal-title":"Appl. Intell."},{"issue":"6","key":"7_CR15","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":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2016","unstructured":"Ishibuchi, H., Setoguchi, Y., Masuda, H., Nojima, Y.: Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans. Evol. Comput. 21(2), 169\u2013190 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds) Evolutionary Multiobjective Optimization. Advanced Information and Knowledge Processing, pp. 105\u2013145. Springer, London (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6","DOI":"10.1007\/1-84628-137-7_6"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-31880-4_20","volume-title":"Evolutionary Multi-Criterion Optimization","author":"S Huband","year":"2005","unstructured":"Huband, S., Barone, L., While, L., Hingston, P.: A scalable multi-objective test problem toolkit. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 280\u2013295. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_20"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Cheng, R., Li, M., Tian, Y., Zhang, X., Yang, S., Jin, Y., Yao, X.: A benchmark test suite for evolutionary many-objective optimization. Complex Intell. Syst. 3(1), 67-81 (2017)","DOI":"10.1007\/s40747-017-0039-7"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TEVC.2018.2844286","volume":"23","author":"Z Wang","year":"2018","unstructured":"Wang, Z., Ong, Y.S., Ishibuchi, H.: On scalable multiobjective test problems with hardly dominated boundaries. IEEE Trans. Evol. Comput. 23(2), 217\u2013231 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"7_CR21","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TEVC.2018.2874465","volume":"23","author":"H Ge","year":"2018","unstructured":"Ge, H., et al.: A many-objective evolutionary algorithm with two interacting processes: Cascade clustering and reference point incremental learning. IEEE Trans. Evol. Comput. 23(4), 572\u2013586 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"7_CR22","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."},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2019.2909636","volume":"24","author":"Y Xiang","year":"2019","unstructured":"Xiang, Y., Zhou, Y., Yang, X., Huang, H.: A many-objective evolutionary algorithm with pareto-adaptive reference points. IEEE Trans. Evol. Comput. 24(1), 99\u2013113 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR24","unstructured":"Liu, S., et al.: A self-guided reference vector strategy for many-objective optimization. IEEE Trans. Cybern. (2020)"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","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 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","volume":"20","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Xu, H., Wang, B., Yao, X.: A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(1), 16\u201337 (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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T14:41:49Z","timestamp":1659364909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-4109-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811941085","9789811941092"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-4109-2_7","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)"}}]}}