{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:44:07Z","timestamp":1743011047416,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366215"},{"type":"electronic","value":"9783031366222"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36622-2_35","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"425-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modified Brain Storm Optimization Algorithm for\u00a0Solving Multimodal Multiobjective Optimization Problems"],"prefix":"10.1007","author":[{"given":"Yue","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5129-995X","authenticated-orcid":false,"given":"Shi","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Xueping","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuyuan","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"17039","DOI":"10.1109\/ACCESS.2018.2811542","volume":"6","author":"S Cheng","year":"2018","unstructured":"Cheng, S., Chen, J., Lei, X., Shi, Y.: Locating multiple optima via brain storm optimization algorithms. IEEE Access 6, 17039\u201317049 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2811542","journal-title":"IEEE Access"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-31880-4_4","volume-title":"Evolutionary Multi-Criterion Optimization","author":"K Deb","year":"2005","unstructured":"Deb, K., Tiwari, S.: Omni-optimizer: a procedure for single and multi-objective optimization. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 47\u201361. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_4"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.swevo.2019.06.010","volume":"49","author":"Z Li","year":"2019","unstructured":"Li, Z., Shi, L., Yue, C., Shang, Z., Qu, B.: Differential evolution based on reinforcement learning with fitness ranking for solving multimodal multiobjective problems. Swarm Evol. Comput. 49, 234\u2013244 (2019). https:\/\/doi.org\/10.1016\/j.swevo.2019.06.010","journal-title":"Swarm Evol. Comput."},{"key":"35_CR4","doi-asserted-by":"publisher","unstructured":"Liang, J.J., Yue, C.T., Qu, B.Y.: Multimodal multi-objective optimization: a preliminary study. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2454\u20132461 (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7744093","DOI":"10.1109\/CEC.2016.7744093"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-319-93815-8_52","volume-title":"Advances in Swarm Intelligence","author":"J Liang","year":"2018","unstructured":"Liang, J., Guo, Q., Yue, C., Qu, B., Yu, K.: A self-organizing multi-objective particle swarm optimization algorithm for multimodal multi-objective problems. In: Tan, Y., Shi, Y., Tang, Q. (eds.) ICSI 2018. LNCS, vol. 10941, pp. 550\u2013560. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93815-8_52"},{"issue":"4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TEVC.2018.2879406","volume":"23","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Yen, G.G., Gong, D.: A multimodal multiobjective evolutionary algorithm using two-archive and recombination strategies. IEEE Trans. Evol. Comput. 23(4), 660\u2013674 (2019). https:\/\/doi.org\/10.1109\/TEVC.2018.2879406","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"35_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.4018\/jsir.2011100103","volume":"2","author":"Y Shi","year":"2011","unstructured":"Shi, Y.: An optimization algorithm based on brainstorming process. Int. J. Swarm Intell. Res. (IJSIR) 2(4), 35\u201362 (2011). https:\/\/doi.org\/10.4018\/jsir.2011100103","journal-title":"Int. J. Swarm Intell. Res. (IJSIR)"},{"issue":"5","key":"35_CR8","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TEVC.2017.2754271","volume":"22","author":"C Yue","year":"2018","unstructured":"Yue, C., Qu, B., Liang, J.: A multiobjective particle swarm optimizer using ring topology for solving multimodal multiobjective problems. IEEE Trans. Evol. Comput. 22(5), 805\u2013817 (2018). https:\/\/doi.org\/10.1109\/TEVC.2017.2754271","journal-title":"IEEE Trans. Evol. Comput."},{"key":"35_CR9","doi-asserted-by":"publisher","unstructured":"Zeng, C.: Improved swarm intelligence algorithm and application for multimodal optimization problems. Master\u2019s thesis, Beijing University of Chemical Technology, Beijing (2020). https:\/\/doi.org\/10.26939\/d.cnki.gbhgu.2020.001010","DOI":"10.26939\/d.cnki.gbhgu.2020.001010"},{"issue":"5","key":"35_CR10","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TEVC.2009.2021467","volume":"13","author":"A Zhou","year":"2009","unstructured":"Zhou, A., Zhang, Q., Jin, Y.: Approximating the set of pareto-optimal solutions in both the decision and objective spaces by an estimation of distribution algorithm. IEEE Trans. Evol. Comput. 13(5), 1167\u20131189 (2009). https:\/\/doi.org\/10.1109\/TEVC.2009.2021467","journal-title":"IEEE Trans. Evol. Comput."},{"key":"35_CR11","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. Technical report, TIK-Report 103, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36622-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:19:27Z","timestamp":1710260367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36622-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366215","9783031366222"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36622-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","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":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","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":"170","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":"81","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":"2.6","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)"}}]}}