scholarly journals Tracking Moving Optima Using Kalman-Based Predictions

2008 ◽  
Vol 16 (1) ◽  
pp. 1-30 ◽  
Author(s):  
Claudio Rossi ◽  
Mohamed Abderrahim ◽  
Julio César Díaz

The dynamic optimization problem concerns finding an optimum in a changing environment. In the field of evolutionary algorithms, this implies dealing with a time-changing fitness landscape. In this paper we compare different techniques for integrating motion information into an evolutionary algorithm, in the case it has to follow a time-changing optimum, under the assumption that the changes follow a nonrandom law. Such a law can be estimated in order to improve the optimum tracking capabilities of the algorithm. In particular, we will focus on first order dynamical laws to track moving objects. A vision-based tracking robotic application is used as testbed for experimental comparison.

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jing Xiao ◽  
Jing-Jing Li ◽  
Xi-Xi Hong ◽  
Min-Mei Huang ◽  
Xiao-Min Hu ◽  
...  

As it is becoming extremely competitive in software industry, large software companies have to select their project portfolio to gain maximum return with limited resources under many constraints. Project portfolio optimization using multiobjective evolutionary algorithms is promising because they can provide solutions on the Pareto-optimal front that are difficult to be obtained by manual approaches. In this paper, we propose an improved MOEA/D (multiobjective evolutionary algorithm based on decomposition) based on reference distance (MOEA/D_RD) to solve the software project portfolio optimization problems with optimizing 2, 3, and 4 objectives. MOEA/D_RD replaces solutions based on reference distance during evolution process. Experimental comparison and analysis are performed among MOEA/D_RD and several state-of-the-art multiobjective evolutionary algorithms, that is, MOEA/D, nondominated sorting genetic algorithm II (NSGA2), and nondominated sorting genetic algorithm III (NSGA3). The results show that MOEA/D_RD and NSGA2 can solve the software project portfolio optimization problem more effectively. For 4-objective optimization problem, MOEA/D_RD is the most efficient algorithm compared with MOEA/D, NSGA2, and NSGA3 in terms of coverage, distribution, and stability of solutions.


Author(s):  
V.Z Manusov ◽  
P.V. Matrenin ◽  
N. Khasanzoda

Optimization of a power supply system is one of the main directions in power engineering research. The reactive power compensation reduces active power losses in transmission lines. In general, researches devoted to allocation and control of the compensation units consider this issue as a static optimization problem. However, it is dynamic and stochastic optimization problem that requires a real-time solution. To solve the dynamic optimization NP-hard problem, it is advisable to use Swarm Intelligence. This research deals with the problem of the compensation units power control as a dynamic optimization problem, considering the possible stochastic failures of the compensation units. The Particle Swarm Optimization and the Bees Algorithm were applied to solve it to compare the effectiveness of these algorithms in the dynamic optimization of a power supply system.


Sign in / Sign up

Export Citation Format

Share Document