Abstract
Grid-based measure is an often-used strategy by some MOEAs to maintain the diversity of the solution sets. The well known ε-MOEA, based on the ε-dominance concept, is essentially based on grid-strategy too. Though often gaining an appropriate tradeoff between the aspects of the performance, the ε-MOEA has its inherent vice and behaves unacceptably sometimes. That is, when the PFtrue’s slope to one dimension changes a lot along the coordinate, the algorithm loses many extreme or representative individuals, that has obvious influence on the diversity of the solution sets. In order to solve this problem, a new δ-dominance concept and the suppositional optimum point concept are defined. Then we proposed a new grid-based elitist-reserving strategy and applied it in an EMO archive algorithm (δ-MOEA). The experimental results illustrated δ-MOEA’s good performance, which is much better especially for the diversity than NSGA-II and ε-MOEA.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)
Xie, T., Chen, H.W., Kang, L.S.: Multi-objective Optimal Evolutionary Algorithms. Journal of Computer 26(8), 997–1003 (2003)
Zheng, J.H.: Multiobjective Evolutionary Algorithms and Applications. Science Press, Beijing (2007)
Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining convergence and diversity in evolutionary multi-objective optimization. Evolutionary Computation 10(3), 263–282 (2002)
Deb, K., Mohan, M., Mishra, S.: A Fast Multi-objective Evolutionary Algorithm for Finding Well-Spread Pareto-Optimal Solutions. KanGAL Report. No 2003002
Coello Coello, C.A.: Guest Editorial: Special issue on evolutionary multi-objective optimization. IEEE Transactions on Evolutionary Computation 7(2), 97–99 (2003)
Kalyanmoy, D., Pratap, A., Agrawal, S., Meyrivan, T.: A Fast and Elitist Multi-objective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Schott, J.R.: Fault tolerant design using single and multicriteria genetic algorithm optimization. Master’s theis of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge (1995-05)
Van Veldhuizen, D.A., Lamont, G.B.: On measuring multiobjective evolutionary algorithm performance. In: 2000 Congress on Evolutionary Computation, vol. 1, pp. 204–211 (2000)
David, S.J.: Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. In: Grefenstette: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 93–100 (1985)
Carlo, P.: Multi-objective Optimization by GAs: Application to System and Component Design. Methods in Applied Sciences 1996: Invited Lectures and Special Technological Sessions of the Third ECCOMAS Computational Fluid Dynamics Conference and the Second ECCOMAS Conference on Numerical Methods in Engineering, pp. 258–264. Wiley, Chichester (1996)
Fonseca, C.M., Fleming, P.J.: An Overview of Evolutionary Algorithms in Multi-objective Optimization. Evolutionary Computation 3(1), 1–16 (1995)
Kalyanmoy, D.: Multi-Objective Genetic Algorithms: Problem difficulties and Construction of Test Problems. Technical Report CI-49/98. Department of Computer Science/LS11,University of Dortmund
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceeding of the Congress on Evolutionary Computation (CEC 2002), pp. 825–830 (2002)
Kalyanmoy, D.: Multi-Objective Genetic Algorithms: Problem difficulties and Construc-tion of Test Problems. Evolutionary Computation 7(3), 205–230 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, J., Zheng, J., Luo, B., Li, M. (2008). Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-69311-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69310-9
Online ISBN: 978-3-540-69311-6
eBook Packages: Computer ScienceComputer Science (R0)