K. E. Parsopoulos
ABSTRACT
This paper constitutes a first study of the Particle Swarm Optimization (PSO) method in Multiobjective Optimization (MO) problems. The ability of PSO to detect Pareto Optimal points and capture the shape of the Pareto Front is studied through experiments on well-known non-trivial test functions. The Weighted Aggregation technique with fixed or adaptive weights is considered. Furthermore, critical aspects of the VEGA approach for Multiobjective Optimization using Genetic Algorithms are adapted to the PSO framework in order to develop a multi-swarm PSO that can cope effectively with MO problems. Conclusions are derived and ideas for further research are proposed.
- H. Ahonen, P. A. Desouza, and V. K. Garg. A Genetic Algorithm for Fitting Lorentzian Line-Shapes in Mossbauer-Spectra. Nuclear Instruments & Methods in Physics Research, 124(4):633-638, 1997.Google Scholar
Cross Ref
- T. S. Bush, C. R. A. Catlow, and P. D. Battle. Evolutionary Programming Techniques for Predicting Inorganic Crystal-Structures. J. Materials Chemistry, 5(8):1269-1272, 1995.Google Scholar
- R. C. Eberhart and J. Kennedy. A New Optimizer Using Particle Swarm Theory. In Proc. 6th Int. Symp. on Micro Mach. & Hum. Sci., pages 39-43, 1995.Google ScholarCross Ref
- R. C. Eberhart and Y. H. Shi. Evolving Artificial Neural Networks. In Proc. Int. Conf. on Neural Networks and Brain, 1998.Google Scholar
- R. C. Eberhart, P. K. Simpson, and R. W. Dobbins. Computational Intelligence PC Tools. Academic Press Professional, Boston, 1996. Google ScholarDigital Library
- J. Kennedy and R. C. Eberhart. Particle Swarm Optimization. In Proc. of the IEEE Int. Conf. Neural Networks, pages 1942-1948, 1995.Google ScholarCross Ref
- J. Kennedy and R. C. Eberhart. Swarm Intelligence. Morgan Kaufmann Publishers, 2001. Google ScholarDigital Library
- J. D. Knowles and D. W. Corne. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategies. Evolutionary Computation, 8(2):149-172, 2000. Google ScholarDigital Library
- Y. Jin, M. Olhofer, and B. Sendhoff. Dynamic Weighted Aggregation for Evolutionary Multi-Objective Optimization: Why Does It Work and How?. In Proc. GECCO 2001 Conf., 2001.Google Scholar
- K. E. Parsopoulos, V. P. Plagianakos, G. D. Magoulas, and M. N. Vrahatis. Objective Function "Stretching" to Alleviate Convergence to Local Minima. Nonlinear Analysis, TMA, 47(5):3419-3424, 2000.Google Scholar
- K. E. Parsopoulos, V. P. Plagianakos, G. D. Magoulas, and M. N. Vrahatis. Stretching Technique for Obtaining Global Minimizers Through Particle Swarm Optimization. In Proc. Particle Swarm Optimization Workshop, pages 22-29, 2001.Google Scholar
- K. E Parsopoulos and M. N. Vrahatis. Modification of the Particle Swarm Optimizer for Locating All the Global Minima. V. Kurkova, N. Steele, R. Neruda, M. Karny (Eds.), Artificial Neural Networks and Genetic Algorithms, pages 324-327, Springer, 2001.Google ScholarCross Ref
- K. E. Parsopoulos and M. N. Vrahatis. Particle Swarm Optimizer in Noisy and Continuously Changing Environments. M. H. Hamza (Ed.), Artificial Intelligence and Soft Computing, pages 289-294, IASTED/ACTA Press, 2001.Google Scholar
- W. Paszkowicz. Application of the Smooth Genetic Algorithm for Indexing Powder Patterns: Test for the Orthorhombic System. Materials Science Forum, 228(1&2):19-24, 1996.Google ScholarCross Ref
- W. H. Press, W. T. Vetterling, S. A. Teukolsky, and B. P. Flannery. Numerical Recipes in Fortran 77, Cambridge University Press, Cambridge, 1992. Google ScholarDigital Library
- J. D. Schaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. In Genetic Algorithms and their Applications: Proc. first Int. Conf. on Genetic Algorithms, pages 93-100, 1985. Google ScholarDigital Library
- Y. Shi, R. C. Eberhart, and Y. Chen. Implementation of Evolutionary Fuzzy Systems. IEEE Trans. Fuzzy Systems, 7(2):109-119, 1999. Google ScholarDigital Library
- A. J. Skinner and J. Q. Broughton. Neural Networks in Computational Materials Science: Training Algorithms. Modelling and Simulation in Material Science and Engineering, 3(3):371-390, 1995.Google Scholar
- K. Swinehart, M. Yasin, and E. Guimaraes. Applying an Analytical Approach to Shop-Floor Scheduling: A Case-Study. Int. J. Materials & Product Technology, 11(1-2):98-107, 1996.Google Scholar
- E. Zitzler. Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. Ph.D. thesis, Swiss Fed. Inst. Techn. Zurich, 1999.Google Scholar
- E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolution Algorithms: Empirical Results. Evolutionary Computation, 8(2):173-195, 2000. Google ScholarDigital Library
Index Terms
- Particle swarm optimization method in multiobjective problems
Recommendations
An effective use of crowding distance in multiobjective particle swarm optimization
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computationIn this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of crowding distance computation into the algorithm of PSO, specifically on ...
An parallel particle swarm optimization approach for multiobjective optimization problems
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationThis paper proposes a parallel particle swarm optimization (PPSO) to solve the multiobjective optimization problems (MOP). PPSO makes the use of the parallel characteristic of the PSO algorithm to deal with the multiple objectives issue of the MOP. PPSO ...
Two-level of nondominated solutions approach to multiobjective particle swarm optimization
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationIn multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergence and diversity of solutions, especially when optimizing problems with ...
Comments