A Multi-objective Particle Swarm Optimizer Hybridized with Scatter Search (original) (raw)
Related papers
Towards a More Efficient Multi-Objective Particle Swarm Optimizer
Theory and Practice
This chapter presents a hybrid between a particle swarm optimization (PSO) approach and scatter search. The main motivation for developing this approach is to combine the high convergence rate of the PSO algorithm with a local search approach based on scatter search, in order to have the main advantages of these two types of techniques. We propose a new leader selection scheme for PSO, which aims to accelerate convergence by increasing the selection pressure. However, this higher selection pressure reduces diversity. To alleviate that, scatter search is adopted after applying PSO, in order to spread the solutions previously obtained, so that a better distribution along the Pareto front is achieved. The proposed approach can produce reasonably good approximations of multi-objective problems of high dimensionality, performing only 4,000 fitness function evaluations. Test problems taken from the specialized literature are adopted to validate the proposed hybrid approach. Results are co...
EMOPSO: A Multi-Objective Particle Swarm Optimizer with Emphasis on Efficiency
Lecture Notes in Computer Science
This paper presents the Efficient Multi-Objective Particle Swarm Optimizer (EMOPSO), which is an improved version of a multiobjective evolutionary algorithm (MOEA) previously proposed by the authors. Throughout the paper, we provide several details of the design process that led us to EMOPSO. The main issues discussed are: the mechanism to maintain a set of well-distributed nondominated solutions, the turbulence operator that avoids premature convergence, the constraint-handling scheme, and the study of parameters that led us to propose a self-adaptation mechanism. The final algorithm is able to produce reasonably good approximations of the Pareto front of problems with up to 30 decision variables, while performing only 2,000 fitness function evaluations. As far as we know, this is the lowest number of evaluations reported so far for any multi-objective particle swarm optimizer. Our results are compared with respect to the NSGA-II in 12 test functions taken from the specialized literature.
Evolutionary multi-objective optimization of Particle Swarm Optimizers
Proc. of the 2007 IEEE Congress on Evolutionary Computation, 2007
One issue in applying Particle Swarm Optimization (PSO) is to find a good working set of parameters. The standard settings often work sufficiently but don't exhaust the possibilities of PSO. Furthermore, a trade-off between accuracy and computation time is of interest for complex evaluation functions. This paper presents results for using an EMO approach to optimize PSO parameters as well as to find a set of trade-offs between mean fitness and swarm size. It is applied to four typical benchmark functions known from literature. The results indicate that using an EMO approach simplifies the decision process of choosing a parameter set for a given problem.
Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization
This paper proposes an efficient particle swarm optimization (PSO) technique that can handle multi-objective optimization problems. It is based on the strength Pareto approach originally used in evolutionary algorithms (EA). The proposed modified particle swarm algorithm is used to build three hybrid EA-PSO algorithms to solve different multi-objective optimization problems. This algorithm and its hybrid forms are tested using seven benchmarks from the literature and the results are compared to the strength Pareto evolutionary algorithm (SPEA2) and a competitive multi-objective PSO using several metrics. The proposed algorithm shows a slower convergence, compared to the other algorithms, but requires less CPU time. Combining PSO and evolutionary algorithms leads to superior hybrid algorithms that outperform SPEA2, the competitive multi-objective PSO (MO-PSO), and the proposed strength Pareto PSO based on different metrics.
International Journal of Swarm Intelligence, 2016
This paper proposes a new variant of PSO algorithm with adaptive neighbourhood search of Pareto solutions to solve multi-objective optimisation problems. This algorithm essentially consists of identifying the particles responsible for worst solution and accelerating these particles towards the best solution in an adaptive manner. This concept is hybridised with the updation strategy of non-dominated solution using crowding distance. Performance of the proposed algorithm is demonstrated by solving standard multi-objective benchmark problems including CEC 2009. In particular we compare our method with two recent algorithms by considering the inverted generational distance, spacing, convergence and diversity as the performance metrics. The proposed algorithm is also compared with recent state of art methods in terms of inverted generational distance. The results demonstrate that the proposed algorithm is quite competitive in terms of the mentioned performance indicators as compared to other algorithms.
A Multi-Objective Evolutionary Hybrid Optimizer
2005
A new hybrid multi-objective, multivariable optimizer utilizing Strength Pareto Evolutionary Algorithm (SPEA), Non-dominated Sorting Differential Evolution (NSDE), and Multi-Objective Particle Swarm (MOPSO) has been created and tested. The optimizer features automatic switching among these algorithms to expedite the convergence of the optimal Pareto front in the objective function(s) space. The ultimate goal of using such a hybrid optimizer is to
Surrogate-based Multi-Objective Particle Swarm Optimization
2008 IEEE Swarm Intelligence Symposium, 2008
This paper presents a new algorithm that approximates real function evaluations using supervised learning with a surrogate method called support vector machine (SVM). We perform a comparative study among different leader selection schemes in a Multi-Objective Particle Swarm Optimizer (MOPSO), in order to determine the most appropriate approach to be adopted for solving the sort of problems of our interest. The resulting hybrid presents a poor spread of solutions, which motivates the introduction of a second phase to our algorithm, in which an approach called rough sets is adopted in order to improve the spread of solutions along the Pareto front. Rough sets are used as a local search engine, which is able to generate solutions in the neighborhood of the nondominated solutions previously generated by the surrogate-based algorithm. The resulting approach is able to generate reasonably good approximations of the Pareto front of problems of up to 30 decision variables with only 2,000 fitness function evaluations. Our results are compared with respect to the NSGA-II, which is a multi-objective evolutionary algorithm representative of the state-of-the-art in the area.
Multi-Objective Particle Swarm Optimizers: An Experimental Comparison
Lecture Notes in Computer Science, 2009
Particle Swarm Optimization (PSO) has received increased attention in the optimization research community since its first appearance. Regarding multi-objective optimization, a considerable number of algorithms based on Multi-Objective Particle Swarm Optimizers (MOP-SOs) can be found in the specialized literature. Unfortunately, no experimental comparisons have been made in order to clarify which version of MOPSO shows the best performance. In this paper, we use a benchmark composed of three well-known problem families (ZDT, DTLZ, and WFG) with the aim of analyzing the search capabilities of six representative state-of-the-art MOPSOs, namely, NSPSO, SigmaMOPSO, OMOPSO, AMOPSO, MOPSOpd, and CLMOPSO. We additionally propose a new MOPSO algorithm, called SMPSO, characterized by including a velocity constraint mechanism, obtaining promising results where the rest perform inadequately.
Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
International Journal of Computational Intelligence Research, 2006
The success of the Particle Swarm Optimization (PSO) algorithm as a single-objective optimizer (mainly when dealing with continuous search spaces) has motivated researchers to extend the use of this bio-inspired technique to other areas. One of them is multi-objective optimization. Despite the fact that the first proposal of a Multi-Objective Particle Swarm Optimizer (MOPSO) is over six years old, a considerable number of other algorithms have been proposed since then. This paper presents a comprehensive review of the various MOPSOs reported in the specialized literature. As part of this review, we include a classification of the approaches, and we identify the main features of each proposal. In the last part of the paper, we list some of the topics within this field that we consider as promising areas of future research.
Smpso: A new pso-based metaheuristic for multi-objective optimization
… intelligence in miulti- …, 2009
In this work, we present a new multi-objective particle swarm optimization algorithm (PSO) characterized by the use of a strategy to limit the velocity of the particles. The proposed approach, called Speed-constrained Multi-objective PSO (SMPSO) allows to produce new effective particle positions in those cases in which the velocity becomes too high. Other features of SMPSO include the use of polynomial mutation as a turbulence factor and an external archive to store the nondominated solutions found during the search. Our proposed approach is compared with respect to five multi-objective metaheuristics representative of the state-of-the-art in the area. For the comparison, two different criteria are adopted: the quality of the resulting approximation sets and the convergence speed to the Pareto front. The experiments carried out indicate that SMPSO obtains remarkable results in terms of both, accuracy and speed.