{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:32:16Z","timestamp":1743100336556,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398100"},{"type":"electronic","value":"9783031398117"}],"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-39811-7_20","type":"book-chapter","created":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T18:01:28Z","timestamp":1693159288000},"page":"246-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Hybrid Local Search Algorithm for Solving Optimization Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5019-9973","authenticated-orcid":false,"given":"A.","family":"Baskar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6921-1178","authenticated-orcid":false,"given":"M.","family":"Anthony Xavior","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0801001","volume":"1","author":"WC Davidon","year":"1991","unstructured":"Davidon, W.C.: Variable metric method for minimization. SIAM J. Optim. 1(1), 1\u201317 (1991)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R Fletcher","year":"1963","unstructured":"Fletcher, R., Powell, M.J.: A rapidly convergent descent method for minimization. Comput. J. 6(2), 163\u2013168 (1963)","journal-title":"Comput. J."},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF01588967","volume":"14","author":"MJ Powell","year":"1978","unstructured":"Powell, M.J.: Algorithms for nonlinear constraints that use Lagrangian functions. Math. Program. 14(1), 224\u2013248 (1978)","journal-title":"Math. Program."},{"key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT press, London (1992)"},{"key":"20_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/9781108980647","volume-title":"Engineering Design Optimization","author":"JR Martins","year":"2021","unstructured":"Martins, J.R., Ning, A.: Engineering Design Optimization. Cambridge University Press, Cambridge (2021)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Global Optim. 56(3), 1247\u20131293 (2013)","journal-title":"J. Global Optim."},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R Hooke","year":"1961","unstructured":"Hooke, R., Jeeves, T.A.: Direct search solution of numerical and statistical problems. J. ACM 8(2), 212\u2013229 (1961)","journal-title":"J. ACM"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 302\u2013311. Association for Computing Machinery, New York (1984)","DOI":"10.1145\/800057.808695"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Comput. Syst. 39(4), 525\u2013544 (2006)","journal-title":"Theory of Comput. Syst."},{"issue":"1","key":"20_CR10","first-page":"19","volume":"7","author":"R Rao","year":"2016","unstructured":"Rao, R.: Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int. J. Ind. Eng. Comput. 7(1), 19\u201334 (2016)","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: SCA: a sine cosine algorithm for solving optimization problems. Knowl.-Based Syst. 96, 120\u2013133 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"issue":"6","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.6180\/jase.202212_25(6).0020","volume":"25","author":"A Baskar","year":"2022","unstructured":"Baskar, A.: New simple trigonometric algorithms for solving optimization problems. J. Applied Sci. Eng. 25(6), 1105\u20131120 (2022). https:\/\/doi.org\/10.6180\/jase.202212_25(6).0020","journal-title":"J. Applied Sci. Eng."},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Baskar, A.: Sine (B): a single randomized population-based algorithm for solving optimization problems. Materials Today \u2013 Proceedings 62(7), 4745\u20134751 (2022). https:\/\/doi.org\/10.1016\/j.matpr.2022.03.253","DOI":"10.1016\/j.matpr.2022.03.253"},{"key":"20_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M., Gandomi, A.H.: The arithmetic optimization algorithm. Comput. Methods Appl. Mech. Eng. 376, 113609 (2021)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"8","key":"20_CR16","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0255703","volume":"16","author":"JO Agushaka","year":"2021","unstructured":"Agushaka, J.O., Ezugwu, A.E.: Advanced arithmetic optimization algorithm for solving mechanical engineering design problems. PLoS ONE 16(8), e0255703 (2021). https:\/\/doi.org\/10.1371\/journal.pone.0255703","journal-title":"PLoS ONE"},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s10489-020-01893-z","volume":"51","author":"FA Hashim","year":"2020","unstructured":"Hashim, F.A., Hussain, K., Houssein, E.H., Mabrouk, M.S., Al-Atabany, W.: Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems. Appl. Intell. 51(3), 1531\u20131551 (2020)","journal-title":"Appl. Intell."},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"20_CR19","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."},{"issue":"18","key":"20_CR20","doi-asserted-by":"publisher","first-page":"14701","DOI":"10.1007\/s00521-020-04823-9","volume":"32","author":"H Mohammed","year":"2020","unstructured":"Mohammed, H., Rashid, T.: A novel hybrid GWO with WOA for global numerical optimization and solving pressure vessel design. Neural Comput. Appl. 32(18), 14701\u201314718 (2020)","journal-title":"Neural Comput. Appl."},{"key":"20_CR21","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/8718571","author":"HM Mohammed","year":"2019","unstructured":"Mohammed, H.M., Umar, S.U., Rashid, T.A.: A systematic and meta-analysis survey of whale optimization algorithm. Comput. Intell. Neurosci. (2019). https:\/\/doi.org\/10.1155\/2019\/8718571","journal-title":"Comput. Intell. Neurosci."},{"issue":"11","key":"20_CR22","doi-asserted-by":"publisher","first-page":"2385","DOI":"10.1080\/01605682.2021.1984185","volume":"73","author":"A Baskar","year":"2021","unstructured":"Baskar, A., Anthony Xavior, M.: A four-point direction search heuristic algorithm applied to facility location on plane, sphere, and ellipsoid surfaces. J. Operational Res. Soc. 73(11), 2385\u20132394 (2021). https:\/\/doi.org\/10.1080\/01605682.2021.1984185","journal-title":"J. Operational Res. Soc."},{"key":"20_CR23","unstructured":"Test Functions Homepage. http:\/\/infinity77.net\/global_optimization\/test_functions.html. Accessed 01 Nov 2021"},{"key":"20_CR24","unstructured":"Price, K.V., Awad, N.H., Ali, M.Z., Suganthan, P.N.: The 100-digit challenge: problem definitions and evaluation criteria for the 100-digit challenge special session and competition on single objective numerical optimization. Nanyang Technological University (2018)"},{"key":"20_CR25","unstructured":"Syedalimirjalili Homepage. https:\/\/seyedalimirjalili.com\/aoa. Accessed 4 Nov 2021"}],"container-title":["IFIP Advances in Information and Communication Technology","Computer, Communication, and Signal Processing. AI, Knowledge Engineering and IoT for Smart Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39811-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T12:03:21Z","timestamp":1698581001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39811-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398100","9783031398117"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39811-7_20","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCSP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer, Communication, and Signal Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","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":"4 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icccsp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icccsp.com\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","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":"17","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":"9","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":"14% - 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":"4","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)"}}]}}