{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:06:01Z","timestamp":1742911561879,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811929472"},{"type":"electronic","value":"9789811929489"}],"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-981-19-2948-9_21","type":"book-chapter","created":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T06:03:51Z","timestamp":1662012231000},"page":"217-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["WSAR with Levy Flight for Constrained Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4952-7239","authenticated-orcid":false,"given":"Adil","family":"Baykaso\u011flu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2105-6041","authenticated-orcid":false,"given":"M\u00fcmin Emre","family":"\u015eenol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.asoc.2015.10.036","volume":"56","author":"A Baykaso\u011flu","year":"2017","unstructured":"Baykaso\u011flu A, Akpinar \u015e (2017) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems\u2014part 1: unconstrained optimization. Appl Soft Comput 56:520\u2013540","journal-title":"Appl Soft Comput"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.asoc.2015.08.052","volume":"37","author":"A Baykaso\u011flu","year":"2015","unstructured":"Baykaso\u011flu A, Akpinar \u015e (2015) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems\u2014part 2: constrained optimization. Appl Soft Comput 37:396\u2013415","journal-title":"Appl Soft Comput"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"2555","DOI":"10.1007\/s12351-018-0427-9","volume":"20","author":"A Baykaso\u011flu","year":"2020","unstructured":"Baykaso\u011flu A, Ozsoydan FB, Senol ME (2020) Weighted superposition attraction algorithm for binary optimization problems. Oper Res Int J 20(4):2555\u20132581","journal-title":"Oper Res Int J"},{"key":"21_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.07.009","volume":"138","author":"A Baykaso\u011flu","year":"2019","unstructured":"Baykaso\u011flu A, \u015eenol ME (2019) Weighted superposition attraction algorithm for combinatorial optimization. Expert Syst Appl 138:112792","journal-title":"Expert Syst Appl"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Baykaso\u011flu A (2021) Optimizing cutting conditions for minimizing cutting time in multi-pass milling via weighted superposition attraction-repulsion (WSAR) algorithm. Int J Prod Res. http:\/\/doi.org\/10.1080\/00207543.2020.1767313","DOI":"10.1080\/00207543.2020.1767313"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Baykaso\u011flu A, Akpinar \u015e (2020) Enhanced superposition determination for weighted superposition attraction algorithm. Soft Comput 1\u201326","DOI":"10.1007\/s00500-020-04853-4"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Viswanathan GM, Buldyrev SV, Havlin S, Da Luz MGE, Raposo EP, Stanley HE (1999) Optimizing the success of random searches. Nature 401(6756):911\u2013914. Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191","DOI":"10.1038\/44831"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1243\/09544062JMES1732","volume":"224","author":"TH Kim","year":"2010","unstructured":"Kim TH, Maruta I, Sugie T (2010) A simple and efficient constrained particle swarm optimization and its application to engineering design problems. Proc Inst Mech Eng C J Mech Eng Sci 224(2):389\u2013400","journal-title":"Proc Inst Mech Eng C J Mech Eng Sci"},{"key":"21_CR9","unstructured":"Arora JS (1989) Introduction to optimum design. McGraw-Hill, New York"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.asoc.2015.06.056","volume":"36","author":"A Baykaso\u011flu","year":"2015","unstructured":"Baykaso\u011flu A, Ozsoydan FB (2015) Adaptive firefly algorithm with chaos for mechanical design optimization problems. Appl Soft Comput 36:152\u2013164","journal-title":"Appl Soft Comput"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/s10845-010-0393-4","volume":"23","author":"B Akay","year":"2012","unstructured":"Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. J Intell Manuf 23(4):1001\u20131014","journal-title":"J Intell Manuf"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/03052150410001647966","volume":"36","author":"CA Coello Coello","year":"2004","unstructured":"Coello Coello CA, Becerra RL (2004) Efficient evolutionary optimization through the use of a cultural algorithm. Eng Optim 36(2):219\u2013236","journal-title":"Eng Optim"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Mezura-Montes E, Coello CC, Landa-Becerra R (2003) Engineering optimization using simple evolutionary algorithm. In: Proceedings. 15th IEEE international conference on tools with artificial intelligence. IEEE, pp 149\u2013156","DOI":"10.1109\/TAI.2003.1250183"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10845-011-0621-6","volume":"24","author":"I Brajevic","year":"2013","unstructured":"Brajevic I, Tuba M (2013) An upgraded artificial bee colony (ABC) algorithm for constrained optimization problems. J Intell Manuf 24(4):729\u2013740","journal-title":"J Intell Manuf"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.asoc.2011.11.018","volume":"12","author":"A Baykasoglu","year":"2012","unstructured":"Baykasoglu A (2012) Design optimization with chaos embedded great deluge algorithm. Appl Soft Comput 12(3):1055\u20131067","journal-title":"Appl Soft Comput"},{"key":"21_CR16","unstructured":"Aguirre AH, Zavala AM, Diharce EV, Rionda SB (2007) COPSO: constrained optimization via PSO algorithm. Center for Research in Mathematics (CIMAT). Technical report no. I-07-04\/22-02-2007, 77"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","DOI":"10.1177\/003754970107600201"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Proceedings of 7th International Conference on Harmony Search, Soft Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-2948-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T06:21:00Z","timestamp":1662013260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-2948-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811929472","9789811929489"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-2948-9_21","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"2 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}