Abstract
The performance of the Dynamic Weight Aggregation system as applied to a Genetic Algorithm (DWAGA) and NSGA-II are evaluated and compared against each other. The algorithms are run on 11 two-objective test functions, and 2 three-objective test functions to observe the scalability of the two systems. It is discovered that, while the NSGA-II performs better on most of the two-objective test functions, the DWAGA can outperform the NSGA-II on the three-objective problems. We hypothesize that the DWAGA’s archive helps keep the searching population size down since it does not have to both search and store the Pareto front simultaneously, thus improving both the computation time and the quality of the front.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Pareto Front
- Multiobjective Optimization
- Objective Problem
- Evolutionary Multiobjective Optimization
- Pareto Archive Evolution Strategy
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Coello Coello, C.A.: A Short Tutorial on Evolutionary Multiobjective Optimization. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 21–40. Springer, Heidelberg (2001)
Jin, Y., Okabe, T., Sendhoff, B.: Adapting Weighted Aggregation for Multiobjective Evolution Strategies. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 96–110. Springer, Heidelberg (2001)
Jin, Y., Okabe, T., Sendhoff, B.: Dynamic Weighted Aggregation for Evolutionary Multi-Ojbective Optimization: Why Does It Work and How. In: Spector, L., et al. (eds.) GECCO 2001 - Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1042–1049. Morgan Kaufmann, San Francisco (2001)
Srinivas, N., Deb, K.: Multi-Objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation 2(3), 221–248 (1995)
Deb, K., Goel, T.: Controlled Elitist Non-dominated Sorting Genetic Algorithms. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 67–81. Springer, Heidelberg (2001)
Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolution algorithms: empirical results. Evolutionary Computation 8(2), 173–195 (2000)
Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the Pareto archived evolution strategies. Evolutionary Computation 8(2), 149–172 (2000)
Ang, K.H., Chong, G., Li, Y.: Preliminary Statement on the Current Progress of Multi-Objective Evolutionary Algorithm Performance Measurement. In: Eberhart, R., Fogel, D.B. (eds.) Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), pp. 1139–1144. IEEE Press, Los Alamitos (2002)
Jin, Y., Okabe, T., Sendhoff, B.: Solving Three-objective Optimization Problems Using Evolutionary Dynamic Weighted Aggregation: Results and Analysis. In: Proceedings of Genetic and Evolutionary Computation Conference, Chicago, p. 636 (2003)
Czyzak, P., Jaszkiewicz, A.: Pareto simulated annealing - a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis 7, 34–47 (1998)
Hansen, P.H.: Tabu Search for Multiobjective Optimization: MOTS. In: Proceedings of the 13th International Conference on Multiple Criteria Decision Making (1997)
Serafini, P.: Simulated annealing for multi objective optimization problems. In: Tzeng, G.H. (ed.) Multiple Criteria Decision Making: Expand and Enrich the Domains of Thinking and Application, Springer, Heidelberg (1993)
Ulungu, E., Teghem, J., Fortemps, P., Tuyytens, D.: MOSA Method: A Tool for Solving Multiobjective Combinatorial Optimization Problems. Journal of Multi-Criteria Decision Analysis 8/4, 221–236 (1999)
Knowles, J., Corne, D.: Memetic Algorithms for Multiobjective Optimization: Issues, Methods and Prospects (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drzadzewski, G., Wineberg, M. (2006). The Importance of Scalability When Comparing Dynamic Weighted Aggregation and Pareto Front Techniques. In: Talbi, EG., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2005. Lecture Notes in Computer Science, vol 3871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11740698_13
Download citation
DOI: https://doi.org/10.1007/11740698_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33589-4
Online ISBN: 978-3-540-33590-0
eBook Packages: Computer ScienceComputer Science (R0)