{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:58:20Z","timestamp":1772773100654,"version":"3.50.1"},"reference-count":52,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4,1]]},"abstract":"<p>In recent years a lot of novel (mostly naturally inspired) search heuristics have been proposed. Among those approaches is Harmony Search. After its introduction in 2000, positive results and improvements over existing approaches have been reported. In this paper, the authors give a review of the developments of Harmony Search during the past decade and perform a rigorous analysis of this approach. This paper compares Harmony Search to the well-known search heuristic called Evolution Strategies. Harmony Search is a special case of Evolution Strategies in which the authors give compelling evidence for the thesis that research in Harmony is fundamentally misguided. The overarching question is how such a method could be inaccurately portrayed as a significant innovation without confronting a respectable challenge of its content or credentials. The authors examine possible answers to this question, and implications for evaluating other procedures by disclosing the way in which limitations of the method have been systematically overlooked.<\/p>","DOI":"10.4018\/jamc.2010040104","type":"journal-article","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T01:06:22Z","timestamp":1277946382000},"page":"50-60","source":"Crossref","is-referenced-by-count":124,"title":["A Rigorous Analysis of the Harmony Search Algorithm"],"prefix":"10.4018","volume":"1","author":[{"given":"Dennis","family":"Weyland","sequence":"first","affiliation":[{"name":"Istituto Dalle Molle di Studi sull\u2019Intelligenza Artificiale (IDSIA), Switzerland"}]}],"member":"2432","reference":[{"key":"jamc.2010040104-0","unstructured":"Al-Betar, M., Khader, A., & Gani, T. (2008). A harmony search algorithm for university course timetabling. In Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), Montreal, Canada."},{"key":"jamc.2010040104-1","unstructured":"B\u00e4ck, T. (1992). Self-adaptation in genetic algorithms. In Proceedings Toward a practice of autonomous systems: the First European Conference on Artificial Life (pp. 263-271)."},{"key":"jamc.2010040104-2","first-page":"1","author":"T.B\u00e4ck","year":"2000","journal-title":"Evolutionary Computation"},{"key":"jamc.2010040104-3","first-page":"2","author":"T.B\u00e4ck","year":"2000","journal-title":"Evolutionary Computation"},{"key":"jamc.2010040104-4","unstructured":"B\u00e4ck, T., Hoffmeister, F., & Schwefel, H. (1991). A survey of evolution strategies. In Proceedings of the Fourth International Conference on Genetic Algorithms."},{"key":"jamc.2010040104-5","unstructured":"B\u00e4ck, T., Rudolph, G., & Schwefel, H. (1993). Evolutionary programming and evolution strategies: Similarities and differences. In Proceedings of the Second Annual Conference on Evolutionary Programming (pp. 11-22)."},{"key":"jamc.2010040104-6","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1993.1.1.1"},{"key":"jamc.2010040104-7","unstructured":"Barr, R., Golden, B., Kelly, J., Steward, W., & Resende, M. (2001). Guidelines for designing and reporting on computational experiments with heuristic methods. In Proceedings of International Conference on Metaheuristics for Optimization (pp. 1-17). Dordrecht, The Netherlands: Kluwer."},{"key":"jamc.2010040104-8","first-page":"114","article-title":"A hybrid genetic algorithm for the vehicle routing problem with time windows (","volume":"1418","author":"J.Berger","year":"1998","journal-title":"LNCS"},{"key":"jamc.2010040104-9","first-page":"323","author":"H.Beyer","year":"1998","journal-title":"On the \u201cexplorative power\u201d of ES\/EP-like algorithms"},{"key":"jamc.2010040104-10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015059928466"},{"key":"jamc.2010040104-11","unstructured":"Davis, L. (1990). Hybrid genetic algorithms for machine learning. In Proceedings of IEE Colloquium on Machine Learning (pp. 9)."},{"key":"jamc.2010040104-12","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-007-0177-4"},{"key":"jamc.2010040104-13","doi-asserted-by":"crossref","unstructured":"Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the Sixth Symposium on Micro Machine and Human Science (pp. 39-43).","DOI":"10.1109\/MHS.1995.494215"},{"key":"jamc.2010040104-14","unstructured":"Erdal, F., & Saka, M. (2006). Optimum design of grillage systems using harmony search algorithm. In Proceedings of 8th International Conference on Computational Structures Technology (CST 2006), Las Palmas de Gran Canaria, Spain."},{"issue":"3","key":"jamc.2010040104-15","first-page":"215","article-title":"Effect of beam spacing in the harmony search based optimum design of grillages.","volume":"9","author":"F.Erdal","year":"2008","journal-title":"Asian Journal of Civil Engineering"},{"key":"jamc.2010040104-16","doi-asserted-by":"crossref","unstructured":"Fesanghary, M., Mahdavi, M., Minary-Jolandan, M., & Alizadeh, Y. (2008). Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Computer Methods in Applied Mechanics and Engineering, 197(33-40), 3080-3091.","DOI":"10.1016\/j.cma.2008.02.006"},{"key":"jamc.2010040104-17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00203032"},{"key":"jamc.2010040104-18","author":"R.Forsati","year":"2008","journal-title":"Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing"},{"key":"jamc.2010040104-19","doi-asserted-by":"crossref","unstructured":"Forsati, R., Mahdavi, M., Kangavari, M., & Safarkhani, B. (2008b). Web page clustering using harmony search optimization. In Proceedings of Electrical and Computer Engineering (CCECE 2008) (pp. 1601-1604).","DOI":"10.1109\/CCECE.2008.4564812"},{"key":"jamc.2010040104-20","unstructured":"Geem, Z. (2000). Optimal design of water distribution networks using harmony search. Unpublished doctoral dissertation, Korea University, Seoul, South Korea."},{"key":"jamc.2010040104-21","first-page":"751","article-title":"Harmony search in water pump switching problem (","volume":"3612","author":"Z.Geem","year":"2005","journal-title":"LNCS"},{"key":"jamc.2010040104-22","unstructured":"Geem, Z. (2005b). School bus routing using harmony search. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005), Washington, DC."},{"key":"jamc.2010040104-23","author":"Z.Geem","year":"2006","journal-title":"Comparison Harmony Search with Other Meta-Heuristics in Water Distribution Network Design"},{"key":"jamc.2010040104-24","first-page":"371","article-title":"Improved harmony search from ensemble of music players (Lecture Notes in Computer Science, 4251:86. Geem, Z. (2007a). Harmony search algorithm for solving Sudoku (","volume":"4692","author":"Z.Geem","year":"2006","journal-title":"LNCS"},{"key":"jamc.2010040104-25","unstructured":"Geem, Z. (2007b). Harmony search algorithm for the optimal design of largescale water distribution network. In Proceedings of the 7th International IWA Symposium on Systems Analysis and Integrated Assessment in Water Management (Watermatex 2007), Washington, DC."},{"key":"jamc.2010040104-26","first-page":"316","article-title":"Optimal scheduling of multiple dam system using harmony search algorithm (","volume":"4507","author":"Z.Geem","year":"2007","journal-title":"LNCS"},{"key":"jamc.2010040104-27","author":"Z.Geem","year":"2008","journal-title":"Harmony search optimisation to the pump-included water distribution network design"},{"key":"jamc.2010040104-28","doi-asserted-by":"crossref","unstructured":"Geem, Z. (2010). Recent advances in harmony search algorithm.","DOI":"10.1007\/978-3-642-04317-8"},{"key":"jamc.2010040104-29","first-page":"593","article-title":"Music composition using harmony search algorithm (","volume":"4448","author":"Z.Geem","year":"2007","journal-title":"LNCS"},{"key":"jamc.2010040104-30","unstructured":"Geem, Z., & Hwangbo, H. (2006). Application of harmony search to multi-objective optimization for satellite heat pipe design. In Proceedings of US-Korea Conference on Science, Technology, and Entrepreneurship (UKC 2006), Teaneck, NJ."},{"key":"jamc.2010040104-31","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"issue":"2","key":"jamc.2010040104-32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/02286203.2002.11442233","article-title":"Harmony search optimization: Application to pipe network design.","volume":"22","author":"Z.Geem","year":"2002","journal-title":"International Journal of Modelling & Simulation"},{"key":"jamc.2010040104-33","unstructured":"Geem, Z., Kim, J., & Yoon, Y. (2000). Optimal layout of pipe networks using harmony search. In Proceedings of 4th International Conference on Hydro-Science and Engineering, Seoul, South Korea."},{"key":"jamc.2010040104-34","doi-asserted-by":"publisher","DOI":"10.3844\/ajassp.2005.1552.1557"},{"key":"jamc.2010040104-35","doi-asserted-by":"crossref","unstructured":"Geem, Z., Lee, K., & Tseng, C. (2005b). Harmony search for structural design. In Proceedings of the 2005 conference on Genetic and evolutionary computation (pp. 651-652). New York: ACM.","DOI":"10.1145\/1068009.1068119"},{"key":"jamc.2010040104-36","doi-asserted-by":"crossref","unstructured":"Geem, Z., Tseng, C., & Park, Y. (2005c). Harmony search for generalized orienteering problem: best touring in China (LNCS 3612, p. 741).","DOI":"10.1007\/11539902_91"},{"key":"jamc.2010040104-37","first-page":"150","article-title":"Harmony search and ecological optimization.","volume":"1","author":"Z.Geem","year":"2007","journal-title":"International Journal of Energy and Environment"},{"key":"jamc.2010040104-38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2004.09.007"},{"key":"jamc.2010040104-39","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.033"},{"key":"jamc.2010040104-40","author":"Z.Michalewicz","year":"1996","journal-title":"Genetic algorithms+ data structures"},{"key":"jamc.2010040104-41","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(92)90094-X"},{"key":"jamc.2010040104-42","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.4.353"},{"key":"jamc.2010040104-43","doi-asserted-by":"crossref","unstructured":"Mukhopadhyay, A., Roy, A., Das, S., & Abraham, A. (2008). Population-variance and explorative power of harmony search: an analysis. In Proceedings of the Second National Conference on Mathematical Techniques: Emerging Paradigms for Electronics and IT Industries (MATEIT 2008), New Delhi, India.","DOI":"10.1109\/ICDIM.2008.4746793"},{"key":"jamc.2010040104-44","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.09.004"},{"key":"jamc.2010040104-45","first-page":"521","author":"M.Pelikan","year":"1999","journal-title":"The bivariate marginal distribution algorithm"},{"key":"jamc.2010040104-46","unstructured":"Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution."},{"key":"jamc.2010040104-47","doi-asserted-by":"crossref","unstructured":"Ryu, S., Duggal, A., Heyl, C., & Geem, Z. (2007). Mooring cost optimization via harmony search. In Proceedings of the 26th ASME International Conference on Offshore Mechanics and Arctic Engineering.","DOI":"10.1115\/OMAE2007-29334"},{"key":"jamc.2010040104-48","doi-asserted-by":"publisher","DOI":"10.1260\/136943307783571445"},{"key":"jamc.2010040104-49","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcsr.2008.02.005"},{"key":"jamc.2010040104-50","author":"H.Schwefel","year":"1981","journal-title":"Numerical optimization of computer models"},{"key":"jamc.2010040104-51","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmatprotec.2008.05.029"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=44954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:05:34Z","timestamp":1654117534000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2010040104"}},"subtitle":["How the Research Community can be Misled by a \u201cNovel\u201d Methodology"],"short-title":[],"issued":{"date-parts":[[2010,4,1]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2010040104","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,1]]}}}