Differential evolution with dynamic neighborhood learning strategy based mutation operators

Author(s):  
Yiqiao Cai ◽  
Guo Sun
Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 298 ◽  
Author(s):  
Jyun-Yu Jhang ◽  
Cheng-Jian Lin ◽  
Kuu-Young Young

This study provides an effective cooperative carrying and navigation control method for mobile robots in an unknown environment. The manager mode switches between two behavioral control modes—wall-following mode (WFM) and toward-goal mode (TGM)—based on the relationship between the mobile robot and the unknown environment. An interval type-2 fuzzy neural controller (IT2FNC) based on a dynamic group differential evolution (DGDE) is proposed to realize the carrying control and WFM control for mobile robots. The proposed DGDE uses a hybrid method that involves a group concept and an improved differential evolution to overcome the drawbacks of the traditional differential evolution algorithm. A reinforcement learning strategy was adopted to develop an adaptive WFM control and achieve cooperative carrying control for mobile robots. The experimental results demonstrated that the proposed DGDE is superior to other algorithms at using WFM control. Moreover, the experimental results demonstrate that the proposed method can complete the task of cooperative carrying, and can realize navigation control to enable the robot to reach the target location.


2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Zhongbo Hu ◽  
Shengwu Xiong ◽  
Qinghua Su ◽  
Xiaowei Zhang

The differential evolution algorithm (DE) is one of the most powerful stochastic real-parameter optimization algorithms. The theoretical studies on DE have gradually attracted the attention of more and more researchers. However, few theoretical researches have been done to deal with the convergence conditions for DE. In this paper, a sufficient condition and a corollary for the convergence of DE to the global optima are derived by using the infinite product. A DE algorithm framework satisfying the convergence conditions is then established. It is also proved that the two common mutation operators satisfy the algorithm framework. Numerical experiments are conducted on two parts. One aims to visualize the process that five convergent DE based on the classical DE algorithms escape from a local optimal set on two low dimensional functions. The other tests the performance of a modified DE algorithm inspired of the convergent algorithm framework on the benchmarks of the CEC2005.


Author(s):  
Willian B. De Melo

The allocation of trucks in open pit mines is a field with great potential for optimizing resources and applying advanced computer modeling techniques, mainly because many companies still choose to use manual allocation, which is premised on the decisions made by the operator, being subject to common failures and not reaching the maximum potential that the equipment can provide. Therefore, this work focuses on optimizing the allocation of trucks in order to increase production, reducing queue time and keeping ore grades within proper limits. The proposed algorithm was based on the differential evolution technique, where two types of mutation operators were used: rand/1/bin and best/1/bin, thus verifying the most suitable to solve the problem. The trucks were allocated in the ore loading and unloading process, aiming to improve the production capacity in a virtual mine. The results brought a convergence to the maximum global production, in addition to which, the allocation of unnecessary transport equipment to the planned routes was avoided. The two mutation operators compared had certain advantages and disadvantages, each better adapting to certain types of situations. The proposed technique can still be extended to other areas, for example, in the transport of grain on the road network or in the implementation of an allocation in freight cars that transport grain.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Hong Li ◽  
Li Zhang

Two mutation operators are used in the differential evolution algorithm to improve the diversity of population. An improved constraint-handling technique based on a comparison mechanism is presented, and then it is combined with the selection operator in the differential evolution algorithm to fulfill constraint handling and selection simultaneously. A differential evolution with two mutation strategies and a selection based on this improved constraint-handling technique is developed to solve bilevel programming problems. The simulation results on some linear and nonlinear bilevel programming problems show the effectiveness and efficiency of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document