A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provi...A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed.展开更多
We study the parameter estimation of a nonlinear chaotic system,which can be essentially formulated as a multidimensional optimization problem.In this paper,an orthogonal learning cuckoo search algorithm is used to es...We study the parameter estimation of a nonlinear chaotic system,which can be essentially formulated as a multidimensional optimization problem.In this paper,an orthogonal learning cuckoo search algorithm is used to estimate the parameters of chaotic systems.This algorithm can combine the stochastic exploration of the cuckoo search and the exploitation capability of the orthogonal learning strategy.Experiments are conducted on the Lorenz system and the Chen system.The proposed algorithm is used to estimate the parameters for these two systems.Simulation results and comparisons demonstrate that the proposed algorithm is better or at least comparable to the particle swarm optimization and the genetic algorithm when considering the quality of the solutions obtained.展开更多
The PPSV (Proportional Pulse in the System Variable) algorithm is a convenient method for the stabilization of the chaotic time series. It does not require any previous knowledge of the system. The PPSV method also ha...The PPSV (Proportional Pulse in the System Variable) algorithm is a convenient method for the stabilization of the chaotic time series. It does not require any previous knowledge of the system. The PPSV method also has a shortcoming, that is, the determination off. is a procedure by trial and error, since it lacks of optimization. In order to overcome the blindness, GA (Genetic Algorithm), a search algorithm based on the mechanics of natural selection and natural genetics, is used to optimize the λi The new method is named as GAPPSV algorithm. The simulation results show that GAPPSV algorithm is very efficient because the control process is short and the steady-state error is small.展开更多
There exist a considerable variety of factors affecting the spectral emissivity of an object. The authors have designed an improved combined neural network emissivity model, which can identify the continuous spectral ...There exist a considerable variety of factors affecting the spectral emissivity of an object. The authors have designed an improved combined neural network emissivity model, which can identify the continuous spectral emissivity and true temperature of any object only based on the measured brightness temperature data. In order to improve the accuracy of approximate calculations, the local minimum problem in the algorithm must be solved. Therefore, the authors design an optimal algorithm, i.e. a hybrid chaotic optimal algorithm, in which the chaos is used to roughly seek for the parameters involved in the model, and then a second seek for them is performed using the steepest descent. The modelling of emissivity settles the problems in assumptive models in multi-spectral theory.展开更多
Forest harvesting adjustment is a decision-making,large and complex system. In this paper,we analysis the shortcomings of the traditional harvest adjustment problems,and establish the model of multi-target harvest adj...Forest harvesting adjustment is a decision-making,large and complex system. In this paper,we analysis the shortcomings of the traditional harvest adjustment problems,and establish the model of multi-target harvest adjustment. As intelligent optimization,chaotic genetic algorithm has the parallel mechanism and the inherent global optimization characteristics which are suitable for multi-objective planning the settlement of the issue,specially in complex occasions where there are many objective functions and optimize variables. In order to solve the problem of forest harvesting adjustment,this paper introduces a genetic algorithm to the Forest Farm of Qiujia Liancheng Longyan for forest harvesting adjustment firstly. And the experimental result shows that the method is feasible and effective,and it can provide satisfactory solution for policy makers.展开更多
A novel approach to control the unpredictable behavior of chaotic systems is presented. The control algorithm is based on fuzzy logic control technique combined with genetic algorithm. The use of fuzzy logic allows fo...A novel approach to control the unpredictable behavior of chaotic systems is presented. The control algorithm is based on fuzzy logic control technique combined with genetic algorithm. The use of fuzzy logic allows for the implementation of human "rule-of-thumb" approach to decision making by employing linguistic variables. An improved Genetic Algorithm (GA) is used to learn to optimally select the fuzzy membership functions of the linguistic labels in the condition portion of each rule, and to automatically generate fuzzy control actions under each condition. Simulation results show that such an approach for the control of chaotic systems is both effective and robust.展开更多
To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The se...To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.展开更多
This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos'randomness,ergodicity and regularity. Its prope...This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos'randomness,ergodicity and regularity. Its property of global asymptotical convergence has been proved with Markov chains in this paper. CGA was applied to the optimization of complex benchmark functions and artificial neural network's (ANN) training. In solving the complex benchmark functions,CGA needs less iterative number than GA and other chaotic optimization algorithms and always finds the optima of these functions. In training ANN,CGA uses less iterative number and shows strong generalization. It is proved that CGA is an efficient and convenient chaotic optimization algorithm.展开更多
With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evoluti...With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming (CSEP) algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.展开更多
基金Project supported by the National High Technology Research and Development Program of China (Grant No. 2009AA01Z206)the Research Fund for Joint China-Canada Research and Development (R&D) Projects of The Ministry of Science and Technology,China (Grant No. 2010DFA11320)
文摘A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 60473042,60573067 and 60803102)
文摘We study the parameter estimation of a nonlinear chaotic system,which can be essentially formulated as a multidimensional optimization problem.In this paper,an orthogonal learning cuckoo search algorithm is used to estimate the parameters of chaotic systems.This algorithm can combine the stochastic exploration of the cuckoo search and the exploitation capability of the orthogonal learning strategy.Experiments are conducted on the Lorenz system and the Chen system.The proposed algorithm is used to estimate the parameters for these two systems.Simulation results and comparisons demonstrate that the proposed algorithm is better or at least comparable to the particle swarm optimization and the genetic algorithm when considering the quality of the solutions obtained.
文摘The PPSV (Proportional Pulse in the System Variable) algorithm is a convenient method for the stabilization of the chaotic time series. It does not require any previous knowledge of the system. The PPSV method also has a shortcoming, that is, the determination off. is a procedure by trial and error, since it lacks of optimization. In order to overcome the blindness, GA (Genetic Algorithm), a search algorithm based on the mechanics of natural selection and natural genetics, is used to optimize the λi The new method is named as GAPPSV algorithm. The simulation results show that GAPPSV algorithm is very efficient because the control process is short and the steady-state error is small.
文摘There exist a considerable variety of factors affecting the spectral emissivity of an object. The authors have designed an improved combined neural network emissivity model, which can identify the continuous spectral emissivity and true temperature of any object only based on the measured brightness temperature data. In order to improve the accuracy of approximate calculations, the local minimum problem in the algorithm must be solved. Therefore, the authors design an optimal algorithm, i.e. a hybrid chaotic optimal algorithm, in which the chaos is used to roughly seek for the parameters involved in the model, and then a second seek for them is performed using the steepest descent. The modelling of emissivity settles the problems in assumptive models in multi-spectral theory.
文摘Forest harvesting adjustment is a decision-making,large and complex system. In this paper,we analysis the shortcomings of the traditional harvest adjustment problems,and establish the model of multi-target harvest adjustment. As intelligent optimization,chaotic genetic algorithm has the parallel mechanism and the inherent global optimization characteristics which are suitable for multi-objective planning the settlement of the issue,specially in complex occasions where there are many objective functions and optimize variables. In order to solve the problem of forest harvesting adjustment,this paper introduces a genetic algorithm to the Forest Farm of Qiujia Liancheng Longyan for forest harvesting adjustment firstly. And the experimental result shows that the method is feasible and effective,and it can provide satisfactory solution for policy makers.
文摘A novel approach to control the unpredictable behavior of chaotic systems is presented. The control algorithm is based on fuzzy logic control technique combined with genetic algorithm. The use of fuzzy logic allows for the implementation of human "rule-of-thumb" approach to decision making by employing linguistic variables. An improved Genetic Algorithm (GA) is used to learn to optimally select the fuzzy membership functions of the linguistic labels in the condition portion of each rule, and to automatically generate fuzzy control actions under each condition. Simulation results show that such an approach for the control of chaotic systems is both effective and robust.
文摘To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.
基金Sponsored by the National Natural Science Foundation of China(Grant No. 60674024)the Initial Foundation of Civil Aviation University of China(Grant No. 06QD04x)
文摘This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos'randomness,ergodicity and regularity. Its property of global asymptotical convergence has been proved with Markov chains in this paper. CGA was applied to the optimization of complex benchmark functions and artificial neural network's (ANN) training. In solving the complex benchmark functions,CGA needs less iterative number than GA and other chaotic optimization algorithms and always finds the optima of these functions. In training ANN,CGA uses less iterative number and shows strong generalization. It is proved that CGA is an efficient and convenient chaotic optimization algorithm.
文摘With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming (CSEP) algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.