scholarly journals Self-Adaptive Multi-Task Differential Evolution Optimization: With Case Studies in Weapon–Target Assignment Problem

Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 2945
Author(s):  
Xiaolong Zheng ◽  
Deyun Zhou ◽  
Na Li ◽  
Tao Wu ◽  
Yu Lei ◽  
...  

Multi-task optimization (MTO) is related to the problem of simultaneous optimization of multiple optimization problems, for the purpose of solving these problems better in terms of optimization accuracy or time cost. To handle MTO problems, there emerges many evolutionary MTO (EMTO) algorithms, which possess distinguished strategies or frameworks in the aspect of handling the knowledge transfer between different optimization problems (tasks). In this paper, we explore the possibility of developing a more efficient EMTO solver based on differential evolution by introducing the strategies of a self-adaptive multi-task particle swarm optimization (SaMTPSO) algorithm, and by developing a new knowledge incorporation strategy. Then, we try to apply the proposed algorithm to solve the weapon–target assignment problem, which has never been explored in the field of EMTO before. Experiments were conducted on a popular MTO test benchmark and a WTA-MTO test set. Experimental results show that knowledge transfer in the proposed algorithm is effective and efficient, and EMTO is promising in solving WTA problems.

2018 ◽  
Vol 7 (2.6) ◽  
pp. 88
Author(s):  
S R.Sujatha ◽  
M Siddappa

An original learning algorithm for solving global numerical optimization problems is proposed. The proposed algorithm is strong stochastic search method which is based on evaluation and optimization of a hypercube and is called the hypercube optimization (HO) algorithm. The hypercube optimization algorithm includes the initialization and evaluation process, and searching space process. The designed HO algorithm is tested on specific benchmark functions. The comparative performance analysis have made against with other approaches of dynamic weight particle swarm optimization and self-adaptive differential evolution algorithm. Convergence characteristics of self-adaptive differential evolution algorithm has deliver the much better functional   value in compare to dynamic weight based particle swarm optimization.


Author(s):  
Ali Kaveh ◽  
S.R. Hoseini Vaez ◽  
Pedram Hosseini

In this study, the Modified Dolphin Monitoring (MDM) operator is used to enhance the performance of some metaheuristic algorithms. The MDM is a recently presented operator that controls the population dispersion in each iteration. Algorithms are selected from some well-established algorithms. Here, this operator is applied on Differential Evolution (DE), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Vibrating Particles System (VPS), Enhanced Vibrating Particles System (EVPS), Colliding Bodied Optimization (CBO) and Harmony Search (HS) and the performance of these algorithms are evaluated with and without this operator on three well-known structural optimization problems. The results show the performance of this operator on these algorithms for the best, the worst, average and average weight of the first quarter of answers.


Author(s):  
Shailendra Aote ◽  
Mukesh M. Raghuwanshi

To solve the problems of optimization, various methods are provided in different domain. Evolutionary computing (EC) is one of the methods to solve these problems. Mostly used EC techniques are available like Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Differential Evolution (DE). These techniques have different working structure but the inner working structure is same. Different names and formulae are given for different task but ultimately all do the same. Here we tried to find out the similarities among these techniques and give the working structure in each step. All the steps are provided with proper example and code written in MATLAB, for better understanding. Here we started our discussion with introduction about optimization and solution to optimization problems by PSO, GA and DE. Finally, we have given brief comparison of these.


2010 ◽  
Vol 26-28 ◽  
pp. 1151-1154
Author(s):  
Zong Li Liu ◽  
Jie Cao ◽  
Zhan Ting Yuan

The optimization of complex systems, such as production scheduling systems and control systems, often encounters some difficulties, such as large-scale, hard to model, time consuming to evaluate, NP-hard, multi-modal, uncertain and multi-objective, etc. It is always a hot research topic in academic and engineering fields to propose advanced theory and effective algorithms. As a novel evolutionary computing technique, particle swarm optimization (PSO) is characterized by not being limited by the representation of the optimization problems, and by global optimization ability, which has gained wide attentation and research from both academic and industry fields. The task assignment problem in the enterprise with directed graph model is presented. Task assignment problem with buffer zone is solved via a hybrid PSO algorithm. Simulation result shows that the model and the algorithm are effective to the problem.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaobing Yu ◽  
Jie Cao ◽  
Haiyan Shan ◽  
Li Zhu ◽  
Jun Guo

Particle swarm optimization (PSO) and differential evolution (DE) are both efficient and powerful population-based stochastic search techniques for solving optimization problems, which have been widely applied in many scientific and engineering fields. Unfortunately, both of them can easily fly into local optima and lack the ability of jumping out of local optima. A novel adaptive hybrid algorithm based on PSO and DE (HPSO-DE) is formulated by developing a balanced parameter between PSO and DE. Adaptive mutation is carried out on current population when the population clusters around local optima. The HPSO-DE enjoys the advantages of PSO and DE and maintains diversity of the population. Compared with PSO, DE, and their variants, the performance of HPSO-DE is competitive. The balanced parameter sensitivity is discussed in detail.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
YingChao Zhang ◽  
Xiong Xiong ◽  
QiDong Zhang

This paper presented an improved self-adaptive particle swarm optimization (IDPSO) algorithm with detection function to solve multimodal function optimization problems. To overcome the premature convergence of PSO in a short time, the evolution direction of each particle is redirected dynamically by tuning the three parameters of IDPSO in the evolution process. Numerical results on several benchmark functions indicate that the IDPSO strategy outperformed other variants of PSO.


Sign in / Sign up

Export Citation Format

Share Document