{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:49:48Z","timestamp":1761598188385,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3425-6_56","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"703-713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["KnEA with Ensemble Approach for Parameter Selection for Many-Objective Optimization"],"prefix":"10.1007","author":[{"given":"Vikas","family":"Palakonda","sequence":"first","affiliation":[]},{"given":"Rammohan","family":"Mallipeddi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1, 32\u201349 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"13","key":"56_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 48(13), 1\u201335 (2015)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"56_CR3","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, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR4","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., Zheng, J.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17, 721\u2013736 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Tian, Y., Jin, Y.: A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19, 761\u2013776 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"11043","DOI":"10.1109\/ACCESS.2017.2716779","volume":"5","author":"V Palakonda","year":"2017","unstructured":"Palakonda, V., Mallipeddi, R.: Pareto dominance-based algorithms with ranking methods for many-objective optimization. IEEE Access 5, 11043\u201311053 (2017)","journal-title":"IEEE Access"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Palakonda, V., Ghorbanpour, S., Mallipeddi, R.: Pareto dominance-based MOEA with multiple ranking methods for many-objective optimization. In: 2018 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 958\u2013964 (2018)","DOI":"10.1109\/SSCI.2018.8628723"},{"key":"56_CR8","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, 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TEVC.2014.2339823","volume":"19","author":"M Asafuddoula","year":"2015","unstructured":"Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19, 445\u2013460 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR10","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., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TEVC.2018.2848921","volume":"23","author":"T Pamulapati","year":"2018","unstructured":"Pamulapati, T., Mallipeddi, R., Suganthan, P.N.: ISDE+\u2009- An indicator for multi and many-objective optimization. IEEE Trans. Evol. Comput. 23, 346\u2013352 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Wang, G., Jiang, H.: Fuzzy-dominance and its application in evolutionary many objective optimization. In: International Conference on Computational Intelligence and Security Workshops, CISW 2007, pp. 195\u2013198 (2007)","DOI":"10.1109\/CISW.2007.4425478"},{"key":"56_CR13","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, 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR14","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, 773\u2013791 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TEVC.2006.876362","volume":"11","author":"F Pierro di","year":"2007","unstructured":"di Pierro, F., Khu, S.-T., Savic, D.A.: An investigation on preference order ranking scheme for multiobjective evolutionary optimization. IEEE Trans. Evol. Comput. 11, 17\u201345 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR16","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TEVC.2014.2350987","volume":"19","author":"H Wang","year":"2015","unstructured":"Wang, H., Jiao, L., Yao, X.: Two_Arch2: an improved two-archive algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19, 524\u2013541 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR17","doi-asserted-by":"crossref","unstructured":"Ghorbanpour, S., Palakonda, V., Mallipeddi, R.: Ensemble of Pareto-based selections for many-objective optimization. In: 2018 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 981\u2013988 (2018)","DOI":"10.1109\/SSCI.2018.8628907"},{"key":"56_CR18","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2018.2802784","volume":"23","author":"L Pan","year":"2018","unstructured":"Pan, L., He, C., Tian, Y., Wang, H., Zhang, X., Jin, Y.: A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization. IEEE Trans. Evol. Comput. 23, 74\u201388 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR19","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.asoc.2017.08.024","volume":"61","author":"C He","year":"2017","unstructured":"He, C., Tian, Y., Jin, Y., Zhang, X., Pan, L.: A radial space division based evolutionary algorithm for many-objective optimization. Appl. Soft Comput. 61, 603\u2013621 (2017)","journal-title":"Appl. Soft Comput."},{"key":"56_CR20","doi-asserted-by":"publisher","first-page":"279","DOI":"10.3233\/ICA-170542","volume":"24","author":"L Pan","year":"2017","unstructured":"Pan, L., He, C., Tian, Y., Su, Y., Zhang, X.: A region division based diversity maintaining approach for many-objective optimization. Integr. Comput. Aided Eng. 24, 279\u2013296 (2017)","journal-title":"Integr. Comput. Aided Eng."},{"key":"56_CR21","doi-asserted-by":"crossref","unstructured":"Pan, L., Li, L., He, C., Tan, K.C.: A subregion division-based evolutionary algorithm with effective mating selection for many-objective optimization. IEEE Trans. Cybern. (2019)","DOI":"10.1109\/TCYB.2019.2906679"},{"key":"56_CR22","series-title":"Advanced Information and Knowledge Processing","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization","author":"K Deb","year":"2005","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. AI&KP, pp. 105\u2013145. Springer, London (2005). \nhttps:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"key":"56_CR23","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10, 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"56_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While, L., Hingston, P., Barone, L., Huband, S.: A faster algorithm for calculating hypervolume. IEEE Trans. Evol. Comput. 10, 29\u201338 (2006)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:36:31Z","timestamp":1585791391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_56","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"197","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":"121","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":"61% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}