{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:16:55Z","timestamp":1743110215110,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031138317"},{"type":"electronic","value":"9783031138324"}],"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-3-031-13832-4_63","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T11:32:22Z","timestamp":1660563142000},"page":"769-784","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization Improvement and Clustering Application Based on Moth-Flame Algorithm"],"prefix":"10.1007","author":[{"given":"Lvyang","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huajuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuxi","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S.: Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowl-Based Syst 89, 228\u2013249 (2015)","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"63_CR2","first-page":"187","volume":"44","author":"Y Bao","year":"2018","unstructured":"Bao, Y., Yin, B., Cao, J., et al.: Bayesian network structure learning based on moth-flame optimization algorithm. Comput. Eng. 44(1), 187\u2013192 (2018)","journal-title":"Comput. Eng."},{"issue":"3","key":"63_CR3","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.cma.2017.12.018","volume":"54","author":"W Wu","year":"2018","unstructured":"Wu, W., Li, Z., Lin, Z., et al.: Moth-flame optimization algorithm based on chaotic crisscross operator. Comput. Eng. Appl. 54(3), 136\u2013141 (2018)","journal-title":"Comput. Eng. Appl."},{"issue":"11","key":"63_CR4","first-page":"3231","volume":"38","author":"H Xu","year":"2018","unstructured":"Xu, H., Fang, C., Liu, X., Ye, Z.: Network intrusion detection system based on improved moth-flame optimization algorithm. J. Comput. Appl. 38(11), 3231\u20133235 (2018)","journal-title":"J. Comput. Appl."},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.eswa.2019.03.043","volume":"129","author":"Y Xu","year":"2019","unstructured":"Xu, Y., et al.: An efficient chaotic mutative moth-flame-inspired optimizer for global optimization tasks. Expert Syst. Appl. 129, 135\u2013155 (2019)","journal-title":"Expert Syst. Appl."},{"key":"63_CR6","doi-asserted-by":"publisher","first-page":"105277","DOI":"10.1016\/j.knosys.2019.105277","volume":"191","author":"D Pelusi","year":"2020","unstructured":"Pelusi, D., et al.: An improved moth-flame optimization algorithm with hybrid search phase-sciencedirect. Knowl.-Based Syst. 191, 105277 (2020)","journal-title":"Knowl.-Based Syst."},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"key":"63_CR8","unstructured":"Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of the ICNN95-International Conference on Neural Networks, vol. 4, 1942\u20131948. IEEE, (1995)"},{"key":"63_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Unconventional Computation and Natural Computation","author":"X-S Yang","year":"2012","unstructured":"Yang, X.-S.: Flower pollination algorithm for global optimization. In: Durand-Lose, J., Jonoska, N. (eds.) UCNC 2012. LNCS, vol. 7445, pp. 240\u2013249. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32894-7_27"},{"key":"63_CR10","unstructured":"Huang, H., Li, X., Wu, K., Guo, L., Wang, H., Ru, F., et al.: Hybrid iterative K-means clustering with improved moth-flame optimization. Comput. Eng. Appl., 253\u2013987 (2020)"},{"issue":"6","key":"63_CR11","first-page":"30","volume":"25","author":"P Zheng","year":"2006","unstructured":"Zheng, P., Wang, X., Chen, D., Chen, P.: Application of fuzzy cluster analysis in fabric variation comfortability evaluation. J. Tianjin Univ. Technol 25(6), 30\u201332 (2006)","journal-title":"J. Tianjin Univ. Technol"},{"issue":"7","key":"63_CR12","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1007\/s00521-018-3821-6","volume":"32","author":"K Kaur","year":"2018","unstructured":"Kaur, K., Singh, U., Salgotra, R.: An enhanced moth flame optimization. Neural Comput. Appl. 32(7), 2315\u20132349 (2018). https:\/\/doi.org\/10.1007\/s00521-018-3821-6","journal-title":"Neural Comput. Appl."},{"issue":"8","key":"63_CR13","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.3390\/sym12081234","volume":"12","author":"Y Li","year":"2020","unstructured":"Li, Y., Zhu, X., Liu, J.: An improved moth-flame optimization algorithm for engineering problems. Symmetry 12(8), 1234 (2020)","journal-title":"Symmetry"},{"issue":"15","key":"63_CR14","doi-asserted-by":"publisher","first-page":"6023","DOI":"10.1007\/s00500-018-3586-y","volume":"23","author":"S Sapre","year":"2018","unstructured":"Sapre, S., Mini, S.: Opposition-based moth flame optimization with Cauchy mutation and evolutionary boundary constraint handling for global optimization. Soft. Comput. 23(15), 6023\u20136041 (2018). https:\/\/doi.org\/10.1007\/s00500-018-3586-y","journal-title":"Soft. Comput."},{"issue":"14","key":"63_CR15","doi-asserted-by":"publisher","first-page":"9859","DOI":"10.1007\/s00521-019-04570-6","volume":"32","author":"M Shehab","year":"2019","unstructured":"Shehab, M., Abualigah, L., Al Hamad, H., Alabool, H., Alshinwan, M., Khasawneh, A.M.: Moth\u2013flame optimization algorithm: Variants and applications. Neural Comput. Appl. 32(14), 9859\u20139884 (2019). https:\/\/doi.org\/10.1007\/s00521-019-04570-6","journal-title":"Neural Comput. Appl."},{"issue":"4","key":"63_CR16","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1007\/s40998-019-00211-9","volume":"43","author":"H Buch","year":"2019","unstructured":"Buch, H., Trivedi, I.N.: An efficient adaptive moth flame optimization algorithm for solving large-scale optimal power flow problem with POZ, multifuel and valve-point loading effect. Iran. J. Sci. Technol. Trans. Electr. Eng. 43(4), 1031\u20131051 (2019)","journal-title":"Iran. J. Sci. Technol. Trans. Electr. Eng."},{"issue":"3","key":"63_CR17","doi-asserted-by":"publisher","first-page":"e2743","DOI":"10.1002\/etep.2743","volume":"29","author":"MA Taher","year":"2019","unstructured":"Taher, M.A., Kamel, S., Jurado, F., et al.: An improved moth-flame optimization algorithm for solving optimal power flow problem. Int. Trans. Electr. Energy Syst. 29(3), e2743 (2019)","journal-title":"Int. Trans. Electr. Energy Syst."},{"issue":"12","key":"63_CR18","doi-asserted-by":"publisher","first-page":"4434","DOI":"10.1007\/s10489-020-01793-2","volume":"50","author":"X Zhao","year":"2020","unstructured":"Zhao, X., Fang, Y., Liu, L., Li, J., Xu, M.: An improved moth-flame optimization algorithm with orthogonal opposition-based learning and modified position updating mechanism of moths for global optimization problems. Appl. Intell. 50(12), 4434\u20134458 (2020). https:\/\/doi.org\/10.1007\/s10489-020-01793-2","journal-title":"Appl. Intell."},{"issue":"5","key":"63_CR19","first-page":"668","volume":"7","author":"A Bhadoria","year":"2020","unstructured":"Bhadoria, A., Marwaha, S.: Moth flame optimizer-based solution approach for unit commitment and generation scheduling problem of electric power system. J. Comput. Des. Engi. 7(5), 668\u2013683 (2020)","journal-title":"J. Comput. Des. Engi."},{"issue":"5","key":"63_CR20","first-page":"1248","volume":"19","author":"JY Shi","year":"2019","unstructured":"Shi, J.Y., Zhang, D.Y., Xue, F., et al.: Moth-flame optimization-based maximum power point tracking for photovoltaic systems under partial shading conditions. J. Power Electron. 19(5), 1248\u20131258 (2019)","journal-title":"J. Power Electron."},{"key":"63_CR21","doi-asserted-by":"publisher","first-page":"105914","DOI":"10.1109\/ACCESS.2021.3100628","volume":"9","author":"X Dai","year":"2021","unstructured":"Dai, X., Wei, Y.: Application of improved moth-flame optimization algorithm for robot path planning. IEEE Access 9, 105914\u2013105925 (2021)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13832-4_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:14:23Z","timestamp":1710339263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13832-4_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031138317","9783031138324"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13832-4_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","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":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2022\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IC-ICC-CN","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"449","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":"209","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":"47% - 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":"2.5","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)"}}]}}