The recently invented artificial bee colony （ABC） al- gorithm is an optimization algorithm based on swarm intelligence that has been used to solve many kinds of numerical function optimization problems. It performs ...The recently invented artificial bee colony （ABC） al- gorithm is an optimization algorithm based on swarm intelligence that has been used to solve many kinds of numerical function optimization problems. It performs well in most cases, however, there still exists an insufficiency in the ABC algorithm that ignores the fitness of related pairs of individuals in the mechanism of find- ing a neighboring food source. This paper presents an improved ABC algorithm with mutual learning （MutualABC） that adjusts the produced candidate food source with the higher fitness between two individuals selected by a mutual learning factor. The perfor- mance of the improved MutualABC algorithm is tested on a set of benchmark functions and compared with the basic ABC algo- rithm and some classical versions of improved ABC algorithms. The experimental results show that the MutualABC algorithm with appropriate parameters outperforms other ABC algorithms in most experiments.展开更多
The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the proble...The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.展开更多
Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes th...Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.展开更多
Software debugging accounts for a vast majority of the financial and time costs in software developing and maintenance. Thus, approaches of software fault localization that can help automate the debugging process have...Software debugging accounts for a vast majority of the financial and time costs in software developing and maintenance. Thus, approaches of software fault localization that can help automate the debugging process have become a hot topic in the field of software engineering. Given the great demand for software fault localization, an approach based on the artificial bee colony （ABC） algorithm is proposed to be integrated with other related techniques. In this process, the source program is initially instrumented after analyzing the dependence information. The test case sets are then compiled and run on the instrumented program, and execution results are input to the ABC algorithm. The algorithm can determine the largest fitness value and best food source by calculating the average fitness of the employed bees in the iteralive process. The program unit with the highest suspicion score corresponding to the best test case set is regarded as the final fault localization. Experiments are conducted with the TCAS program in the Siemens suite. Results demonstrate that the proposed fault localization method is effective and efficient. The ABC algorithm can efficiently avoid the local optimum, and ensure the validity of the fault location to a larger extent.展开更多
针对由于人工蜂群算法(Artificial Bee Colony algorithm,ABC)采用直接映射概率选择食物源而引起收敛速度慢、陷入局部最优等问题,提出一种混合排名映射概率和混沌搜索的人工蜂群算法((Artificial Bee Colony algorithm based on Hybrid...针对由于人工蜂群算法(Artificial Bee Colony algorithm,ABC)采用直接映射概率选择食物源而引起收敛速度慢、陷入局部最优等问题,提出一种混合排名映射概率和混沌搜索的人工蜂群算法((Artificial Bee Colony algorithm based on Hybrid rank mapping probability and Chaotic search,ABC-HC))。首先,利用目标函数值的排名来获取选择食物源的排名映射概率,并提出计算排名映射概率的两种方法;然后,在观察蜂阶段,融合这两种计算概率的方法,即不同的搜索阶段采用不同的排名映射方法计算食物源选择概率,构造基于混合排名映射概率的人工蜂群算法,以便能够维持种群的多样性避免陷于局部最优;最后,在侦查蜂阶段,使用混沌搜索替代随机搜索以便进一步提高收敛速度,最终获得较好的全局最优解。对10个标准测试函数进行仿真,结果表明,ABC-HC算法不仅提高了收敛速度,而且更能跳出局部最优,有效地找到全局最优解,优于标准的ABC算法和进化算法。展开更多
针对人工蜂群(ABC)算法开发能力弱的缺点,提出一种基于适应度分割机制和自适应搜索策略的ABC算法(FSABC)。首先,在雇佣蜂和跟随蜂阶段开始前,根据适应度值将种群划分为高适应度子种群和低适应度子种群,并通过动态调整子种群大小,更好地...针对人工蜂群(ABC)算法开发能力弱的缺点,提出一种基于适应度分割机制和自适应搜索策略的ABC算法(FSABC)。首先,在雇佣蜂和跟随蜂阶段开始前,根据适应度值将种群划分为高适应度子种群和低适应度子种群,并通过动态调整子种群大小,更好地平衡算法的开发性和探索性,并更合理地分配搜索资源;其次,对跟随蜂中的高适应度子种群提出一个策略池和一种新的自适应搜索方式,以避免算法陷入局部最优解;再次,为了加强算法的开发能力,根据高适应度子种群的特点,设计一个新的搜索策略和一个策略池,以发挥该子种群的优势,从而提高算法的性能;最后,对于复杂的多峰问题,在适应度景观中存在许多局部最优解,其中一些可能接近全局最优解,因此,搜索一个好的解的邻域将有助于找到更好的解,甚至可能找到全局最优解,鉴于此,使用一个邻域搜索算子加强算法的开发能力。基于22个经典测试函数进行比较实验的结果表明,在30维和50维问题上,与ABCLGII(ABC algorithm with Local and Global Information Interaction)相比,所提算法的Friedman检验的秩次等级分别提高了30.8%和11.7%,可见,所提算法的性能求解精度更优,并能有效处理全局数值优化问题。展开更多
基金supported by the National Natural Science Foundation of China (60803074)the Fundamental Research Funds for the Central Universities (DUT10JR06)
文摘The recently invented artificial bee colony （ABC） al- gorithm is an optimization algorithm based on swarm intelligence that has been used to solve many kinds of numerical function optimization problems. It performs well in most cases, however, there still exists an insufficiency in the ABC algorithm that ignores the fitness of related pairs of individuals in the mechanism of find- ing a neighboring food source. This paper presents an improved ABC algorithm with mutual learning （MutualABC） that adjusts the produced candidate food source with the higher fitness between two individuals selected by a mutual learning factor. The perfor- mance of the improved MutualABC algorithm is tested on a set of benchmark functions and compared with the basic ABC algo- rithm and some classical versions of improved ABC algorithms. The experimental results show that the MutualABC algorithm with appropriate parameters outperforms other ABC algorithms in most experiments.
基金supported by the National Natural Science Foundation of China(61201370)the Special Funding Project for Independent Innovation Achievement Transform of Shandong Province(2012CX30202)the Natural Science Foundation of Shandong Province(ZR2014FM039)
文摘The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.
基金supported by the National Natural Science Foundation of China(6060309260975042)
文摘Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.
文摘Software debugging accounts for a vast majority of the financial and time costs in software developing and maintenance. Thus, approaches of software fault localization that can help automate the debugging process have become a hot topic in the field of software engineering. Given the great demand for software fault localization, an approach based on the artificial bee colony （ABC） algorithm is proposed to be integrated with other related techniques. In this process, the source program is initially instrumented after analyzing the dependence information. The test case sets are then compiled and run on the instrumented program, and execution results are input to the ABC algorithm. The algorithm can determine the largest fitness value and best food source by calculating the average fitness of the employed bees in the iteralive process. The program unit with the highest suspicion score corresponding to the best test case set is regarded as the final fault localization. Experiments are conducted with the TCAS program in the Siemens suite. Results demonstrate that the proposed fault localization method is effective and efficient. The ABC algorithm can efficiently avoid the local optimum, and ensure the validity of the fault location to a larger extent.
文摘针对由于人工蜂群算法(Artificial Bee Colony algorithm,ABC)采用直接映射概率选择食物源而引起收敛速度慢、陷入局部最优等问题,提出一种混合排名映射概率和混沌搜索的人工蜂群算法((Artificial Bee Colony algorithm based on Hybrid rank mapping probability and Chaotic search,ABC-HC))。首先,利用目标函数值的排名来获取选择食物源的排名映射概率,并提出计算排名映射概率的两种方法;然后,在观察蜂阶段,融合这两种计算概率的方法,即不同的搜索阶段采用不同的排名映射方法计算食物源选择概率,构造基于混合排名映射概率的人工蜂群算法,以便能够维持种群的多样性避免陷于局部最优;最后,在侦查蜂阶段,使用混沌搜索替代随机搜索以便进一步提高收敛速度,最终获得较好的全局最优解。对10个标准测试函数进行仿真,结果表明,ABC-HC算法不仅提高了收敛速度,而且更能跳出局部最优,有效地找到全局最优解,优于标准的ABC算法和进化算法。
文摘针对人工蜂群(ABC)算法开发能力弱的缺点,提出一种基于适应度分割机制和自适应搜索策略的ABC算法(FSABC)。首先,在雇佣蜂和跟随蜂阶段开始前,根据适应度值将种群划分为高适应度子种群和低适应度子种群,并通过动态调整子种群大小,更好地平衡算法的开发性和探索性,并更合理地分配搜索资源;其次,对跟随蜂中的高适应度子种群提出一个策略池和一种新的自适应搜索方式,以避免算法陷入局部最优解;再次,为了加强算法的开发能力,根据高适应度子种群的特点,设计一个新的搜索策略和一个策略池,以发挥该子种群的优势,从而提高算法的性能;最后,对于复杂的多峰问题,在适应度景观中存在许多局部最优解,其中一些可能接近全局最优解,因此,搜索一个好的解的邻域将有助于找到更好的解,甚至可能找到全局最优解,鉴于此,使用一个邻域搜索算子加强算法的开发能力。基于22个经典测试函数进行比较实验的结果表明,在30维和50维问题上,与ABCLGII(ABC algorithm with Local and Global Information Interaction)相比,所提算法的Friedman检验的秩次等级分别提高了30.8%和11.7%,可见,所提算法的性能求解精度更优,并能有效处理全局数值优化问题。
