{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:35:09Z","timestamp":1777703709677,"version":"3.51.4"},"reference-count":20,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2017,3,29]],"date-time":"2017-03-29T00:00:00Z","timestamp":1490745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2017,3,29]]},"abstract":"<jats:p>Evolutionary Algorithms (EA) are robust optimization approaches which have been successfully applied to a wide range of problems. However, these well-established metaheuristic strategies are computationally expensive because of their slow convergence rate. Opposition Based Learning (OBL) theory has managed to alleviate this problem to some extent. Through simultaneous consideration of estimates and counter estimates of a candidate solution within a definite search space, better approximation of the candidate solution can be achieved. Although it addresses the slow convergence rate to some extent, it is far from alleviating it completely. The present work proposes a novel approach towards improving the performance of OBL theory by allowing the exploration of a larger search space when computing the candidate solution. Instead of considering all the components of the candidate solution simultaneously, the proposed method considers each of component individually and attempts to find the best possible combination by using a metaheuristic technique. In the present work, this improved Opposition learning theory has been integrated with the classical HS algorithm, to accelerate its convergence rate. A comparative analysis of the proposed method against classical Opposition Based Learning has been performed on a comprehensive set of benchmark functions to prove its superior performance.<\/jats:p>","DOI":"10.3233\/jifs-169262","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T18:23:38Z","timestamp":1490984618000},"page":"3189-3199","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":16,"title":["A novel Harmony Search algorithm embedded with metaheuristic Opposition Based Learning"],"prefix":"10.1177","volume":"32","author":[{"given":"Ritesh","family":"Sarkhel","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Jadavpur University, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tithi Mitra","family":"Chowdhury","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Jadavpur University, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayuk","family":"Das","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Jadavpur University, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nibaran","family":"Das","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Jadavpur University, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mita","family":"Nasipuri","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Jadavpur University, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,3,29]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"8","article-title":"Designing electronic circuits using evolutionary algorithms. arithmetic circuits: A case study","author":"Miller J.","year":"1997","unstructured":"MillerJ., ThomsonP. and FogartyT., Designing electronic circuits using evolutionary algorithms. arithmetic circuits: A case study, Genetic Algorithms and Evolution Strategies in Engineering and Computer science (1997), 8.","journal-title":"Genetic Algorithms and Evolution Strategies in Engineering and Computer science"},{"key":"e_1_3_2_3_2","first-page":"1","article-title":"Evolving cellular automata with genetic algorithms: A review of recent work","author":"Mitchell M.","year":"1996","unstructured":"MitchellM., CrutchfieldJ. and DasR., Evolving cellular automata with genetic algorithms: A review of recent work, Proceedings of the First International (1996), 1\u201314.","journal-title":"Proceedings of the First International"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"e_1_3_2_5_2","unstructured":"TizhooshH.R. Reinforcement Learning Based on Actions and Opposite Actions (2005) 19\u201321."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"e_1_3_2_7_2","first-page":"1942","article-title":"Particle swarm optimization. Neural Networks, 1995. Proceedings","volume":"4","author":"Kennedy J.","year":"1995","unstructured":"KennedyJ. and EberhartR., Particle swarm optimization. Neural Networks, 1995. Proceedings., IEEE International Conference on4 (1995), 1942\u20131948.","journal-title":"IEEE International Conference on"},{"issue":"2","key":"e_1_3_2_8_2","first-page":"60","article-title":"Optimization Algorithm","volume":"76","author":"Geem Z.W.","year":"2001","unstructured":"GeemZ.W., KimJ.H. and LoganathanG., Optimization Algorithm, Simulation76(2) (2001), 60\u201368.","journal-title":"Simulation"},{"key":"e_1_3_2_9_2","unstructured":"BaghaeeH.R. MirsalimM. and GharehpetianG.B. Application of Harmony Search Algorithm in Power Engineering."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052150500467430"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2007.06.006"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2004.01.002"},{"key":"e_1_3_2_13_2","first-page":"155","article-title":"Opposition-based differential evolution","volume":"143","author":"Rahnamayan S.","year":"2008","unstructured":"RahnamayanS., TizhooshH.R. and SalamaM.M., Opposition-based differential evolution, Studies in Computational Intelligence143 (2008), 155\u2013171.","journal-title":"Studies in Computational Intelligence"},{"key":"e_1_3_2_14_2","article-title":"Opposition based genetic algorithm with cauchy mutation for function optimization. 2010 International Conference on Information Science and Applications","author":"Iqbal M.A.","year":"2010","unstructured":"IqbalM.A., KhanN.K., JaffarM.A., RamzanM. and Rauf BaigA., Opposition based genetic algorithm with cauchy mutation for function optimization. 2010 International Conference on Information Science and Applications, ICISA2010.","journal-title":"ICISA"},{"key":"e_1_3_2_15_2","doi-asserted-by":"crossref","unstructured":"YangX. Harmony Search as a Metaheuristic Algorithm 2 Harmony Search as a Metaheuristic Method1\u201318.","DOI":"10.1007\/978-3-642-00185-7_1"},{"key":"e_1_3_2_16_2","unstructured":"HollandJ.H. Genetic Algorithms - Computer programs that \u201cevolve\u201d in ways that resemble natural selection can solve complex problems even their creators do not fully understand (1992)."},{"key":"e_1_3_2_17_2","unstructured":"LiangJ.J. QuB.Y. and SuganthanP.N. Problem Definitions and Evaluation Criteria for the CEC 2014 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization. (2014)."},{"key":"e_1_3_2_18_2","first-page":"1","article-title":"Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization","author":"Suganthan P.N.","year":"2005","unstructured":"SuganthanP.N., HansenN., LiangJ.J., DebK., ChenY., AugerA. and TiwariS., Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization, Natural Computing (2005), 1\u201350.","journal-title":"Natural Computing"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asej.2013.06.002"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","unstructured":"YangX.-S. and DebS. Cuckoo Search via Levy Flights (2010).","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04944-6_14"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169262","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169262","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:39:23Z","timestamp":1777455563000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,29]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,3,29]]}},"alternative-id":["10.3233\/JIFS-169262"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169262","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,29]]}}}