{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:22:59Z","timestamp":1781108579524,"version":"3.54.1"},"reference-count":29,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7,1]]},"abstract":"<p>Harmony search algorithm (HSA) is a recent evolutionary algorithm used to solve several optimization problems. The algorithm mimics the improvisation behaviour of a group of musicians to find a good harmony. Several variations of HSA have been proposed to enhance its performance. In this paper, a new variation of HSA that uses multi-parent crossover is proposed (HSA-MPC). In this technique three harmonies are used to generate three new harmonies that will replace the worst three solution vectors in the harmony memory (HM). The algorithm has been applied to solve a set of eight real world numerical optimization problems (1-8) introduced for IEEE-CEC2011 evolutionary algorithm competition. The experimental results of the proposed algorithm are compared with the original HSA, and two variations of HSA: global best HSA and tournament HSA. The HSA-MPC almost always shows superiority on all test problems.<\/p>","DOI":"10.4018\/ijamc.2013070101","type":"journal-article","created":{"date-parts":[[2013,12,16]],"date-time":"2013-12-16T12:36:06Z","timestamp":1387197366000},"page":"1-14","source":"Crossref","is-referenced-by-count":6,"title":["Hybridizing Harmony Search Algorithm with Multi-Parent Crossover to Solve Real World Optimization Problems"],"prefix":"10.4018","volume":"4","author":[{"given":"Iyad","family":"Abu Doush","sequence":"first","affiliation":[{"name":"Computer Science Department, Yarmouk University, Irbid, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Faisal","family":"Alkhateeb","sequence":"additional","affiliation":[{"name":"Computer Science Department, Yarmouk University, Irbid, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eslam","family":"Al Maghayreh","sequence":"additional","affiliation":[{"name":"Computer Science Department, Yarmouk University, Irbid, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Al-Huson University College, Al-Balqa Applied University, Irbid, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Basima Hani F.","family":"Hasan","sequence":"additional","affiliation":[{"name":"Computer Science Department, Yarmouk University, Irbid, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijamc.2013070101-0","article-title":"Novel selection schemes for harmony search.","author":"M. A.Al-Betar","year":"2011","journal-title":"Applied Mathematics and Computation"},{"key":"ijamc.2013070101-1","doi-asserted-by":"crossref","unstructured":"Al-Betar, M. A., & Khader, A. T. (2010). A harmony search algorithm for university course timetabling. Annals of Operation Research, 1-29.","DOI":"10.1007\/s10479-010-0769-z"},{"key":"ijamc.2013070101-2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04317-8_13"},{"key":"ijamc.2013070101-3","author":"S.Das","year":"2011","journal-title":"Problem definitions and evaluation criteria for the CEC 2011 competition on testing evolutionary algorithms on real world optimization problems"},{"key":"ijamc.2013070101-4","doi-asserted-by":"crossref","unstructured":"Deb, K., Joshi, D., & Anand, A. (2002). Real-coded evolutionary algorithms with parent-centric recombination. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC'02).","DOI":"10.1109\/CEC.2002.1006210"},{"key":"ijamc.2013070101-5","unstructured":"Durand, N., & Alliot, J.-M. (1998). Genetic crossover operator for partially separable functions. In Proceedings of the Third Annual Genetic Programming Conference."},{"key":"ijamc.2013070101-6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59496-5_354"},{"key":"ijamc.2013070101-7","doi-asserted-by":"crossref","unstructured":"Eiben, A. E., Rau\u2019e, P.-E., & Ruttkay, Z. (1994). Genetic algorithms with multi-parent recombination. In Proceedings of the 3rd Conference on Parallel Problem Solving from Nature. Berlin, Germany: Springer.","DOI":"10.1007\/3-540-58484-6_252"},{"key":"ijamc.2013070101-8","doi-asserted-by":"crossref","unstructured":"Elsayed, S. M., Sarker, R. A., & Essam, D. L. (2011). GA with a new multi-parent crossover for solving IEEE-CEC2011 competition problems. In Proceedings of the 2011 IEEE Congress on Evolutionary Computation (CEC) (pp. 1034-1040).","DOI":"10.1109\/CEC.2011.5949731"},{"key":"ijamc.2013070101-9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77465-5_6"},{"key":"ijamc.2013070101-10","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"ijamc.2013070101-11","unstructured":"Goldberg, D., Deb, K., & Korb, B. (1989). Messy genetic algorithms: motivation, analysis, and first results. Complex Systems, 1989(3), 493-530."},{"key":"ijamc.2013070101-12","author":"D. E.Goldberg","year":"1989","journal-title":"Genetic algorithms in search, optimization and machine learning"},{"key":"ijamc.2013070101-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00185-7_2"},{"key":"ijamc.2013070101-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2004.09.007"},{"key":"ijamc.2013070101-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.033"},{"key":"ijamc.2013070101-16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"M.Mitchell","year":"1996","journal-title":"An introduction to genetic algorithms"},{"key":"ijamc.2013070101-17","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2012010101"},{"key":"ijamc.2013070101-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.09.004"},{"key":"ijamc.2013070101-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.01.088"},{"issue":"2","key":"ijamc.2013070101-20","first-page":"99","article-title":"Multi-objective optimization using multi parent crossover operators.","volume":"2","author":"R.Patel","year":"2011","journal-title":"Journal of Emerging Trends in Computing and Information Sciences"},{"key":"ijamc.2013070101-21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ijamc.2013070101-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.04.001"},{"key":"ijamc.2013070101-23","doi-asserted-by":"crossref","unstructured":"Ting, C.-K., & Buning, H. K. (2003). A mating strategy for multi-parent genetic algorithms by integrating tabu search. In Proceedings of the 2003 Congress on Evolutionary Computation (CEC'03).","DOI":"10.1109\/CEC.2003.1299813"},{"key":"ijamc.2013070101-24","unstructured":"Tsutsui, S., Yamamura, M., & Higuchi, T. (1999). Multi-parent recombination with simplex crossover in real coded genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conf. (GECCO-99)."},{"key":"ijamc.2013070101-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.09.008"},{"key":"ijamc.2013070101-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.02.013"},{"key":"ijamc.2013070101-27","doi-asserted-by":"crossref","unstructured":"Wang, Y., L\u00fc, Z., & Hao, J.-K. (2010). A study of multi-parent crossover operators in a memetic algorithm. In Proceedings of the 11th international conference on Parallel problem solving from nature: Part I. Berlin, Heidelberg: Springer-Verlag.","DOI":"10.1007\/978-3-642-15844-5_56"},{"key":"ijamc.2013070101-28","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2010040104"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=96929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T01:57:50Z","timestamp":1746064670000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijamc.2013070101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,7,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2013070101","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,1]]}}}