Abstract
Measuring the performance of algorithms over dynamic optimization problems (DOPs) presents some important differences when compared to static ones. One of the main problems is the loss of solution quality as the optimization process advances in time. The objective in DOPs is in tracking the optima as the landscape changes; however, it is possible that the algorithm gets progressively further from the optimum after some changes happened. The main goal of this chapter is to present some difficulties that may appear while reporting the results on DOPs, and introduce two new performance tools to overcome these problems. We propose a measure based on linear regression to measure fitness performance degradation, and analyze our results on the moving peaks problem, using several measures existing in the literature as well as our performance performance degradation measure. We also propose a second measure based on the area below the curve defined by some population attribute at each generation (e.g., the best-of-generation fitness), which is analyzed in order to see how it can help in understanding the algorithmic search behavior.
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
Alba, E., Saucedo Badía, J.F., Luque, G.: A study of canonical GAs for NSOPs. In: Metaheuristics: Progress in Complex Systems Optimization, p. 245 (2007)
Alba, E., Sarasola, B.: ABC, a new performance tool for algorithms solving dynamic optimization problems. In: IEEE Congress on Evolutionary Computation, pp. 1–7 (2010)
Alba, E., Sarasola, B.: Measuring fitness degradation in dynamic optimization problems. In: Proceedings of the European Conference on the Applications of Evolutionary Computation (2010)
Bird, S., Li, X.: Informative performance metrics for dynamic optimisation problems. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 18–25 (2007)
Branke, J.: Evolutionary optimization in dynamic environments. Kluwer Academic Publishers (2002)
Cobb, H.G., Grefenstette, J.J.: Genetic algorithms for tracking changing environments. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 523–530. Morgan Kaufmann (1993)
Grefenstette, J.J.: Genetic algorithms for changing environments. In: Second International Conference on Parallel Problem Solving from Nature, pp. 137–144 (1992)
Mori, N., Imanishi, S., Kita, H., Nishikawa, Y.: Adaptation to changing environments by means of the memory based thermodynamical genetic algorithm. In: Proceedings of the 7th International Conference on Genetic Algorithms, pp. 299–306 (1997)
Morrison, R.: Performance measurement in dynamic environments. In: Branke, J. (ed.) GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, pp. 5–8 (2003)
Morrison, R.W., De Jong, K.A.: Measurement of Population Diversity. In: Collet, P., et al. (eds.) EA 2001. LNCS, vol. 2310, pp. 31–41. Springer, Heidelberg (2002)
Weicker, K.: Performance Measures for Dynamic Environments. In: Guervós, J.J.M., et al. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 64–73. Springer, Heidelberg (2002)
Yang, S.: Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evolutionary Computation 16(3), 385–416 (2008)
Yang, S., Tinós, R.: A hybrid immigrants scheme for genetic algorithms in dynamic environments. International Journal of Automation and Computing, 243–254 (2007)
Yang, S., Yao, X.: Population-based incremental learning with associative memory for dynamic environments. IEEE Trans. Evolutionary Computation 12(5), 542–561 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sarasola, B., Alba, E. (2013). Quantitative Performance Measures for Dynamic Optimization Problems. In: Alba, E., Nakib, A., Siarry, P. (eds) Metaheuristics for Dynamic Optimization. Studies in Computational Intelligence, vol 433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30665-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-30665-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30664-8
Online ISBN: 978-3-642-30665-5
eBook Packages: EngineeringEngineering (R0)