{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:26:48Z","timestamp":1742974008350,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812408"},{"type":"electronic","value":"9783031812415"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_12","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:18Z","timestamp":1735652718000},"page":"165-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Modified Jaya Optimization Algorithm: Application to\u00a0the\u00a0Solution of\u00a0Nonlinear Equation Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6032-2317","authenticated-orcid":false,"given":"Bruno","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6145-8520","authenticated-orcid":false,"given":"Luiz","family":"Guerreiro Lopes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"12_CR1","unstructured":"Bodon, E., Del Popolo, A., Luk\u0161an, L., Spedicato, E.: Numerical performance of ABS codes for systems of nonlinear equations. Technical Report DMSIA 01\/2001, Universit\u00e1 degli Studi di Bergamo, Bergamo (2001)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.energy.2019.04.159","volume":"178","author":"EE Elattar","year":"2019","unstructured":"Elattar, E.E., ElSayed, S.K.: Modified JAYA algorithm for optimal power flow incorporating renewable energy sources considering the cost, emission, power loss and voltage profile improvement. Energy 178, 598\u2013609 (2019). https:\/\/doi.org\/10.1016\/j.energy.2019.04.159","journal-title":"Energy"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/10556789708805664","volume":"8","author":"A Friedlander","year":"1997","unstructured":"Friedlander, A., Gomes-Ruggiero, M.A., Kozakevich, D.N., Mart\u00ednez, J.M., Santos, S.A.: Solving nonlinear systems of equations by means of quasi-Newton methods with a nonmonotone strategy. Optim. Methods Softw. 8(1), 25\u201351 (1997). https:\/\/doi.org\/10.1080\/10556789708805664","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.1016\/j.nonrwa.2008.03.006","volume":"10","author":"MJ Hirsch","year":"2009","unstructured":"Hirsch, M.J., Pardalos, P.M., Resende, M.G.C.: Solving systems of nonlinear equations with continuous GRASP. Nonlinear Anal. Real World Appl. 10(4), 2000\u20132006 (2009). https:\/\/doi.org\/10.1016\/j.nonrwa.2008.03.006","journal-title":"Nonlinear Anal. Real World Appl."},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0952-1976(97)00067-5","volume":"11","author":"CL Karr","year":"1998","unstructured":"Karr, C.L., Weck, B., Freeman, L.M.: Solutions to systems of nonlinear equations via genetic algorithms. Eng. Appl. Artif. Intell. 11(3), 369\u2013375 (1998). https:\/\/doi.org\/10.1016\/S0952-1976(97)00067-5","journal-title":"Eng. Appl. Artif. Intell."},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718898","volume-title":"Solving Nonlinear Equations with Newton\u2019s Method","author":"CT Kelley","year":"2003","unstructured":"Kelley, C.T.: Solving Nonlinear Equations with Newton\u2019s Method. SIAM, Philadelphia (2003)"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.3934\/jimo.2011.7.497","volume":"7","author":"CT Kelley","year":"2011","unstructured":"Kelley, C.T., Qi, L., Tong, X., Yin, H.: Finding a stable solution of a system of nonlinear equations. J. Ind. Manag. Optim. 7(2), 497\u2013521 (2011). https:\/\/doi.org\/10.3934\/jimo.2011.7.497","journal-title":"J. Ind. Manag. Optim."},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Kotsireas, I.S., Pardalos, P.M., Semenov, A., Trevena, W.T., Vrahatis, M.N.: Survey of methods for solving systems of nonlinear equations, Part I: root-finding approaches (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.08530","DOI":"10.48550\/arXiv.2208.08530"},{"key":"12_CR9","unstructured":"Liang, J.J., Qu, B.Y., Suganthan, P.N., Hern\u00e1ndez-D\u00edaz, A.G.: Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical Report 201212, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou (2013)"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981). https:\/\/doi.org\/10.1145\/355934.355936","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/B:NUMA.0000021762.83420.40","volume":"35","author":"R P\u00e9rez","year":"2004","unstructured":"P\u00e9rez, R., Lopes, V.L.R.: Recent applications and numerical implementation of quasi-Newton methods for solving nonlinear systems of equations. Numer. Alg. 35(2), 261\u2013285 (2004). https:\/\/doi.org\/10.1023\/B:NUMA.0000021762.83420.40","journal-title":"Numer. Alg."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5267\/j.ijiec.2015.8.004","volume":"7","author":"RV Rao","year":"2016","unstructured":"Rao, R.V.: Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int. J. Ind. Eng. Comput. 7, 19\u201334 (2016). https:\/\/doi.org\/10.5267\/j.ijiec.2015.8.004","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"12_CR13","volume-title":"Jaya: An Advanced Optimization Algorithm and Its Engineering Applications","author":"RV Rao","year":"2019","unstructured":"Rao, R.V.: Jaya: An Advanced Optimization Algorithm and Its Engineering Applications. Springer, Cham (2019)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.5267\/j.ijiec.2019.6.002","volume":"11","author":"RV Rao","year":"2020","unstructured":"Rao, R.V.: Rao algorithms: three metaphor-less simple algorithms for solving optimization problems. Int. J. Ind. Eng. Comput. 11, 107\u2013130 (2020). https:\/\/doi.org\/10.5267\/j.ijiec.2019.6.002","journal-title":"Int. J. Ind. Eng. Comput."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0036142995281504","volume":"34","author":"P Van Hentenryck","year":"1997","unstructured":"Van Hentenryck, P., McAllester, D., Kapur, D.: Solving polynomial systems using a branch and prune approach. SIAM J. Numer. Anal. 34(2), 797\u2013827 (1997). https:\/\/doi.org\/10.1137\/S0036142995281504","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0096-3003(79)90020-1","volume":"5","author":"LT Watson","year":"1979","unstructured":"Watson, L.T.: A globally convergent algorithm for computing fixed points of $$C^2$$ maps. Appl. Math. Comput. 5(4), 297\u2013311 (1979). https:\/\/doi.org\/10.1016\/0096-3003(79)90020-1","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF02510924","volume":"38","author":"K Yamamura","year":"1998","unstructured":"Yamamura, K., Kawata, H., Tokue, A.: Interval solution of nonlinear equations using linear programming. BIT Numer. Math. 38(1), 186\u2013199 (1998). https:\/\/doi.org\/10.1007\/BF02510924","journal-title":"BIT Numer. Math."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s11831-021-09585-8","volume":"29","author":"RA Zitar","year":"2022","unstructured":"Zitar, R.A., Al-Betar, M.A., Awadallah, M.A., Doush, I.A., Assaleh, K.: An intensive and comprehensive overview of JAYA algorithm, its versions and applications. Arch. Comput. Methods Eng. 29(2), 763\u2013792 (2022). https:\/\/doi.org\/10.1007\/s11831-021-09585-8","journal-title":"Arch. Comput. Methods Eng."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:03:44Z","timestamp":1735653824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}