AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2.1 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Harmony Search Algorithm Based on Dual-Memory Dynamic Search and Its Application on Data Clustering

Jinglin Wang1Haibin Ouyang1( )Zhiyu Zhou1Steven Li2
School of Mechanical and Electric Engineering, Guangzhou University, Guangzhou 510006, China
Graduate School of Business and Law, RMIT University, Melbourne 3000, Australia
Show Author Information

Abstract

Harmony Search (HS) algorithm is highly effective in solving a wide range of real-world engineering optimization problems. However, it still has the problems such as being prone to local optima, low optimization accuracy, and low search efficiency. To address the limitations of the HS algorithm, a novel approach called the Dual-Memory Dynamic Search Harmony Search (DMDS-HS) algorithm is introduced. The main innovations of this algorithm are as follows: Firstly, a dual-memory structure is introduced to rank and hierarchically organize the harmonies in the harmony memory, creating an effective and selectable trust region to reduce approach blind searching. Furthermore, the trust region is dynamically adjusted to improve the convergence of the algorithm while maintaining its global search capability. Secondly, to boost the algorithm’s convergence speed, a phased dynamic convergence domain concept is introduced to strategically devise a global random search strategy. Lastly, the algorithm constructs an adaptive parameter adjustment strategy to adjust the usage probability of the algorithm’s search strategies, which aim to rationalize the abilities of exploration and exploitation of the algorithm. The results tested on the Computational Experiment Competition on 2017 (CEC2017) test function set show that DMDS-HS outperforms the other nine HS algorithms and the other four state-of-the-art algorithms in terms of diversity, freedom from local optima, and solution accuracy. In addition, applying DMDS-HS to data clustering problems, the results show that it exhibits clustering performance that exceeds the other seven classical clustering algorithms, which verifies the effectiveness and reliability of DMDS-HS in solving complex data clustering problems.

References

[1]

V. Krishnan and S. Katkoori, A genetic algorithm for the design space exploration of datapaths during high-level synthesis, IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 213–229, 2006.

[2]

A. M. Brintrup, J. Ramsden, H. Takagi, and A. Tiwari, Ergonomic chair design by fusing qualitative and quantitative criteria using interactive genetic algorithms, IEEE Trans. Evol. Comput., vol. 12, no. 3, pp. 343–354, 2008.

[3]

Á. Rubio-Largo, L. Vanneschi, M. Castelli, and M. A. Vega-Rodríguez, Multiobjective metaheuristic to design RNA sequences, IEEE Trans. Evol. Comput., vol. 23, no. 1, pp. 156–169, 2019.

[4]

A. Tiwari, V. Oduguwa, and R. Roy, Rolling system design using evolutionary sequential process optimization, IEEE Trans. Evol. Comput., vol. 12, no. 2, pp. 196–202, 2008.

[5]

X. Yan, H. Zuo, C. Hu, W. Gong, and V. S. Sheng, Load optimization scheduling of chip mounter based on hybrid adaptive optimization algorithm, Complex System Modeling and Simulation, vol. 3, no. 1, pp. 1–11, 2023.

[6]

Z. Shu, A. Song, G. Wu, and W. Pedrycz, Variable reduction strategy integrated variable neighborhood search and NSGA-II hybrid algorithm for emergency material scheduling, Complex System Modeling and Simulation, vol. 3, no. 2, pp. 83–101, 2023.

[7]
H. Bai, T. Fan, Y. Niu, and Z. Cui, Multi-UAV cooperative trajectory planning based on many-objective evolutionary algorithm, Complex System Modeling and Simulation, vol. 2, no. 2, pp. 130–141, 2022.
[8]

X. Shen, J. Lu, X. You, L. Song, and Z. Ge, A region enhanced discrete multi-objective fireworks algorithm for low-carbon vehicle routing problem, Complex System Modeling and Simulation, vol. 2, no. 2, pp. 142–155, 2022.

[9]

Y. Guo, Y. Huang, S. Ge, Y. Zhang, E. Jiang, B. Cheng, and S. Yang, Low-carbon routing based on improved artificial bee colony algorithm for electric trackless rubber-tyred vehicles, Complex System Modeling and Simulation, vol. 3, no. 3, pp. 169–190, 2023.

[10]

X. Shen, H. Pan, Z. Ge, W. Chen, L. Song, and S. Wang, Energy-efficient multi-trip routing for municipal solid waste collection by contribution-based adaptive particle swarm optimization, Complex System Modeling and Simulation, vol. 3, no. 3, pp. 202–219, 2023.

[11]

Z. W. Geem, J. H. Kim, and G. V. Loganathan, A new heuristic optimization algorithm: Harmony search, Simulation, vol. 76, no. 2, pp. 60–68, 2001.

[12]

J. Gholami, F. Pourpanah, and X. Wang, Feature selection based on improved binary global harmony search for data classification, Appl. Soft Comput., vol. 93, p. 106402, 2020.

[13]
J. Yi, C. H. Chu, C. L. Kuo, X. Li, and L. Gao, Optimized tool path planning for five-axis flank milling of ruled surfaces using geometric decomposition strategy and multi-population harmony search algorithm, Appl. Soft Comput., vol. 73, pp. 547–561, 2018.
[14]

E. Khorram and M. Jaberipour, Harmony search algorithm for solving combined heat and power economic dispatch problems, Energy Convers. Manag., vol. 52, no. 2, pp. 1550–1554, 2011.

[15]

Z. Li, D. Zou, and Z. Kong, A harmony search variant and a useful constraint handling method for the dynamic economic emission dispatch problems considering transmission loss, Eng. Appl. Artif. Intell., vol. 84, pp. 18–40, 2019.

[16]

L. D. S. Coelho and V. C. Mariani, An improved harmony search algorithm for power economic load dispatch, Energy Convers. Manag., vol. 50, no. 10, pp. 2522–2526, 2009.

[17]

I. A. Doush, M. A. Al-Betar, M. A. Awadallah, E. Santos, A. I. Hammouri, M. Mafarjeh, and Z. AlMeraj, Flow shop scheduling with blocking using modified harmony search algorithm with neighboring heuristics methods, Appl. Soft Comput., vol. 85, p. 105861, 2019.

[18]

K. Z. Gao, P. N. Suganthan, Q. K. Pan, T. J. Chua, T. X. Cai, and C. S. Chong, Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling, Inf. Sci., vol. 289, pp. 76–90, 2014.

[19]

K. Z. Gao, P. N. Suganthan, Q. K. Pan, T. J. Chua, T. X. Cai, and C. S. Chong, Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives, J. Intell. Manuf., vol. 27, no. 2, pp. 363–374, 2016.

[20]

S. Kulluk, L. Ozbakir, and A. Baykasoglu, Training neural networks with harmony search algorithms for classification problems, Eng. Appl. Artif. Intell., vol. 25, no. 1, pp. 11–19, 2012.

[21]

S. H. Kim, Z. W. Geem, and G. T. Han, Hyperparameter optimization method based on harmony search algorithm to improve performance of 1D CNN human respiration pattern recognition system, Sensors, vol. 20, no. 13, p. 3697, 2020.

[22]

Z. Jia, Prediction of college students’ psychological crisis with a neural network optimized by harmony search algorithm, Int. J. Emerg. Technol. Learn., vol. 17, no. 2, pp. 59–75, 2022.

[23]

M. Özçalıcı, A. T. Dosdoğru, A. B. İpek, and M. Göçken, Comparison of harmony search derivatives for artificial neural network parameter optimisation: Stock price forecasting, Int. J. Data Min. Model. Manag., vol. 14, no. 4, pp. 335–357, 2022.

[24]

G. Shen, Research on marine water quality evaluation model based on improved harmony search algorithm by Gaussian disturbance to optimize takagi-sugeno fuzzy neural network, J. Coast. Res., vol. 111, no. sp1, pp. 283–287, 2020.

[25]
O. Ceylan and G. Taşkın, SVM parameter selection based on harmony search with an application to hyperspectral image classification, in Proc. 2016 24th Signal Processing and Communication Application Conference (SIU), Zonguldak, Türkiye, 2016, pp. 657–660.
[26]

X. Li, X. Li, and G. Yang, A novelty harmony search algorithm of image segmentation for multilevel thresholding using learning experience and search space constraints, Multimed. Tools Appl., vol. 82, no. 1, pp. 703–723, 2023.

[27]
Shivali, L. Maurya, E. Sharma, P. Mahapatra, and A. Doegar, A hybrid of fireworks and harmony search algorithm for multilevel image thresholding, in Advanced Computing and Communication Technologies, R. K. Choudhary, J. K. Mandal, and D. Bhattacharyya, eds. Singapore: Springer, 2018, pp. 11–21.
[28]

R. Srikanth and K. Bikshalu, Multilevel thresholding image segmentation based on energy curve with harmony Search Algorithm, Ain Shams Eng. J., vol. 12, no. 1, pp. 1–20, 2021.

[29]
C. Peraza, F. Valdez, and O. Castillo, Interval type-2 fuzzy logic for dynamic parameter adaptation in the harmony search algorithm, in Proc. 2016 IEEE 8th Int. Conf. Intelligent Systems (IS), Sofia, Bulgaria, 2016, pp. 106–112.
[30]

M. Shaqfa and Z. Orbán, Modified parameter-setting-free harmony search (PSFHS) algorithm for optimizing the design of reinforced concrete beams, Struct. Multidiscip. Optim., vol. 60, no. 3, pp. 999–1019, 2019.

[31]
Y. W. Jeong, S. M. Park, Z. W. Geem, and K. B. Sim, Advanced parameter-setting-free harmony search algorithm, Appl. Sci., vol. 10, no. 7, p. 2586, 2020.
[32]

F. Valdez, O. Castillo, and C. Peraza, Fuzzy logic in dynamic parameter adaptation of harmony search optimization for benchmark functions and fuzzy controllers, Int. J. Fuzzy Syst., vol. 22, no. 4, pp. 1198–1211, 2020.

[33]

A. Ocak, S. M. Nigdeli, G. Bekdaş, S. Kim, and Z. W. Geem, Adaptive harmony search for tuned liquid damper optimization under seismic excitation, Appl. Sci., vol. 12, no. 5, p. 2645, 2022.

[34]

U. Boryczka and K. Szwarc, The harmony search algorithm with additional improvement of harmony memory for asymmetric traveling salesman problem, Expert Syst. Appl., vol. 122, pp. 43–53, 2019.

[35]
J. Yi, X. Li, C. H. Chu, and L. Gao, Parallel chaotic local search enhanced harmony search algorithm for engineering design optimization, J. Intell. Manuf., vol. 30, no. 1, pp. 405–428, 2019.
[36]

M. Wang, T. Zhang, P. Wang, and X. Chen, An improved harmony search algorithm for solving day-ahead dispatch optimization problems of integrated energy systems considering time-series constraints, Energy Build., vol. 229, p. 110477, 2020.

[37]

F. Amini and P. Ghaderi, Hybridization of Harmony Search and Ant Colony Optimization for optimal locating of structural dampers, Appl. Soft Comput., vol. 13, no. 5, pp. 2272–2280, 2013.

[38]

M. Gheisarnejad, An effective hybrid harmony search and cuckoo optimization algorithm based fuzzy PID controller for load frequency control, Appl. Soft Comput., vol. 65, pp. 121–138, 2018.

[39]

A. E. Kayabekir, Y. C. Toklu, G. Bekdaş, S. M. Nigdeli, M. Yücel, and Z. W. Geem, A novel hybrid harmony search approach for the analysis of plane stress systems via total potential optimization, Appl. Sci., vol. 10, no. 7, p. 2301, 2020.

[40]

A. Radman, Combination of BESO and harmony search for topology optimization of microstructures for materials, Appl. Math. Model., vol. 90, pp. 650–661, 2021.

[41]

J. Gong, Z. Zhang, J. Liu, C. Guan, and S. Liu, Hybrid algorithm of harmony search for dynamic parallel row ordering problem, J. Manuf. Syst., vol. 58, pp. 159–175, 2021.

[42]
Q. K. Pan, P. N. Suganthan, M. F. Tasgetiren, and J. J. Liang, A self-adaptive global best harmony search algorithm for continuous optimization problems, Appl. Math. Comput., vol. 216, no. 3, pp. 830–848, 2010.
[43]

M. Mahdavi, M. Fesanghary, and E. Damangir, An improved harmony search algorithm for solving optimization problems, Appl. Math. Comput., vol. 188, no. 2, pp. 1567–1579, 2007.

[44]

M. G. H. Omran and M. Mahdavi, Global-best harmony search, Appl. Math. Comput., vol. 198, no. 2, pp. 643–656, 2008.

[45]

D. Zou, L. Gao, J. Wu, and S. Li, Novel global harmony search algorithm for unconstrained problems, Neurocomputing, vol. 73, nos. 16–18, pp. 3308–3318, 2010.

[46]

E. Valian, S. Tavakoli, and S. Mohanna, An intelligent global harmony search approach to continuous optimization problems, Appl. Math. Comput., vol. 232, pp. 670–684, 2014.

[47]

H. B. Ouyang, L. Q. Gao, S. Li, X. Y. Kong, Q. Wang, and D. X. Zou, Improved harmony search algorithm, Appl. Soft Comput., vol. 53, pp. 133–167, 2017.

[48]

J. Gholami, K. K. A. Ghany, and H. M. Zawbaa, A novel global harmony search algorithm for solving numerical optimizations, Soft Comput. A Fusion Found. Methodol. Appl., vol. 25, no. 4, pp. 2837–2849, 2021.

[49]
Q. Zhu, X. Tang, Y. Li, and M. O. Yeboah, An improved differential-based harmony search algorithm with linear dynamic domain, Knowledge-Based Systems, vol. 187, p. 104809, 2020.
[50]

H. Qing and S. H. Luo, Chimp optimization algorithm based on hybrid improvement strategy and its mechanical application, (in Chinese), Control and Decision, vol. 38, no. 2, pp. 354–364, 2023.

[51]

Y. F. Wang, R. H. Liao, E. H. Liang, and J. W. Sun, Improved whale optimization algorithm based on siege mechanism, (in Chinese), Control and Decision, vol. 38, no. 10, pp. 2773–2782, 2023.

[52]

Q. Y. Li and Y. X. Shen, A hybrid gray wolf optimization algorithm based on the teaching-learning optimization, (in Chinese), Control and Decision, vol. 37, no. 12, pp. 3190–3196, 2022.

[53]

S. Mirjalili, S. M. Mirjalili, and A. Lewis, Grey wolf optimizer, Adv. Eng. Softw., vol. 69, pp. 46–61, 2014.

[54]
S. Kotz and N. L. Johnson, Breakthroughs in Statistics: Methodology and Distribution. New York, NY, USA: Springer, 1992.
[55]

H. B. Mann and D. R. Whitney, On a test of whether one of two random variables is stochastically larger than the other, Ann. Math. Statist., vol. 18, no. 1, pp. 50–60, 1947.

[56]

K. Talaei, A. Rahati, and L. Idoumghar, A novel harmony search algorithm and its application to data clustering, Appl. Soft Comput., vol. 92, p. 106273, 2020.

Complex System Modeling and Simulation
Pages 261-281
Cite this article:
Wang J, Ouyang H, Zhou Z, et al. Harmony Search Algorithm Based on Dual-Memory Dynamic Search and Its Application on Data Clustering. Complex System Modeling and Simulation, 2023, 3(4): 261-281. https://doi.org/10.23919/CSMS.2023.0019

440

Views

120

Downloads

4

Crossref

3

Scopus

Altmetrics

Received: 30 July 2023
Revised: 06 October 2023
Accepted: 16 October 2023
Published: 07 December 2023
© The author(s) 2023.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return