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,a...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.展开更多
Penicillin fermentation is an important part of microbial fermentation. Due to the existence of error date in the independent variables and dependent variables of the penicillin fermentation sample data, the accuracy ...Penicillin fermentation is an important part of microbial fermentation. Due to the existence of error date in the independent variables and dependent variables of the penicillin fermentation sample data, the accuracy of the model of penicillin fermentation is affected. In this paper, an amended harmony search (AHS) algorithm is developed to adjust the hyper-parameters of least squares support vector machine (LS-SVM) in order to build penicillin fermentation process model with prediction accuracy. The AHS algorithm is investigated by unconstrained benchmark functions with different characteristics. Compared with other several optimization approaches, AHS demonstrates a better performance. Moreover, using the simulation data from the PenSim simulation platform to validate the effectiveness of the penicillin fermentation process modeling, experiment results show that the penicillin fermentation process modeling based on the tuned LS-SVM by AHS possesses robustness and generalization ability.展开更多
This paper presents a ranked differential evolution(RDE) algorithm for solving the identification problem of nonlinear discrete-time systems based on a Volterra filter model. In the improved method, a scale factor, ge...This paper presents a ranked differential evolution(RDE) algorithm for solving the identification problem of nonlinear discrete-time systems based on a Volterra filter model. In the improved method, a scale factor, generated by combining a sine function and randomness, effectively keeps a balance between the global search and the local search. Also, the mutation operation is modified after ranking all candidate solutions of the population to help avoid the occurrence of premature convergence. Finally, two examples including a highly nonlinear discrete-time rational system and a real heat exchanger are used to evaluate the performance of the RDE algorithm and five other approaches. Numerical experiments and comparisons demonstrate that the RDE algorithm performs better than the other approaches in most cases.展开更多
基金This work was supported by the Fund of Innovative Training Program for College Students of Guangzhou University(No.s202211078116)Guangzhou City School Joint Fund Project(No.SL2022A03J01009)+2 种基金National Natural Science Foundation of China(No.61806058)Natural Science Foundation of Guangdong Province(No.2018A030310063)Guangzhou Science and Technology Plan Project(No.201804010299).
文摘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.
基金The authors wish to thank the editor and anonymous referees for their constructive comments and recommendations, which have significantly improved the presentation of this paper. This work is supported by National Nature Science Foundation of China (Grant Nos. 60674021, 61273155).
文摘Penicillin fermentation is an important part of microbial fermentation. Due to the existence of error date in the independent variables and dependent variables of the penicillin fermentation sample data, the accuracy of the model of penicillin fermentation is affected. In this paper, an amended harmony search (AHS) algorithm is developed to adjust the hyper-parameters of least squares support vector machine (LS-SVM) in order to build penicillin fermentation process model with prediction accuracy. The AHS algorithm is investigated by unconstrained benchmark functions with different characteristics. Compared with other several optimization approaches, AHS demonstrates a better performance. Moreover, using the simulation data from the PenSim simulation platform to validate the effectiveness of the penicillin fermentation process modeling, experiment results show that the penicillin fermentation process modeling based on the tuned LS-SVM by AHS possesses robustness and generalization ability.
基金supported by the Science Fundamental Research Project of Jiangsu Normal University,China(No.9212812101)
文摘This paper presents a ranked differential evolution(RDE) algorithm for solving the identification problem of nonlinear discrete-time systems based on a Volterra filter model. In the improved method, a scale factor, generated by combining a sine function and randomness, effectively keeps a balance between the global search and the local search. Also, the mutation operation is modified after ranking all candidate solutions of the population to help avoid the occurrence of premature convergence. Finally, two examples including a highly nonlinear discrete-time rational system and a real heat exchanger are used to evaluate the performance of the RDE algorithm and five other approaches. Numerical experiments and comparisons demonstrate that the RDE algorithm performs better than the other approaches in most cases.