{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T14:53:22Z","timestamp":1769180002215,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789811929472","type":"print"},{"value":"9789811929489","type":"electronic"}],"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_41","type":"book-chapter","created":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T06:03:51Z","timestamp":1662012231000},"page":"427-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Novel Cosine Swarm Algorithm for Solving Optimization Problems"],"prefix":"10.1007","author":[{"given":"Priteesha","family":"Sarangi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhujit","family":"Mohapatra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,2]]},"reference":[{"key":"41_CR1","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 (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133","journal-title":"Knowl-Based Syst"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efd","year":"2013","unstructured":"Boussa\u00efd I, Lepagnot J, Siarry P (2013) A survey on optimization metaheuristics. Inf Sci 237:82\u2013117","journal-title":"Inf Sci"},{"issue":"1","key":"41_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJBIC.2011.038700","volume":"3","author":"RS Parpinelli","year":"2011","unstructured":"Parpinelli RS, Lopes HS (2011) New inspirations in swarm intelligence: a survey. Int J Bio-Inspired Computation 3(1):1\u201316","journal-title":"Int J Bio-Inspired Computation"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Yang X-S et al (eds) (2013) Swarm intelligence and bio-inspired computation: theory and applications. Newnes","DOI":"10.1016\/B978-0-12-405163-8.00001-6"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Li H-R, Gao Y-L (2009) Particle swarm optimization algorithm with exponent decreasing inertia weight and stochastic mutation. In: 2009 second international conference on information and computing science, vol 1. IEEE","DOI":"10.1109\/ICIC.2009.24"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Chen S (2012) Particle swarm optimization with pbest crossover. In: 2012 IEEE congress on evolutionary computation. IEEE","DOI":"10.1109\/CEC.2012.6256497"},{"issue":"5","key":"41_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ipl.2004.11.003","volume":"93","author":"XH Shi","year":"2005","unstructured":"Shi XH et al (2005) An improved GA and a novel PSO-GA-based hybrid algorithm. Inf Process Lett 93(5):255\u2013261","journal-title":"Inf Process Lett"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Blum C, Roli A (2008) Hybrid metaheuristics: an introduction. Hybrid metaheuristics. Springer, Berlin, pp 1\u201330","DOI":"10.1007\/978-3-540-78295-7_1"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Abd Elaziz M, Oliva D, Xiong S (2017) An improved opposition-based sine cosine algorithm for global optimization. Expert Syst Appl 90:484\u2013500","DOI":"10.1016\/j.eswa.2017.07.043"},{"issue":"10","key":"41_CR10","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1007\/s00521-017-2837-7","volume":"28","author":"R Sindhu","year":"2017","unstructured":"Sindhu R et al (2017) Sine\u2013cosine algorithm for feature selection with elitism strategy and new updating mechanism. Neural Comput Appl 28(10):2947\u20132958","journal-title":"Neural Comput Appl"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Attia A-F, El Sehiemy RA, Hasanien HM (2018) Optimal power flow solution in power systems using a novel Sine-Cosine algorithm. Int J Electr Power Energy Syst 99:331\u2013343","DOI":"10.1016\/j.ijepes.2018.01.024"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.eswa.2017.08.038","volume":"91","author":"S Li","year":"2018","unstructured":"Li S, Fang H, Liu X (2018) Parameter optimization of support vector regression based on sine cosine algorithm. Expert Syst Appl 91:63\u201377","journal-title":"Expert Syst Appl"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Nenavath H, Jatoth RK (2018) Hybridizing sine cosine algorithm with differential evolution for global optimization and object tracking. Appl Soft Comput 62:1019\u20131043","DOI":"10.1016\/j.asoc.2017.09.039"},{"issue":"2","key":"41_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.jcde.2017.08.002","volume":"5","author":"RM Rizk-Allah","year":"2018","unstructured":"Rizk-Allah RM (2018) Hybridizing sine cosine algorithm with multi-orthogonal search strategy for engineering design problems. J Comput Design Eng 5(2):249\u2013273","journal-title":"J Comput Design Eng"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.eswa.2018.10.050","volume":"119","author":"S Gupta","year":"2019","unstructured":"Gupta S, Deep K (2019) A hybrid self-adaptive sine cosine algorithm with opposition based learning. Expert Syst Appl 119:210\u2013230","journal-title":"Expert Syst Appl"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"103718","DOI":"10.1016\/j.engappai.2020.103718","volume":"93","author":"S Gupta","year":"2020","unstructured":"Gupta S, Deep K, Engelbrecht AP (2020) A memory guided sine cosine algorithm for global optimization. Eng Appl Artif Intell 93:103718","journal-title":"Eng Appl Artif Intell"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Gupta S et al (2020) A modified sine cosine algorithm with novel transition parameter and mutation operator for global optimization. Expert Syst Appl 154:113395","DOI":"10.1016\/j.eswa.2020.113395"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Abualigah L, Diabat A (2021) Advances in sine cosine algorithm: a comprehensive survey. Artif Intell Rev 1\u201342","DOI":"10.1007\/s10462-020-09909-3"}],"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_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T06:22:39Z","timestamp":1662013359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-2948-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811929472","9789811929489"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-2948-9_41","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"value":"2367-4512","type":"print"},{"value":"2367-4520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"2 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}