2,015 research outputs found
Multiobjective differential evolution enhanced with principle component analysis for constrained optimization
Multiobjective evolutionary algorithms (MOEAs) have been successfully applied to a number of constrained optimization problems. Many of them adopt mutation and crossover operators from differential evolution. However, these operators do not explicitly utilise features of fitness landscapes. To improve the performance of algorithms, this paper aims at designing a search operator adapting to fitness landscapes. Through an observation, we find that principle component analysis (PCA) can be used to characterise fitness landscapes. Based on this finding, a new search operator, called PCA-projection, is proposed. In order to verify the effectiveness of PCA-projection, we design two algorithms enhanced with PCA-projection for solving constrained optimization problems, called PMODE and HECO-PDE, respectively. Experiments have been conducted on the IEEE CEC 2017 competition benchmark suite in constrained optimization. PMODE and HECO-PDE are compared with the algorithms from the IEEE CEC 2018 competition and another recent MOEA for constrained optimization. Experimental results show that an algorithm enhanced with PCA-projection performs better than its corresponding opponent without this operator. Furthermore, HECO-PDE is ranked first on all dimensions according to the competition rules. This study reveals that decomposition-based MOEAs, such as HECO-PDE, are competitive with best single-objective and multiobjective evolutionary algorithms for constrained optimization, but MOEAs based on non-dominance, such as PMODE, may not
A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms
A review of optimization techniques in spacecraft flight trajectory design
For most atmospheric or exo-atmospheric spacecraft flight scenarios, a well-designed trajectory is usually a key for stable flight and for improved guidance and control of the vehicle. Although extensive research work has been carried out on the design of spacecraft trajectories for different mission profiles and many effective tools were successfully developed for optimizing the flight path, it is only in the recent five years that there has been a growing interest in planning the flight trajectories with the consideration of multiple mission objectives and various model errors/uncertainties. It is worth noting that in many practical spacecraft guidance, navigation and control systems, multiple performance indices and different types of uncertainties must frequently be considered during the path planning phase. As a result, these requirements bring the development of multi-objective spacecraft trajectory optimization methods as well as stochastic spacecraft trajectory optimization algorithms. This paper aims to broadly review the state-of-the-art development in numerical multi-objective trajectory optimization algorithms and stochastic trajectory planning techniques for spacecraft flight operations. A brief description of the mathematical formulation of the problem is firstly introduced. Following that, various optimization methods that can be effective for solving spacecraft trajectory planning problems are reviewed, including the gradient-based methods, the convexification-based methods, and the evolutionary/metaheuristic methods. The multi-objective spacecraft trajectory optimization formulation, together with different class of multi-objective optimization algorithms, is then overviewed. The key features such as the advantages and disadvantages of these recently-developed multi-objective techniques are summarised. Moreover, attentions are given to extend the original deterministic problem to a stochastic version. Some robust optimization strategies are also outlined to deal with the stochastic trajectory planning formulation. In addition, a special focus will be given on the recent applications of the optimized trajectory. Finally, some conclusions are drawn and future research on the development of multi-objective and stochastic trajectory optimization techniques is discussed
Process Knowledge-guided Autonomous Evolutionary Optimization for Constrained Multiobjective Problems
Various real-world problems can be attributed to constrained multi-objective optimization problems. Although there are various solution methods, it is still very challenging to automatically select efficient solving strategies for constrained multi-objective optimization problems. Given this, a process knowledge-guided constrained multi-objective autonomous evolutionary optimization method is proposed. Firstly, the effects of different solving strategies on population states are evaluated in the early evolutionary stage. Then, the mapping model of population states and solving strategies is established. Finally, the model recommends subsequent solving strategies based on the current population state. This method can be embedded into existing evolutionary algorithms, which can improve their performances to different degrees. The proposed method is applied to 41 benchmarks and 30 dispatch optimization problems of the integrated coal mine energy system. Experimental results verify the effectiveness and superiority of the proposed method in solving constrained multi-objective optimization problems.The National Key R&D Program of China, the National Natural Science Foundation of China, Shandong Provincial Natural Science Foundation, Fundamental Research Funds for the Central
Universities and the Open Research Project of The
Hubei Key Laboratory of Intelligent Geo-Information Processing.http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235hj2023Electrical, Electronic and Computer Engineerin
Recommended from our members
Shuffled Complex-Self Adaptive Hybrid EvoLution (SC-SAHEL) optimization framework
Simplicity and flexibility of meta-heuristic optimization algorithms have attracted lots of attention in the field of optimization. Different optimization methods, however, hold algorithm-specific strengths and limitations, and selecting the best-performing algorithm for a specific problem is a tedious task. We introduce a new hybrid optimization framework, entitled Shuffled Complex-Self Adaptive Hybrid EvoLution (SC-SAHEL), which combines the strengths of different evolutionary algorithms (EAs) in a parallel computing scheme. SC-SAHEL explores performance of different EAs, such as the capability to escape local attractions, speed, convergence, etc., during population evolution as each individual EA suits differently to various response surfaces. The SC-SAHEL algorithm is benchmarked over 29 conceptual test functions, and a real-world hydropower reservoir model case study. Results show that the hybrid SC-SAHEL algorithm is rigorous and effective in finding global optimum for a majority of test cases, and that it is computationally efficient in comparison to algorithms with individual EA
Recommended from our members
A survey of swarm intelligence for dynamic optimization: algorithms and applications
Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given
Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the `Rush to Heuristics'
In the power and energy systems area, a progressive increase of literature contributions that contain applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods that are based on weak comparisons. This ‘rush to heuristics’ does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems and aims at providing a comprehensive view of the main issues that concern the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls that are found in literature contributions are identified, and specific guidelines are provided regarding how to prepare sound contributions on the application of metaheuristic algorithms to specific problems
Helper and Equivalent Objectives:Efficient Approach for Constrained Optimization
Numerous multi-objective evolutionary algorithms have been designed for
constrained optimisation over past two decades. The idea behind these
algorithms is to transform constrained optimisation problems into
multi-objective optimisation problems without any constraint, and then solve
them. In this paper, we propose a new multi-objective method for constrained
optimisation, which works by converting a constrained optimisation problem into
a problem with helper and equivalent objectives. An equivalent objective means
that its optimal solution set is the same as that to the constrained problem
but a helper objective does not. Then this multi-objective optimisation problem
is decomposed into a group of sub-problems using the weighted sum approach.
Weights are dynamically adjusted so that each subproblem eventually tends to a
problem with an equivalent objective. We theoretically analyse the computation
time of the helper and equivalent objective method on a hard problem called
``wide gap''. In a ``wide gap'' problem, an algorithm needs exponential time to
cross between two fitness levels (a wide gap). We prove that using helper and
equivalent objectives can shorten the time of crossing the ``wide gap''. We
conduct a case study for validating our method. An algorithm with helper and
equivalent objectives is implemented. Experimental results show that its
overall performance is ranked first when compared with other eight state-of-art
evolutionary algorithms on IEEE CEC2017 benchmarks in constrained optimisation
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality, heuristics-based swarm intelligence can be an efficient alternative. Particle swarm optimization (PSO), part of the swarm intelligence family, is known to effectively solve large-scale nonlinear optimization problems. This paper presents a detailed overview of the basic concepts of PSO and its variants. Also, it provides a comprehensive survey on the power system applications that have benefited from the powerful nature of PSO as an optimization technique. For each application, technical details that are required for applying PSO, such as its type, particle formulation (solution representation), and the most efficient fitness functions are also discussed
- …