{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:53:30Z","timestamp":1742950410125,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811961342"},{"type":"electronic","value":"9789811961359"}],"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-6135-9_12","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T14:04:46Z","timestamp":1666274686000},"page":"150-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Many-Objective Artificial Bee Colony Algorithm Based on\u00a0Decomposition and\u00a0Dimension Learning"],"prefix":"10.1007","author":[{"given":"Shuai","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zichen","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiali","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2019.2909744","volume":"24","author":"R Tanabe","year":"2020","unstructured":"Tanabe, R., Ishibuchi, H.: A review of evolutionary multimodal multiobjective optimization. IEEE Trans. Evol. Comput. 24(1), 193\u2013200 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"12_CR2","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":"1","key":"12_CR3","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."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Li, H.: MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Tran. Evol. Comput. 11(6), 712\u2013731 (2007)","DOI":"10.1109\/TEVC.2007.892759"},{"key":"12_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1109\/TEVC.2008.925798"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Liu, W., Li, H.: The performance of a new version of MOEA\/D on CEC09 unconstrained MOP test instances. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 203\u2013208 (2009)","DOI":"10.1109\/CEC.2009.4982949"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ins.2010.07.015","volume":"192","author":"B Akay","year":"2012","unstructured":"Akay, B., Karaboga, D.: A modified artificial bee colony algorithm for realparameter optimization. Inf. Sci. 192, 120\u2013142 (2012)","journal-title":"Inf. Sci."},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.asoc.2014.06.035","volume":"23","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B.: A quick artificial bee colony (qABC) algorithm and its performance on optimization problems. Appl. Soft Comput. 23(1), 227\u2013238 (2014)","journal-title":"Appl. Soft Comput."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ins.2020.03.064","volume":"527","author":"H Wang","year":"2020","unstructured":"Wang, H., Wang, W.J., Xiao, S.Y., Cui, Z.H., Xu, M.Y., Zhou, X.Y.: Improving ar tifificial Bee colony algorithm using a new neighborhood selection mechanism. Inf. Sci. 527, 227\u2013240 (2020)","journal-title":"Inf. Sci."},{"key":"12_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106955","volume":"100","author":"S Xiao","year":"2021","unstructured":"Xiao, S., Wang, H., Wang, W., Huang, Z., Zhou, X., Xu, M.: Artificial bee colony algorithm based on adaptive neighborhood search and Gaussian perturbation. Appl. Soft Comput. 100, 106955 (2021)","journal-title":"Appl. Soft Comput."},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Ye, T.Y., Zeng, T., Zhang, L.Q., Xu, M., Wang, H., Hu, M.: Artificial bee colony algorithm with an adaptive search manner. In: Neural Computing for Advanced Applications, pp. 486\u2013497. Springer Singapore, Singapore (2021). https:\/\/doi.org\/10.1007\/s00521-022-06981-4","DOI":"10.1007\/s00521-022-06981-4"},{"key":"12_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-981-16-5188-5_34","volume-title":"Neural Computing for Advanced Applications","author":"T Zeng","year":"2021","unstructured":"Zeng, T., Ye, T., Zhang, L., Xu, M., Wang, H., Hu, M.: Population diversity guided dimension perturbation for artificial bee colony algorithm. In: Zhang, H., Yang, Z., Zhang, Z., Wu, Z., Hao, T. (eds.) NCAA 2021. CCIS, vol. 1449, pp. 473\u2013485. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-16-5188-5_34"},{"key":"12_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116332","volume":"192","author":"T Zeng","year":"2022","unstructured":"Zeng, T., et al.: Artificial bee colony based on adaptive search strategy and random grouping mechanism. Expert Syst. Appl. 192, 116332 (2022)","journal-title":"Expert Syst. Appl."},{"key":"12_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108306","volume":"241","author":"TY Ye","year":"2022","unstructured":"Ye, T.Y., et al.: Artificial bee colony algorithm with efficient search strategy based on random neighborhood structure. Knowl.-Based Syst. 241, 108306 (2022)","journal-title":"Knowl.-Based Syst."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Ye, T.Y., Wang, H., Wang, W.J., Zeng, T., Zhang, L.Q., Huang, Z.K.: Artificial bee colony algorithm with an adaptive search manner and dimension perturbation. Neural Computing and Applications (2022)","DOI":"10.1007\/s00521-022-06981-4"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Zou, W., Zhu, Y., Chen, H., Zhang, B.: Solving multiobjective optimization problems using artificial bee colony algorithm. Discrete Dyn. Nature Soc. 11(2), 1\u201337 (2011)","DOI":"10.1155\/2011\/569784"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Akbari, R., Hedayatzadeh, R., Ziarati, K., Hassanizadeh, B.: A multi-objective artificial bee colony algorithm. Swarm Evol. Comput. 2, 39\u201352 (2012)","DOI":"10.1016\/j.swevo.2011.08.001"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"B. Akay.: Synchronous and asynchronous Pareto-based multi-objective artificial bee colony algorithms. J. Global Opt. 57(2), 415\u2013445 (2013)","DOI":"10.1007\/s10898-012-9993-1"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Zhou, Y., Liu, H.: An elitism based multi-objective artificial bee colony algorithm. Europ. J. Oper. Res. 245(1), 168\u2013193 (2015)","DOI":"10.1016\/j.ejor.2015.03.005"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, G., Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl. Math. Comput. 217(7), 3166\u20133173 (2010)","DOI":"10.1016\/j.amc.2010.08.049"},{"key":"12_CR21","doi-asserted-by":"crossref","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 (2016)","DOI":"10.1109\/TEVC.2015.2443001"},{"key":"12_CR22","doi-asserted-by":"crossref","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)","DOI":"10.1109\/TEVC.2016.2519378"}],"container-title":["Communications in Computer and Information Science","Neural Computing for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-6135-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T14:07:47Z","timestamp":1666274867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-6135-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811961342","9789811961359"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-6135-9_12","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":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Computing for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ncaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dl2link.com\/ncaa2022\/","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":"205","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":"77","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":"38% - 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.09","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.68","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)"}}]}}