{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T19:46:13Z","timestamp":1774381573641,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031488788","type":"print"},{"value":"9783031488795","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-48879-5_14","type":"book-chapter","created":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T08:03:12Z","timestamp":1701244992000},"page":"171-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Trigonometric Mutation-Based Backtracking Search Algorithm for\u00a0Solving Optimal Power Flow Problem Considering Renewable Energy Sources"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2654-7453","authenticated-orcid":false,"given":"Sriparna","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3433-5808","authenticated-orcid":false,"given":"Provas Kumar","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8453-5659","authenticated-orcid":false,"given":"Pradip Kumar","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,30]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1007\/s00521-016-2794-6","volume":"30","author":"IN Trivedi","year":"2018","unstructured":"Trivedi, I.N., Jangir, P., Parmar, S.A., Jangir, N.: Optimal power flow with voltage stability improvement and loss reduction in power system using moth-flame optimizer. Neural Comput. Appl. 30(6), 1889\u20131904 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/s12652-020-02089-6","volume":"12","author":"M Abbasi","year":"2021","unstructured":"Abbasi, M., Abbasi, E., Mohammadi-Ivatloo, B.: Single and multi-objective optimal power flow using a new differential-based harmony search algorithm. J. Ambient Intell. Humaniz. Comput. 12(1), 851\u2013871 (2021)","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"key":"14_CR3","series-title":"Lecture Notes on Data Engineering and Communications Technologies","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/978-3-030-36178-5_72","volume-title":"Artificial Intelligence and Applied Mathematics in Engineering Problems","author":"S Duman","year":"2020","unstructured":"Duman, S., Wu, L., Li, J.: Moth swarm algorithm based approach for the ACOPF considering wind and tidal energy. In: Hemanth, D.J., Kose, U. (eds.) ICAIAME 2019. LNDECT, vol. 43, pp. 830\u2013843. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36178-5_72"},{"issue":"12","key":"14_CR4","doi-asserted-by":"publisher","first-page":"6775","DOI":"10.1007\/s00521-020-05455-9","volume":"33","author":"E Kaymaz","year":"2021","unstructured":"Kaymaz, E., Duman, S., Guvenc, U.: Optimal power flow solution with stochastic wind power using the L\u00e9vy coyote optimization algorithm. Neural Comput. Appl. 33(12), 6775\u20136804 (2021)","journal-title":"Neural Comput. Appl."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Fernandes, I.G., Pereira, F.B., Gomes, T.L., S\u00e1, B.F.: An optimal power flow approach including wind and tidal generation. In: IEEE PES Innovative Smart Grid Technologies Conference-Latin America (ISGT Latin America), pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/ISGT-LA.2019.8895402"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106252","volume":"91","author":"W Warid","year":"2020","unstructured":"Warid, W.: Optimal power flow using the AMTPG-Jaya algorithm. Appl. Soft Comput. 91, 106252 (2020)","journal-title":"Appl. Soft Comput."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"10865","DOI":"10.1007\/s00500-019-04590-3","volume":"24","author":"M Kaur","year":"2020","unstructured":"Kaur, M., Narang, N.: An integrated optimization technique for optimal power flow solution. Soft Comput. 24, 10865\u201310882 (2020)","journal-title":"Soft Comput."},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"4901","DOI":"10.1007\/s13369-014-1164-x","volume":"39","author":"AM Abusorrah","year":"2014","unstructured":"Abusorrah, A.M.: The application of the linear adaptive genetic algorithm to optimal power flow problem. Arab. J. Sci. Eng. 39(6), 4901\u20134909 (2014)","journal-title":"Arab. J. Sci. Eng."},{"issue":"6\u20137","key":"14_CR9","first-page":"584","volume":"49","author":"E Akbari","year":"2022","unstructured":"Akbari, E., Ghasemi, M., Gil, M., Rahimnejad, A., Andrew Gadsden, S.: Optimal power flow via teaching-learning-studying-based optimization algorithm. Electric Power Compon. Syst. 49(6\u20137), 584\u2013601 (2022)","journal-title":"Electric Power Compon. Syst."},{"issue":"15","key":"14_CR10","first-page":"8121","volume":"219","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu, P.: Backtracking search optimization algorithm for numerical optimization problems. Appl. Math. Comput. 219(15), 8121\u20138144 (2013)","journal-title":"Appl. Math. Comput."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-47650-6_33","volume-title":"Knowledge Science, Engineering and Management","author":"W Zhao","year":"2016","unstructured":"Zhao, W., Wang, L., Wang, B., Yin, Y.: Best guided backtracking search algorithm for numerical optimization problems. In: Lehner, F., Fteimi, N. (eds.) KSEM 2016. LNCS (LNAI), vol. 9983, pp. 414\u2013425. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47650-6_33"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1024653025686","volume":"27","author":"HY Fan","year":"2003","unstructured":"Fan, H.Y., Lampinen, J.: A trigonometric mutation operation to differential evolution. J. Glob. Optim. 27(1), 105\u2013129 (2003)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"14_CR13","first-page":"1349","volume":"10","author":"A Agwa","year":"2020","unstructured":"Agwa, A.: Interior search optimization algorithm for modeling power curve of wind turbine. Int. J. Renew. Energy Res. (IJRER) 10(3), 1349\u20131358 (2020)","journal-title":"Int. J. Renew. Energy Res. (IJRER)"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence in Communications and Business Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48879-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T08:14:35Z","timestamp":1701245675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48879-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,30]]},"ISBN":["9783031488788","9783031488795"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48879-5_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,30]]},"assertion":[{"value":"30 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICBA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Intelligence in Communications and Business Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalyani","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"27 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cicba2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cicba.in","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":"https:\/\/easychair.org\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"187","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":"52","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":"28% - 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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}