{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:54:36Z","timestamp":1725879276816},"publisher-location":"Singapore","reference-count":9,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811037276"},{"type":"electronic","value":"9789811037283"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-3728-3_4","type":"book-chapter","created":{"date-parts":[[2017,1,28]],"date-time":"2017-01-28T04:42:46Z","timestamp":1485578566000},"page":"22-31","source":"Crossref","is-referenced-by-count":0,"title":["A Comparative Study of Exploration Ability of Harmony Search Algorithms"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Yadav","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neha","family":"Yadav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joong Hoon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,29]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/TSMCB.2010.2046035","volume":"41","author":"S Das","year":"2011","unstructured":"Das, S., Mukhopadhyay, A., Roy, A., Abraham, A., Panigrahi, B.K.: Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization. IEEE Trans. Syst. Man Cybern. Part B Cybern. 41(1), 89\u2013106 (2011)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"issue":"2","key":"4_CR3","first-page":"1567","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. Comput. 188(2), 1567\u20131579 (2007)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"4_CR4","first-page":"643","volume":"198","author":"MGH Omran","year":"2008","unstructured":"Omran, M.G.H., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198(2), 643\u2013656 (2008)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"4_CR5","first-page":"830","volume":"216","author":"QK Pan","year":"2010","unstructured":"Pan, Q.K., Suganthan, P.N., Tasgetiren, M.F., Liang, J.J.: A self-adaptive global best harmony search algorithm for continuous optimization problems. Appl. Math. Comput. 216(3), 830\u2013848 (2010)","journal-title":"Appl. Math. Comput."},{"key":"4_CR6","first-page":"246","volume":"220","author":"A Yadav","year":"2013","unstructured":"Yadav, A., Deep, K.: Shrinking hypersphere based trajectory of particles in PSO. Appl. Math. Comput. 220, 246\u2013267 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"4_CR7","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.jocs.2013.05.011","volume":"5","author":"A Yadav","year":"2014","unstructured":"Yadav, A., Deep, K.: An efficient co-swarm particle swarm optimization for non-linear constrained optimization. J. Comput. Sci. 5(2), 258\u2013268 (2014)","journal-title":"J. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.swevo.2016.07.003","volume":"31","author":"A Yadav","year":"2016","unstructured":"Yadav, A., Deep, K., Kim, J.H., Nagar, A.K.: Gravitational swarm optimizer for global optimization. Swarm Evol. Comput. 31, 64\u201389 (2016)","journal-title":"Swarm Evol. Comput."},{"key":"4_CR9","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-662-47926-1_6","volume-title":"Harmony Search Algorithm","author":"A Yadav","year":"2016","unstructured":"Yadav, A., Yadav, N., Kim, J.H.: A study of harmony search algorithms: exploration and convergence ability. In: Kim, J.H., Geem, Z.W. (eds.) ICHSA2015. AISC, vol. 382, pp. 53\u201362. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-47926-1_6"}],"container-title":["Advances in Intelligent Systems and Computing","Harmony Search Algorithm"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3728-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T09:13:48Z","timestamp":1498382028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3728-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811037276","9789811037283"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3728-3_4","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]}}}