{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:10:36Z","timestamp":1742969436293,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811555763"},{"type":"electronic","value":"9789811555770"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-5577-0_10","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:02:46Z","timestamp":1590411766000},"page":"127-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Multi-objective Evolutionary Algorithm Based on Space Partitioning"],"prefix":"10.1007","author":[{"given":"Xiaofang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changhe","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanyou","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"issue":"2","key":"10_CR1","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":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Hui, L.: 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":"5","key":"10_CR3","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(5), 721\u2013736 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TEVC.2017.2744674","volume":"22","author":"X Cai","year":"2017","unstructured":"Cai, X., Mei, Z., Fan, Z., Zhang, Q.: A constrained decomposition approach with grids for evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 22(4), 564\u2013577 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0167-7152(99)00095-4","volume":"46","author":"K Fang","year":"2000","unstructured":"Fang, K., Yang, Z.: On uniform design of experiments with restricted mixtures and generation of uniform distribution on some domains. Stat. Probab. Lett. 46(2), 113\u2013120 (2000)","journal-title":"Stat. Probab. Lett."},{"issue":"4","key":"10_CR6","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(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s10732-015-9301-6","volume":"21","author":"H Sato","year":"2015","unstructured":"Sato, H.: Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based MOEAs. J. Heuristics 21(6), 819\u2013849 (2015). \nhttps:\/\/doi.org\/10.1007\/s10732-015-9301-6","journal-title":"J. Heuristics"},{"issue":"16","key":"10_CR8","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1007\/s00500-016-2076-3","volume":"21","author":"S Yang","year":"2016","unstructured":"Yang, S., Jiang, S., Jiang, Y.: Improving the multiobjective evolutionary algorithm based on decomposition with new penalty schemes. Soft Comput. 21(16), 4677\u20134691 (2016). \nhttps:\/\/doi.org\/10.1007\/s00500-016-2076-3","journal-title":"Soft Comput."},{"issue":"5","key":"10_CR9","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":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TEVC.2013.2281533","volume":"18","author":"H Liu","year":"2014","unstructured":"Liu, H., Gu, F., Zhang, Q.: Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans. Evol. Comput. 18(3), 450\u2013455 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/TEVC.2011.2166159","volume":"16","author":"S Zhao","year":"2012","unstructured":"Zhao, S., Suganthan, P., Zhang, Q.: Decomposition-based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes. IEEE Trans. Evol. Comput. 16(3), 442\u2013446 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li, H., Zhang, Q.: Multiobjective optimization problems with complicated pareto sets, MOEA\/D and NSGA-II. IEEE Trans. Evol. Comput. 13(2), 284\u2013302 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1868","DOI":"10.1016\/j.neucom.2015.08.092","volume":"173","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Zhang, X., Gao, X., Song, S.: Self-organizing multiobjective optimization based on decomposition with neighborhood ensemble. Neurocomputing 173, 1868\u20131884 (2016)","journal-title":"Neurocomputing"},{"issue":"5","key":"10_CR14","first-page":"3677","volume":"8","author":"F Gu","year":"2012","unstructured":"Gu, F., Liu, H., Tan, K.: A multiobjective evolutionary algorithm using dynamic weight design method. Int. J. Innov. Comput. Inf. Control IJICIC 8(5), 3677\u20133688 (2012)","journal-title":"Int. J. Innov. Comput. Inf. Control IJICIC"}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-5577-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T13:04:14Z","timestamp":1590411854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-5577-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811555763","9789811555770"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-5577-0_10","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":"26 May 2020","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":"Guangzhou","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":"16 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isica2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/gdstinfo.cn\/isica2019\/","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"112","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":"45","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":"20","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":"40% - 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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}