{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:03:07Z","timestamp":1743109387686,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"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_55","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"689-702","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Based on Fuzzy Non-dominant and Sparse Individuals to Improve Many-Objective Differential Evolutionary"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5131-1242","authenticated-orcid":false,"given":"Yulong","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomin","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yali","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"1","key":"55_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TEVC.2008.920677","volume":"13","author":"JG Herrero","year":"2009","unstructured":"Herrero, J.G., Berlang, A., et al.: Effective evolutionary algorithms for many-specifications attainment: application to air traffic control tracking filters. IEEE Trans. Evol. Comput. 13(1), 151\u2013168 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"55_CR2","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 Appl. Rev. 28(3), 392\u2013403 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"issue":"2","key":"55_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1109\/TAP.2007.915473","volume":"56","author":"SH Yeung","year":"2008","unstructured":"Yeung, S.H., Man, K.F., et al.: A trapeizform U-slot folded patch feed antenna design optimized with jumping genes evolutionary algorithm. IEEE Trans. Antennas Propag. 56(2), 571\u2013577 (2008)","journal-title":"IEEE Trans. Antennas Propag."},{"issue":"2","key":"55_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/TCBB.2007.070203","volume":"4","author":"J Handl","year":"2007","unstructured":"Handl, J., Kell, D.B., et al.: Multi-objective optimization in bioinformatics and computational biology. IEEE\/ACM Trans. Comput. Biol. Bioinf. 4(2), 279\u2013292 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"3","key":"55_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TEVC.2012.2196800","volume":"17","author":"A Ponsich","year":"2013","unstructured":"Ponsich, A., Jaimes, A.L., et al.: A survey on multi-objective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans. Evol. Comput. 17(3), 321\u2013344 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-0-387-36797-2","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"CC Coello","year":"2007","unstructured":"Coello, C.C., Gary, B.L., et al.: Evolutionary Algorithms for Solving Multi-Objective Problems, pp. 1\u2013140. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-0-387-36797-2"},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ins.2016.06.007","volume":"369","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Tian, Y., et al.: Approximate non-dominated sorting for evolutionary many-objective optimization. Inf. Sci. 369, 14\u201333 (2016)","journal-title":"Inf. Sci."},{"issue":"5","key":"55_CR8","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., 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."},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Gomez, R.H., Coello, C.A.C.: MOMBI: a new metaheuristic for many-objective optimization based on the R2 indicator. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 2488\u20132495. IEEE, New York (2013)","DOI":"10.1109\/CEC.2013.6557868"},{"key":"55_CR10","doi-asserted-by":"publisher","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference point based non-dominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. (2014). \nhttps:\/\/doi.org\/10.1109\/tevc.2013.2281535","DOI":"10.1109\/tevc.2013.2281535"},{"issue":"6","key":"55_CR11","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":"55_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ins.2014.02.002","volume":"268","author":"AL Jaimes","year":"2014","unstructured":"Jaimes, A.L., Coello, C., et al.: Objective space partitioning using conflict information for solving many-objective problems. Inf. Sci. 268, 305\u2013327 (2014)","journal-title":"Inf. Sci."},{"key":"55_CR13","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.cor.2012.01.001","volume":"40","author":"Y Tan","year":"2013","unstructured":"Tan, Y., Jiao, Y., et al.: MOEA\/D uniform design: a new version of MOEA\/D for optimization problems with many objectives. Comput. Oper. Res. 40, 1648\u20131660 (2013)","journal-title":"Comput. Oper. Res."},{"key":"55_CR14","unstructured":"Xu, Y., Pan, X.: A method of efficient three-objective differential Evolution using Pareto non-dominant relation. Res. Comput. Appl. 36(03), 817\u2013823+828 (2019)"},{"issue":"9","key":"55_CR15","first-page":"2547","volume":"34","author":"Y Xu","year":"2014","unstructured":"Xu, Y., Fang, J.: A fast multi-objective differential evolutionary algorithm based on non-dominant solution ordering. Res. Comput. Appl. 34(9), 2547\u20132551 (2014)","journal-title":"Res. Comput. Appl."},{"issue":"27","key":"55_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.01.004","volume":"4","author":"S Das","year":"2016","unstructured":"Das, S., Mullick, S.S., et al.: Recent advances in differential evolution-an updated survey. Swarm Evol. Comput. 4(27), 1\u201330 (2016)","journal-title":"Swarm Evol. Comput."},{"issue":"8","key":"55_CR17","first-page":"173","volume":"26","author":"T Xie","year":"2003","unstructured":"Xie, T., Chen, H., et al.: An evolutionary algorithm for multi-objective optimization. Comput. J. 26(8), 173\u2013181 (2003)","journal-title":"Comput. J."},{"issue":"2","key":"55_CR18","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., 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."}],"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_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:02:47Z","timestamp":1585789367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_55","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)"}}]}}