Carlo R. Raquel
ABSTRACT
In 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 global best selection and in the deletion method of an external archive of nondominated solutions. The crowding distance mechanism together with a mutation operator maintains the diversity of nondominated solutions in the external archive. The performance of this approach is evaluated on test functions and metrics from literature. The results show that the proposed approach is highly competitive in converging towards the Pareto front and generates a well distributed set of nondominated solutions.
- Coello, C., Pulido, G., and Salazar, M. Handling multiobjectives with particle swarm optimization. In IEEE Transactions on Evolutionary Computation, vol. 8, pp. 256--279, June 2004.]] Google Scholar
Digital Library
- Coello, C. and Pulido, G. Multiobjective optimization using a micro-genetic algorithm. In Proc. of Genetic and Evolutionary Computation Conference (GECCO 2001), L. Spector, E. D. Goodman, A.Wu,W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke, Eds., San Francisco, CA, pp. 274--282, 2001.]]Google Scholar
- Deb, K. Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evolutionary Computing, vol. 7, pp. 205--230, Fall 1999.]] Google ScholarDigital Library
- Deb, K., Agrawal, S., Pratab, A., and Meyarivan, T. A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In Proc. Parallel Problem Solving from Nature VI Conference, pp. 849--858, 2000.]] Google ScholarDigital Library
- Fieldsend, J. and Singh, S. A multi-objective algorithm based upon particle swarm optimization, an efficient data structure and turbulence. In Proc. 2002 U.K. Workshop on Computational Intelligence, Birmingham, U.K., pp. 37--44, Sept. 2002.]]Google Scholar
- Goldberg, D., Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.]] Google ScholarDigital Library
- Kennedy, J. and Eberhart, R.. Particle Swarm Optimization. In Proceedings of the Fourth IEEE International Conference on Neural Networks, Perth, Australia, 1995.]]Google ScholarCross Ref
- Kita, H., Yabumoto, Y., Mori, N., and Nishikawa, Y. Multi-objective optimization by means of the thermodynamical genetic algorithm. In Parallel Problem Solving From Nature-PPSN IV, H.-M. Voigt,W. Ebeling, I. Rechenberg, and H.-P. Schwefel, Eds. Berlin, Germany: Springer-Verlag, Lecture Notes in Computer Science, pp. 504--512, Sept. 1996.]] Google ScholarDigital Library
- Knowles, J. and Corne, D. Approximating the nondominated front using the Pareto archived evolution strategy. Evol. Computing, vol. 8, pp. 149--172, 2000.]] Google ScholarDigital Library
- Kursawe, F. A variant of evolution strategies for vector optimization. In Lecture Notes in Computer Science, H. P. Schwefel and R. Manner, Eds. Berlin, Germany: Springer-Verlag, vol. 496, Proc. Parallel Problem Solving From Nature, 1st Workshop, PPSN I, pp. 193--197, Oct 1991.]] Google ScholarDigital Library
- Li, X. et al. A nondominated sorting particle swarm optimizer for multiobjective optimization. In Lecture Notes in Computer Science, vol. 2723, Proc. Genetic and Evolutionary Computation, GECCO 2003, Part I, E. Cantú-Paz et al., Eds. Berlin, Germany, pp. 37--48, July 2003.]] Google ScholarDigital Library
- Parsopoulos, K. and Vrahatis, M. Particle swarm optimization method in multiobjective problems. In Proc. 2002 ACM Symp. Applied Computing (SAC'2002), Madrid, pages 603-607, Spain, 2002.]] Google ScholarDigital Library
- Ray, T. and Liew, K. A swarm metaphor for multiobjective design optimization. Engineering Opt., vol. 34, no. 2, pp. 141--153, March 2002.]]Google ScholarCross Ref
- Schott, J. Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. Master's thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1995.]]Google Scholar
- Van Veldhuizen, D. and Lamont, G. Multiobjective evolutionary algorithm research: A history and analysis. Dept. Elec. Comput. Eng., Graduate School of Eng., Air Force Inst. Technol., Wright-Patterson AFB, OH, Tech. Rep. TR-98-03, 1998.]]Google Scholar
- Zitzler, E., Laumanns, M. and Thiele, L. SPEA2: Improving the strength Pareto Evolutionary algorithm. In Proc. EUROGEN 2001. Evolutionary Methods for Design, Optimization and Control With Applications to Industrial Problems,K. Giannakoglou, D. Tsahalis, J. Periaux, P. Papailou, and T. Fogarty, Eds., Athens, Greece, Sept. 2000.]]Google Scholar
Index Terms
- An effective use of crowding distance in multiobjective particle swarm optimization
Recommendations
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 ...
Multiobjective particle swarm optimization with nondominated local and global sets
In 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 ...
A Multiple Objective Particle Swarm Optimization Approach Using Crowding Distance and Roulette Wheel
ISDA '09: Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and ApplicationsThis paper presents a multiobjective optimization algorithm based on Particle Swarm Optimization (MOPSO-CDR) that uses a diversity mechanism called crowding distance to select the social leaders and the cognitive leader. We also use the same mechanism ...
Comments