Saúl Zapotecas Martínez
ABSTRACT
Diversity plays an important role in evolutionary multi-objective optimization. Because of this, the development of mechanisms which provide and maintain diversity to multi-objective evolutionary algorithms (MOEAs) have been studied since their inception. Fitness sharing and niching are probably the most popular density estimator used with non-elitist MOEAs. However, the main downside of these techniques is the need to define the niche radius, which is a critical parameter that is not trivial to set. In recent years, the use of external archives to store the non-dominated solutions found by elitist MOEAs has become a popular choice. This has triggered more effective and simple diversity maintenance techniques for MOEAs. In this paper, we introduce a new archiving strategy based on the Convex Hull of Individual Minima (CHIM), which is intended to maintain a well-distributed set of non-dominated solutions. Our proposed approach is compared with NSGA-II using standard test problems and performance measures taken from the specialized literature.
- M. Cococcioni, P. Ducange, B. Lazzerini, and F. Marcelloni. A New Multi-Objective Evolutionary Algorithm Based on Convex Hull for Binary Classifier Optimization. In 2007 IEEE Congress on Evolutionary Computation (CEC'2007), pages 3150--3156, Singapore, September 2007. IEEE Press.Google Scholar
Cross Ref
- I. Das. Nonlinear Muicriteria Optimization and Robust Optimality. PhD thesis, Rice University, Houston, Texas, 1997.Google Scholar
- I. Das. On characterizing the knee of the pareto curve based on normal-boundary intersection. Structural Optimization, 18(2-3):107--115, October 1999.Google ScholarCross Ref
- I. Das and J. E. Dennis. Normal-boundary intersection: a new method for generating Pareto optimal points in multicriteria optimization problems. SIAM Journal on Optimization, 8(3):631--657, 1998. Google ScholarDigital Library
- K. Deb, S. Agrawal, A. Pratab, and T. Meyarivan. A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, editors, Proceedings of the Parallel Problem Solving from Nature VI Conference, pages 849--858, Paris, France, 2000. Springer. Lecture Notes in Computer Science No. 1917. Google ScholarDigital Library
- K. Deb and D. E. Goldberg. An Investigation of Niche and Species Formation in Genetic Function Optimization. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 42--50, San Mateo, California, June 1989. George Mason University, Morgan Kaufmann Publishers. Google ScholarDigital Library
- K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182--197, April 2002. Google ScholarDigital Library
- K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable Test Problems for Evolutionary Multiobjective Optimization. In A. Abraham, L. Jain, and R. Goldberg, editors, Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, pages 105--145. Springer, USA, 2005.Google ScholarCross Ref
- A. Farhang-Mehr and S. Azarm. Diversity Assessment of Pareto Optimal Solution Sets: An Entropy Approach. In Congress on Evolutionary Computation (CEC'2002), volume 1, pages 723--728, Piscataway, New Jersey, May 2002. IEEE Service Center.Google Scholar
- J. Knowles and D. Corne. Properties of an Adaptive Archiving Algorithm for Storing Nondominated Vectors. IEEE Transactions on Evolutionary Computation, 7(2):100--116, April 2003. Google ScholarDigital Library
- M. Laumanns, L. Thiele, E. Zitzler, and K. Deb. Archiving with Guaranteed Convergence and Diversity in Multi-Objective Optimization. In W. Langdon, E. Cantú -Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. Potter, A. Schultz, J. Miller, E. Burke, and N. Jonoska, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'2002), pages 439--447, San Francisco, California, July 2002. Morgan Kaufmann Publishers. Google ScholarDigital Library
- J. R. Schott. 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
- Q. Zhang and H. Li. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Transactions on Evolutionary Computation, 11(6):712--731, December 2007. Google ScholarDigital Library
- E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2):173--195, Summer 2000. Google ScholarDigital Library
- E. Zitzler and L. Thiele. Multiobjective Optimization Using Evolutionary Algorithms -- A Comparative Study. In A. E. Eiben, editor, Parallel Problem Solving from Nature V, pages 292--301, Amsterdam, September 1998. Springer-Verlag. Google ScholarDigital Library
Index Terms
- A novel diversification strategy for multi-objective evolutionary algorithms
Recommendations
Genetic diversity as an objective in multi-objective evolutionary algorithms
A key feature of an efficient and reliable multi-objective evolutionary algorithm is the ability to maintain genetic diversity within a population of solutions. In this paper, we present a new diversity-preserving mechanism, the Genetic Diversity ...
Evolutionary Algorithms for Multi-Objective Optimization: Performance Assessments and Comparisons
Evolutionary techniques for multi-objective (MO) optimization are currently gaining significant attention from researchers in various fields due to their effectiveness and robustness in searching for a set of trade-off solutions. Unlike conventional methods ...
An analysis on recombination in multi-objective evolutionary optimization
Evolutionary algorithms (EAs) are increasingly popular approaches to multi-objective optimization. One of their significant advantages is that they can directly optimize the Pareto front by evolving a population of solutions, where the recombination (...
Comments