Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdou, W., Henriet, A., Bloch, C., Dhoutaut, D., Charlet, D., Spies, F.: Using an evolutionary algorithm to optimize the broadcasting methods in mobile ad hoc networks. Journal of Network and Computer Applications 34(6), 1794–1804 (2011)
Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M.: Experimental Methods for the Analysis of Optimization Algorithms. Springer, Germany (2010)
Box, G.E.P., Hunter, J.S., Hunter, W.G.: Statistics for experimenters. Design, innovation, and discovery, 2nd edn. Wiley Series in Probability and Statistics, xvii, p. 633. John Wiley & Sons, Hoboken (2005)
Cantú-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers (2000)
Deb, K.: Multi-objective Optimization Using Evolutionary Computation. John Wiley & Sons (2003)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evol. Computation 6(2), 182–197 (2002)
Durillo, J.J., Nebro, A.J.: jmetal: A java framework for multi-objective optimization. Advances in Engineering Software 42(10), 760–771 (2011)
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)
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)
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)
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)
Michalewicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evol. Comput. 4, 1–32 (1996)
Silverman, B.W.: Density estimation: for statistics and data analysis. Chapman and Hall, London (1986)
Srinivas, M., Patnaik, L.M.: Genetic algorithms: A survey. IEEE Computer 27(6), 17–26 (1994)
Surry, P., Radcliffe, N., Boyd, I.: A Multi-Objective Approach to Constrained Optimisation of Gas Supply Networks: The Comoga Method. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 166–180. Springer, Heidelberg (1995)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdou, W., Bloch, C., Charlet, D., Spies, F. (2012). Multi-Pareto-Ranking Evolutionary Algorithm. In: Hao, JK., Middendorf, M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2012. Lecture Notes in Computer Science, vol 7245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29124-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-29124-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29123-4
Online ISBN: 978-3-642-29124-1
eBook Packages: Computer ScienceComputer Science (R0)