Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin(2/x) with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with ...Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin(2/x) with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses (e.g., Logistic map, Tent map, and Chebyshev map), a new adaptive mutative scale chaos optimization algorithm (AMSCOA) is proposed by using the chaos model x = sin(2/x). In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken: 1) the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2) the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.展开更多
In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of ...In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of the first carrier wave’s search for the optimal point in implementing the sophisticated searching during the second carrier wave is faster and more accurate. In addition, the concept of using the carrier wave three times is proposed and put into practice to tackle the multi-variables opti- mization problems, where the searching for the optimal point of the last several variables is frequently worse than the first several ones.展开更多
To improve energy efficiency and protect the environment,the integrated energy system(IES)becomes a significant direction of energy structure adjustment.This paper innovatively proposes a wavelet neural network(WNN)mo...To improve energy efficiency and protect the environment,the integrated energy system(IES)becomes a significant direction of energy structure adjustment.This paper innovatively proposes a wavelet neural network(WNN)model optimized by the improved particle swarm optimization(IPSO)and chaos optimization algorithm(COA)for short-term load prediction of IES.The proposed model overcomes the disadvantages of the slow convergence and the tendency to fall into the local optimum in traditional WNN models.First,the Pearson correlation coefficient is employed to select the key influencing factors of load prediction.Then,the traditional particle swarm optimization(PSO)is improved by the dynamic particle inertia weight.To jump out of the local optimum,the COA is employed to search for individual optimal particles in IPSO.In the iteration,the parameters of WNN are continually optimized by IPSO-COA.Meanwhile,the feedback link is added to the proposed model,where the output error is adopted to modify the prediction results.Finally,the proposed model is employed for load prediction.The experimental simulation verifies that the proposed model significantly improves the prediction accuracy and operation efficiency compared with the artificial neural network(ANN),WNN,and PSO-WNN.展开更多
By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite co...By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.展开更多
A chaotic algorithm for providing a solution to the bi-level Discrete Equilibrium Network Design Problem (NDP) is discussed following an introduction of the Discrete Network Design Problem (DNDP) model and Chaos O...A chaotic algorithm for providing a solution to the bi-level Discrete Equilibrium Network Design Problem (NDP) is discussed following an introduction of the Discrete Network Design Problem (DNDP) model and Chaos Optimization Algorithms (COA). A description of the chaotic approach for the DNDP model is described in details. Then a numerical example for the DNDP is carried out to investigate the chaotic approach. The results have been encouraging, indicating that the chaotic approach has great potential ability in finding the optimal solution of DNDP models.展开更多
基金Hunan Provincial Natural Science Foundation of China (No. 06JJ50103)the National Natural Science Foundationof China (No. 60375001)
文摘Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin(2/x) with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses (e.g., Logistic map, Tent map, and Chebyshev map), a new adaptive mutative scale chaos optimization algorithm (AMSCOA) is proposed by using the chaos model x = sin(2/x). In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken: 1) the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2) the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.
基金Project supported by the National Natural Science Foundation of China (No. 60474064), and the Natural Science Foundation of Zhejiang Province (No. Y105694), China
文摘In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of the first carrier wave’s search for the optimal point in implementing the sophisticated searching during the second carrier wave is faster and more accurate. In addition, the concept of using the carrier wave three times is proposed and put into practice to tackle the multi-variables opti- mization problems, where the searching for the optimal point of the last several variables is frequently worse than the first several ones.
基金supported in part by the National Key Research and Development Program of China(No.2018YFB1500800)the National Natural Science Foundation of China(No.51807134)the State Key Laboratory of Reliability and Intelligence of Electrical Equipment,Hebei University of Technology(No.EERI_KF20200014)。
文摘To improve energy efficiency and protect the environment,the integrated energy system(IES)becomes a significant direction of energy structure adjustment.This paper innovatively proposes a wavelet neural network(WNN)model optimized by the improved particle swarm optimization(IPSO)and chaos optimization algorithm(COA)for short-term load prediction of IES.The proposed model overcomes the disadvantages of the slow convergence and the tendency to fall into the local optimum in traditional WNN models.First,the Pearson correlation coefficient is employed to select the key influencing factors of load prediction.Then,the traditional particle swarm optimization(PSO)is improved by the dynamic particle inertia weight.To jump out of the local optimum,the COA is employed to search for individual optimal particles in IPSO.In the iteration,the parameters of WNN are continually optimized by IPSO-COA.Meanwhile,the feedback link is added to the proposed model,where the output error is adopted to modify the prediction results.Finally,the proposed model is employed for load prediction.The experimental simulation verifies that the proposed model significantly improves the prediction accuracy and operation efficiency compared with the artificial neural network(ANN),WNN,and PSO-WNN.
基金Project(60874114) supported by the National Natural Science Foundation of China
文摘By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.
基金This project is supported partly by National 0utstanding Young Investigation of National Natural Science Foundation of China(70225005,70471088,70501004 and 70501005), the Special Research Found for Doctoral Programs in State Education Ministry (20050004005), the 211 Project of Discipline Construction of Beijing Jiaotong University and Rencai Foundation of Beijing Jiaotong University (2003RC010)
文摘A chaotic algorithm for providing a solution to the bi-level Discrete Equilibrium Network Design Problem (NDP) is discussed following an introduction of the Discrete Network Design Problem (DNDP) model and Chaos Optimization Algorithms (COA). A description of the chaotic approach for the DNDP model is described in details. Then a numerical example for the DNDP is carried out to investigate the chaotic approach. The results have been encouraging, indicating that the chaotic approach has great potential ability in finding the optimal solution of DNDP models.