The differential evolution algorithm is an evolutionary algorithm for global optimization and the un-capacitated facility location problem (UFL) is one of the classic NP-Hard problems. In this paper, combined with the...The differential evolution algorithm is an evolutionary algorithm for global optimization and the un-capacitated facility location problem (UFL) is one of the classic NP-Hard problems. In this paper, combined with the specific characteristics of the UFL problem, we introduce the activation function to the algorithm for solving UFL problem and name it improved adaptive differential evolution algorithm (IADEA). Next, to improve the efficiency of the algorithm and to alleviate the problem of being stuck in a local optimum, an adaptive operator was added. To test the improvement of our algorithm, we compare the IADEA with the basic differential evolution algorithm by solving typical instances of UFL problem respectively. Moreover, to compare with other heuristic algorithm, we use the hybrid ant colony algorithm to solve the same instances. The computational results show that IADEA improves the performance of the basic DE and it outperforms the hybrid ant colony algorithm.展开更多
To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individua...To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individual has its own symbiotic individual, which consists of control parameters. Differential evolution operator is applied for the original individuals to search the global optimization solution. Alopex algorithm is used to co-evolve the symbiotic individuals during the original individual evolution and enhance the fitness of the original individuals. Thus, control parameters are self-adaptively adjusted by Alopex to obtain the real-time optimum values for the original population. To illustrate the whole performance of Alopex-DE, several varietal DEs were applied to optimize 13 benchmark functions. The results show that the whole performance of Alopex-DE is the best. Further, Alopex-DE was applied to solve 4 typical CPDOPs, and the effect of the discrete time degree on the optimization solution was analyzed. The satisfactory result is obtained.展开更多
To implement self-adaptive control parameters,a hybrid differential evolution algorithm integrated with particle swarm optimization( PSODE) is proposed. In the PSODE, control parameters are encoded to be a symbiotic i...To implement self-adaptive control parameters,a hybrid differential evolution algorithm integrated with particle swarm optimization( PSODE) is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual,and each original individual has its own symbiotic individual. Differential evolution( DE) operators are used to evolve the original population. And,particle swarm optimization( PSO) is applied to co-evolving the symbiotic population. Thus,with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functions. The results show that the average performance of PSODE is the best.展开更多
Map building by multi-robot is very important to accomplish autonomous navigation,and one of the basic problems and research hotspots is how to merge the maps into a single one in the field of multi-robot map building...Map building by multi-robot is very important to accomplish autonomous navigation,and one of the basic problems and research hotspots is how to merge the maps into a single one in the field of multi-robot map building.A novel approach is put forward based on adaptive differential evolution to map building for the multi-robot system.The multi-robot mapping-building system adopts the methods of decentralized exploration and concentrated mapping.The adaptive differential evolution algorithm is used to search in the space of possible transformation,and the iterative search is performed with the goal of maximizing overlapping regions.The map is translated and rotated so that the two maps can be overlapped and merged into a single global one successfully.This approach for map building can be realized without any knowledge of their relative positions.Experimental results show that the approach is effective and feasibile.展开更多
Differential evolution algorithm based on the covariance matrix learning can adjust the coordinate system according to the characteristics of the population, which make<span style="font-family:Verdana;"&g...Differential evolution algorithm based on the covariance matrix learning can adjust the coordinate system according to the characteristics of the population, which make<span style="font-family:Verdana;">s</span><span style="font-family:Verdana;"> the search move in a more favorable direction. In order to obtain more accurate information about the function shape, this paper propose</span><span style="font-family:Verdana;">s</span><span style="font-family:;" "=""> <span style="font-family:Verdana;">covariance</span><span style="font-family:Verdana;"> matrix learning differential evolution algorithm based on correlation (denoted as RCLDE)</span></span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">to improve the search efficiency of the algorithm. First, a hybrid mutation strategy is designed to balance the diversity and convergence of the population;secondly, the covariance learning matrix is constructed by selecting the individual with the less correlation;then, a comprehensive learning mechanism is comprehensively designed by two covariance matrix learning mechanisms based on the principle of probability. Finally,</span><span style="font-family:;" "=""> </span><span style="font-family:;" "=""><span style="font-family:Verdana;">the algorithm is tested on the CEC2005, and the experimental results are compared with other effective differential evolution algorithms. The experimental results show that the algorithm proposed in this paper is </span><span style="font-family:Verdana;">an effective algorithm</span><span style="font-family:Verdana;">.</span></span>展开更多
现代战争中,跨平台武器单元的协同利用,是合同编队体系的重要内容,作战方式也正由平台级协同向着能力要素级协同转变,这对武器目标分配问题的解决提出了更大挑战。本文将武器单元的最小划分单位细化到能力要素级,以毁伤概率与成本消耗...现代战争中,跨平台武器单元的协同利用,是合同编队体系的重要内容,作战方式也正由平台级协同向着能力要素级协同转变,这对武器目标分配问题的解决提出了更大挑战。本文将武器单元的最小划分单位细化到能力要素级,以毁伤概率与成本消耗为优化目标,面向多种来袭目标的编队防空场景,提出了跨平台武器目标分配算法。同时,基于混沌映射提出了混沌种群重构(chaotic population reconstruction,CPR)机制,并结合带存档的自适应差分进化(adaptive differential evolution with optional external archive,JADE)算法提出了CPR-JADE算法,利用CPR机制可以帮助算法在解决高维复杂约束问题时跳出局部最优。再将其运用到武器目标分配模型上,实现了对模型的高效求解。最后,通过在多种数据规模下与其他进化优化算法的仿真对比试验分析,验证了所提方法的正确性与有效性。展开更多
为进一步提高分割精度并加快分割速度,提出了一种基于邻域搜索可选外部存档自适应差分进行算法(简称为JADE-GL)的二维Otsu多阈值图像分割方案。首先,针对原始JADE算法精英突变策略收敛速度慢、容易陷入局部最优等问题,提出了基于邻域半...为进一步提高分割精度并加快分割速度,提出了一种基于邻域搜索可选外部存档自适应差分进行算法(简称为JADE-GL)的二维Otsu多阈值图像分割方案。首先,针对原始JADE算法精英突变策略收敛速度慢、容易陷入局部最优等问题,提出了基于邻域半径搜索的改进突变策略,以提升算法的全局探索和开发能力。然后,将所提算法与现有分割方法以及其他JADE变种算法进行二维Otsu多阈值分割对比实验。最后,通过函数收敛曲线、分割距离测度、峰值信噪比(peak signal to noise ratio,PSNR)等指标定量分析算法的性能。实验结果表明,随着阈值数增加,提出的算法无论在收敛速度、分割精度还是分割图像效果上都有显著提升。展开更多
文摘The differential evolution algorithm is an evolutionary algorithm for global optimization and the un-capacitated facility location problem (UFL) is one of the classic NP-Hard problems. In this paper, combined with the specific characteristics of the UFL problem, we introduce the activation function to the algorithm for solving UFL problem and name it improved adaptive differential evolution algorithm (IADEA). Next, to improve the efficiency of the algorithm and to alleviate the problem of being stuck in a local optimum, an adaptive operator was added. To test the improvement of our algorithm, we compare the IADEA with the basic differential evolution algorithm by solving typical instances of UFL problem respectively. Moreover, to compare with other heuristic algorithm, we use the hybrid ant colony algorithm to solve the same instances. The computational results show that IADEA improves the performance of the basic DE and it outperforms the hybrid ant colony algorithm.
基金Project(2013CB733600) supported by the National Basic Research Program of ChinaProject(21176073) supported by the National Natural Science Foundation of China+2 种基金Project(20090074110005) supported by Doctoral Fund of Ministry of Education of ChinaProject(NCET-09-0346) supported by Program for New Century Excellent Talents in University of ChinaProject(09SG29) supported by "Shu Guang", China
文摘To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individual has its own symbiotic individual, which consists of control parameters. Differential evolution operator is applied for the original individuals to search the global optimization solution. Alopex algorithm is used to co-evolve the symbiotic individuals during the original individual evolution and enhance the fitness of the original individuals. Thus, control parameters are self-adaptively adjusted by Alopex to obtain the real-time optimum values for the original population. To illustrate the whole performance of Alopex-DE, several varietal DEs were applied to optimize 13 benchmark functions. The results show that the whole performance of Alopex-DE is the best. Further, Alopex-DE was applied to solve 4 typical CPDOPs, and the effect of the discrete time degree on the optimization solution was analyzed. The satisfactory result is obtained.
基金National Key Basic Research Project of China(973 program)(No.2013CB733600)National Natural Science Foundation of China(No.21176073)+1 种基金Program for New Century Excellent Talents in University,China(No.NCET-09-0346)the Fundamental Research Funds for the Central Universities,China
文摘To implement self-adaptive control parameters,a hybrid differential evolution algorithm integrated with particle swarm optimization( PSODE) is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual,and each original individual has its own symbiotic individual. Differential evolution( DE) operators are used to evolve the original population. And,particle swarm optimization( PSO) is applied to co-evolving the symbiotic population. Thus,with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functions. The results show that the average performance of PSODE is the best.
基金Supported by the National Natural Science Foundation of China(No.90820302,60805027)the Provincial Natural Science Foundation of Hunan(No.12JJ3064)+1 种基金the Construct Program of the Key Discipline in Hunan Province(No.201176)the Planned Science and Technology Project of Hunan Province(No.2011SK3135,2012FJ3059)
文摘Map building by multi-robot is very important to accomplish autonomous navigation,and one of the basic problems and research hotspots is how to merge the maps into a single one in the field of multi-robot map building.A novel approach is put forward based on adaptive differential evolution to map building for the multi-robot system.The multi-robot mapping-building system adopts the methods of decentralized exploration and concentrated mapping.The adaptive differential evolution algorithm is used to search in the space of possible transformation,and the iterative search is performed with the goal of maximizing overlapping regions.The map is translated and rotated so that the two maps can be overlapped and merged into a single global one successfully.This approach for map building can be realized without any knowledge of their relative positions.Experimental results show that the approach is effective and feasibile.
文摘Differential evolution algorithm based on the covariance matrix learning can adjust the coordinate system according to the characteristics of the population, which make<span style="font-family:Verdana;">s</span><span style="font-family:Verdana;"> the search move in a more favorable direction. In order to obtain more accurate information about the function shape, this paper propose</span><span style="font-family:Verdana;">s</span><span style="font-family:;" "=""> <span style="font-family:Verdana;">covariance</span><span style="font-family:Verdana;"> matrix learning differential evolution algorithm based on correlation (denoted as RCLDE)</span></span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">to improve the search efficiency of the algorithm. First, a hybrid mutation strategy is designed to balance the diversity and convergence of the population;secondly, the covariance learning matrix is constructed by selecting the individual with the less correlation;then, a comprehensive learning mechanism is comprehensively designed by two covariance matrix learning mechanisms based on the principle of probability. Finally,</span><span style="font-family:;" "=""> </span><span style="font-family:;" "=""><span style="font-family:Verdana;">the algorithm is tested on the CEC2005, and the experimental results are compared with other effective differential evolution algorithms. The experimental results show that the algorithm proposed in this paper is </span><span style="font-family:Verdana;">an effective algorithm</span><span style="font-family:Verdana;">.</span></span>
文摘现代战争中,跨平台武器单元的协同利用,是合同编队体系的重要内容,作战方式也正由平台级协同向着能力要素级协同转变,这对武器目标分配问题的解决提出了更大挑战。本文将武器单元的最小划分单位细化到能力要素级,以毁伤概率与成本消耗为优化目标,面向多种来袭目标的编队防空场景,提出了跨平台武器目标分配算法。同时,基于混沌映射提出了混沌种群重构(chaotic population reconstruction,CPR)机制,并结合带存档的自适应差分进化(adaptive differential evolution with optional external archive,JADE)算法提出了CPR-JADE算法,利用CPR机制可以帮助算法在解决高维复杂约束问题时跳出局部最优。再将其运用到武器目标分配模型上,实现了对模型的高效求解。最后,通过在多种数据规模下与其他进化优化算法的仿真对比试验分析,验证了所提方法的正确性与有效性。
文摘为进一步提高分割精度并加快分割速度,提出了一种基于邻域搜索可选外部存档自适应差分进行算法(简称为JADE-GL)的二维Otsu多阈值图像分割方案。首先,针对原始JADE算法精英突变策略收敛速度慢、容易陷入局部最优等问题,提出了基于邻域半径搜索的改进突变策略,以提升算法的全局探索和开发能力。然后,将所提算法与现有分割方法以及其他JADE变种算法进行二维Otsu多阈值分割对比实验。最后,通过函数收敛曲线、分割距离测度、峰值信噪比(peak signal to noise ratio,PSNR)等指标定量分析算法的性能。实验结果表明,随着阈值数增加,提出的算法无论在收敛速度、分割精度还是分割图像效果上都有显著提升。