{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T21:42:23Z","timestamp":1764020543744,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T00:00:00Z","timestamp":1642118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>To overcome the shortcomings of the harmony search algorithm, such as its slow convergence rate and poor global search ability, a reward population-based differential genetic harmony search algorithm is proposed. In this algorithm, a population is divided into four ordinary sub-populations and one reward sub-population, for each of which the evolution strategy of the differential genetic harmony search is used. After the evolution, the population with the optimal average fitness is combined with the reward population to produce a new reward population. During an experiment, tests were conducted first on determining the value of the harmony memory size (HMS) and the harmony memory consideration rate (HMCR), followed by an analysis of the effect of their values on the performance of the proposed algorithm. Then, six benchmark functions were selected for the experiment, and a comparison was made on the calculation results of the standard harmony memory search algorithm, reward population harmony search algorithm, differential genetic harmony algorithm, and reward population-based differential genetic harmony search algorithm. The result suggests that the reward population-based differential genetic harmony search algorithm has the merits of a strong global search ability, high solving accuracy, and satisfactory stability.<\/jats:p>","DOI":"10.3390\/a15010023","type":"journal-article","created":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T12:34:04Z","timestamp":1642163644000},"page":"23","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Reward Population-Based Differential Genetic Harmony Search Algorithm"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6809-0696","authenticated-orcid":false,"given":"Yang","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Applied Informatics, Faculty of Science and Engineering, Hosei University, Tokyo 184-8584, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiacheng","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronics and Information Engineering, Faculty of Engineering, Kanagawa University, Yokohama 221-8686, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1857-8233","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Applied Informatics, Faculty of Science and Engineering, Hosei University, Tokyo 184-8584, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,14]]},"reference":[{"key":"ref_1","unstructured":"Snyman, J.A. (2005). Practical Mathematical Optimization, Springer."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","article-title":"Hybrid metaheuristics in combinatorial optimization: A survey","volume":"11","author":"Blum","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1080\/08839514.2015.1016391","article-title":"Stellar-mass black hole optimization for biclustering microarray gene expression data","volume":"29","author":"Balamurugan","year":"2015","journal-title":"Appl. Artif. Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","article-title":"A survey on metaheuristics for stochastic combinatorial optimization","volume":"8","author":"Bianchi","year":"2009","journal-title":"Nat. Comput."},{"key":"ref_5","unstructured":"Yang, X.S. (2010). Nature-Inspired Metaheuristic Algorithms, Luniver Press."},{"key":"ref_6","first-page":"1","article-title":"A review of population-based meta-heuristic algorithms","volume":"5","author":"Beheshti","year":"2013","journal-title":"Int. J. Adv. Soft Comput. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Chien, S.F., and Ting, T.O. (2015). Bio-inspired computation and optimization: An overview. Bio-Inspired Computation in Telecommunications, Elsevier Inc.","DOI":"10.1016\/B978-0-12-801538-4.00001-X"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","article-title":"Combinatorial optimization: Comparison of heuristic algorithms in travelling salesman problem","volume":"26","author":"Halim","year":"2019","journal-title":"Arch. Computat. Methods Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A new heuristic optimization algorithm: Harmony search","volume":"76","author":"Geem","year":"2001","journal-title":"Simulation"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"76313","DOI":"10.1109\/ACCESS.2018.2877791","article-title":"A differential-based harmony search algorithm with variable neighborhood search for job shop scheduling problem and its runtime analysis","volume":"6","author":"Zhao","year":"2018","journal-title":"IEEE Access"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/03052150500467430","article-title":"Optimal cost design of water distribution networks using harmony search","volume":"38","author":"Geem","year":"2006","journal-title":"Eng. Optimiz."},{"key":"ref_12","first-page":"117","article-title":"Harmony search applications in industry","volume":"Volume 226","author":"Prasad","year":"2008","journal-title":"Soft Computing Applications in Industry. Studies in Fuzziness and Soft Computing"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Hasanipanah, M., Keshtegar, B., Thai, D.K., and Troung, N.T. (2020). An ANN-adaptive dynamical harmony search algorithm to approximate the flyrock resulting from blasting. Eng. Comput., 1\u201313.","DOI":"10.1007\/s00366-020-01105-9"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"14233","DOI":"10.1109\/ACCESS.2019.2893662","article-title":"Comprehensive review of the development of the harmony search algorithm and its applications","volume":"7","author":"Alsewari","year":"2019","journal-title":"IEEE Access"},{"key":"ref_15","first-page":"1567","article-title":"An improved harmony search algorithm for solving optimization problems","volume":"188","author":"Mahdavi","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"ref_16","first-page":"195","article-title":"Global dynamic harmony search algorithm: GDHS","volume":"228","author":"Khalili","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"ref_17","first-page":"1687","article-title":"Application of MHS algorithm to structural design problems","volume":"34","author":"Ouyang","year":"2013","journal-title":"J. Northeast. Univ."},{"key":"ref_18","first-page":"830","article-title":"A self-adaptive global best harmony search algorithm for continuous optimization problems","volume":"216","author":"Pan","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"ref_19","first-page":"32","article-title":"The improvement of harmony search algorithm","volume":"4","author":"Zhang","year":"2015","journal-title":"Artif. Intell. Rob. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3735","DOI":"10.1016\/j.eswa.2010.09.032","article-title":"Dynamic multi-swarm particle swarm optimizer with harmony search","volume":"38","author":"Zhao","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"87810","DOI":"10.1109\/ACCESS.2020.2993066","article-title":"Optimum location and parameter setting of STATCOM based on improved differential evolution harmony search algorithm","volume":"8","author":"Zhang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"107194","DOI":"10.1016\/j.cie.2021.107194","article-title":"Two layered approaches integrating harmony search with genetic algorithm for the integrated process planning and scheduling problem","volume":"155","author":"Wu","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10462-010-9201-y","article-title":"The variants of the harmony search algorithm: An overview","volume":"36","author":"Mandava","year":"2011","journal-title":"Artif. Intell. Rev."},{"key":"ref_24","first-page":"115","article-title":"An improved clustering-based harmony search algorithm (IC-HS)","volume":"Volume 295","author":"Arai","year":"2021","journal-title":"Proceedings of the SAI Intelligent Systems Conference"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1818","DOI":"10.1016\/j.engappai.2013.05.008","article-title":"A survey on applications of the harmony search algorithm","volume":"26","author":"Manjarres","year":"2013","journal-title":"Eng. Appl. Artif. Intel."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"5277","DOI":"10.1007\/s00500-020-05527-x","article-title":"An improved differential evolution algorithm and its application in optimization problem","volume":"25","author":"Deng","year":"2021","journal-title":"Soft Comput."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Sharma, H., Govindan, K., Poonia, R., Kumar, S., and El-Medany, W. (2019, January 14\u201316). Robot path planning using differential evolution. Proceedings of the Advances in Computing and Intelligent Systems, Beijing, China.","DOI":"10.1007\/978-981-15-0222-4"},{"key":"ref_28","first-page":"68","article-title":"A partheno-genetic algorithm and analysis on its global convergence","volume":"25","author":"Li","year":"1999","journal-title":"Acta Autom. Sin."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Yang, Z., Li, J.C., and Li, L. (2020). Time-dependent theme park routing problem by Partheno-genetic algorithm. Mathematics, 8.","DOI":"10.3390\/math8122193"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/1\/23\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:39:44Z","timestamp":1760362784000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/1\/23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,14]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["a15010023"],"URL":"https:\/\/doi.org\/10.3390\/a15010023","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,1,14]]}}}