Multi-Pareto-Ranking Evolutionary Algorithm
This paper proposes a new multi-objective genetic algorithm, called GAME, to solve constrained optimization problems. GAME uses an elitist archive, but it ranks the population in several Pareto fronts. Then, three types of fitness assignment methods are defined: the fitness of individuals depends on the front they belong to. The crowding distance is also used to preserve diversity. Selection is based on two steps: a Pareto front is first selected, before choosing an individual among the solutions it contains. The probability to choose a given front is computed using three parameters which are tuned using the design of experiments. The influence of the number of Pareto fronts is studied experimentally. Finally GAME’s performance is assessed and compared with three other algorithms according to the conditions of the CEC 2009 competition.
KeywordsMultiobjective optimization genetic algorithm Pareto ranking multiple fronts
Unable to display preview. Download preview PDF.
- 4.Cantú-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers (2000)Google Scholar
- 5.Deb, K.: Multi-objective Optimization Using Evolutionary Computation. John Wiley & Sons (2003)Google Scholar
- 8.Eskandari, H., Geiger, C.D., Lamont, G.B.: FastPGA: A Dynamic Population Sizing Approach for Solving Expensive Multiobjective Optimization Problems. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 141–155. Springer, Heidelberg (2007)CrossRefGoogle Scholar
- 9.Hippolyte, J.L., Bloch, C., Chatonnay, P., Espanet, C., Chamagne, D., Wimmer, G.: Tuning an evolutionary algorithm with taguchi methods. In: 5th Int. Conf. on Soft Computing as Transdisciplinary Science and Technology, CSTST 2008, pp. 265–272. ACM Press (2008)Google Scholar
- 10.Liu, H.L., Li, X.: The multiobjective evolutionary algorithm based on determined weight and sub-regional search. In: Proc. of 11th Conf. on Congress on Evolutionary Computation, CEC 2009, Trondheim, Norway, pp. 1928–1934 (2009)Google Scholar
- 11.Liu, M., Zou, X., Chen, Y., Wu, Z.: Performance assessment of dmoea-dd with cec 2009 moea competition test instances. In: IEEE Congress on Evolutionary Computation, pp. 2913–2918 (2009)Google Scholar
- 16.Tseng, L.Y., Chen, C.: Multiple trajectory search for unconstrained/constrained multi-objective optimization. In: Proc. of 11th Conf. on Congress on Evolutionary Computation, CEC 2009, pp. 1951–1958. IEEE Press, Trondheim (2009)Google Scholar
- 17.Zhang, Q., Zhou, A., Zhao, S., Suganthan, P.N., Liu, W., Tiwari, S.: Multiobjective optimization test instances for the cec 2009 special session and competition. Tech. rep., School of Computer Science and Electronic Engineering (2009)Google Scholar
- 18.Zitzler, E., Laumanns, M., Thiele, L.: Spea2: Improving the strength pareto evolutionary algorithm. Tech. rep., Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich (2001)Google Scholar
- 19.Zou, X., Chen, Y., Liu, M., Kang, L.: A new evolutionary algorithm for solving many-objective optimization problems. IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics: a Publication of the IEEE Systems, Man, and Cybernetics Society 38(5), 1402–1412 (2008)Google Scholar