Abstract
The field of evolutionary dynamic optimization is concerned with the study and application of evolutionary algorithms to dynamic optimization problems. In this chapter we highlight some of the challenges associated with the time-variant nature of these problems.We focus particularly on the different problem definitions that have been proposed, the modelling of dynamic optimization problems in terms of benchmark suites and the way the performance of an algorithm is assessed. Amid significant developments in the last decade, several practitioners have highlighted shortcomings with all of these fundamental issues. In this chapter we review the work done in each of these areas, evaluate the criticism and subsequently identify some perspectives for the future of the field.
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., Sarasola, B.: Abc, a new performance tool for algorithms solving dynamic optimisation problems. In: Proc. IEEE World Congr. Comput. Intell., pp. 734–740 (2010)
Andrews, M., Tuson, A.: Dynamic optimisation: A practitioner requirements study. In: Proc. 24th Annual Workshop of the UK Planning and Scheduling Special Interest Group (2005)
Beasley, J.E.: Or-library: Distributing test problems by electronic mail. J. of Oper. Res. Society 41(11), 1069–1072 (1990)
Bosman, P.A.N.: Learning, anticipation and time-deception in evolutionary online dynamic optimization. In: Yang, S., Branke, J. (eds.) GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization (2005)
Branke, J.: Evolutionary algorithms for dynamic optimization problems - a survey. Tech. Rep. 387, Insitute AIFB, University of Karlsruhe (1999)
Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proc. 1999 IEEE Congr. Evol. Comput., vol. 3, pp. 1875–1882 (1999)
Branke, J.: Evolutionary approaches to dynamic environments - updated survey. In: GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, pp. 27–30 (2001)
Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer (2002)
Branke, J., Kulzhabayeva, G., Uyar, S.: Addressing change within a generation. Tech. Rep., University of Karlsruhe (2008)
Branke, J., Orbayı, M., Uyar, Ş.: The role of representations in dynamic knapsack problems. In: Rothlauf, F., et al. (eds.) EvoWorkshops 2006. LNCS, vol. 3907, pp. 764–775. Springer, Heidelberg (2006)
Branke, J., Salihoglu, E., Uyar, Ş.: Towards an analysis of dynamic environments. In: Beyer, H.G.G. (ed.) Genetic and Evolutionary Computation Conference, pp. 1433–1439. ACM (2005)
Branke, J., Wang, W.: Theoretical analysis of simple evolution strategies in quickly changing environments. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 537–548. Springer, Heidelberg (2003)
Corne, D.W., Reynolds, A.P.: Optimisation and generalisation: Footprints in instance space. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI, Part I. LNCS, vol. 6238, pp. 22–31. Springer, Heidelberg (2010)
Cruz, C., González, J.R., Pelta, D.A.: Optimization in dynamic environments: a survey on problems, methods and measures. Soft Comput. 15(7), 1427–1448 (2011)
Droste, S., Jansen, T., Tinnefeld, K., Wegener, I.: A new framework for the valuation of algorithms for black-box optimization. In: Proc. 7th Int. Workshop Foundations of Genetic Algorithms, pp. 197–214 (2002)
Droste, S., Jansen, T., Wegener, I.: Optimization with randomized search heuristics the (a)nfl theorem, realistic scenarios, and difficult functions. Theoretical Computer Sci. 287 (2002)
Ficici, S.G.: Solution concepts in coevolutionary algorithms. Ph.D. thesis, Brandeis University (2004)
Fu, H., Sendhoff, B., Tang, K., Yao, X.: Characterizing environmental changes in robust optimization over time. In: Proc. 2012 IEEE Congr. Evol. Comput., pp. 551–558 (2012)
Goldberg, D.E., Smith, R.E.: Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: Grefenstette, J.J. (ed.) Proc. Int. Conf. Genetic Algorithms, pp. 59–68. Lawrence Erlbaum Associates (1987)
Grefenstette, J.J.: Evolvability in dynamic fitness landscapes: A genetic algorithm approach. In: Proc. 1999 IEEE Congr. Evol. Comput., vol. 3, pp. 2031–2038 (1999)
Jin, Y., Branke, J.: Evolutionary optimization in uncertain environment - a survey. IEEE Trans. Evol. Comput. 9(3), 303–317 (2005)
Jin, Y., Sendhoff, B.: Constructing dynamic optimization test problems using the multi-objective optimization concept. In: Raidl, G.R., et al. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 525–536. Springer, Heidelberg (2004)
Jin, Y., Tang, K., Yu, X., Sendhoff, B., Yao, X.: A framework for finding robust optimal solutions over time. Memetic Comput. 5(1), 3–18 (2012)
Jong, K.D.: Analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, Department of Computer and Communication Science, University of Michigan (1975)
Jong, K.D.: Evolving in a changing world. In: Raś, Z.W., Skowron, A. (eds.) ISMIS 1999. LNCS, vol. 1609, pp. 512–519. Springer, Heidelberg (1999)
Karaman, A., Uyar, A.S.: A novel change severity detection mechanism for the dynamic 0/1 knapsack problem. In: Proc. 10th Int. Conf. Soft Computing (2004)
Kauffman, S.A.: The Origins of Order. Oxford University Press (1993)
Leguizamon, G., Blum, C., Alba, E.: Handbook of approximation algorithms and metaheuristics, pp. 24.1–24.X. CRC Press (2007)
Li, C., Yang, S.: A generalized approach to construct benchmark problems for dynamic optimization. In: Li, X., et al. (eds.) SEAL 2008. LNCS, vol. 5361, pp. 391–400. Springer, Heidelberg (2008)
Mori, N., Kita, H.: Genetic algorithms for adaptation to dynamic environments - a survey. In: Proc. 26th Annual Conf. IEEE Industrial Electronics Society, vol. 4, pp. 2947–2952 (2000)
Morrison, R.W.: 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.: Designing Evolutionary Algorithms for Dynamic Environments, pp. 3–540. Springer, Berlin (2004) ISBN 3-540-21231-0
Morrison, R.W., DeJong, K.A.: A test problem generator for non-stationary environments. In: Proc. 1999 IEEE Congr. Evol. Comput., vol. 3, pp. 2047–2053 (1999)
Nguyen, T.T., Yao, X.: Benchmarking and solving dynamic constrained problems. In: Proc. 2009 IEEE Congr. Evol. Comput., pp. 690–697. IEEE Press (2009)
Nguyen, T.T., Yao, X.: Dynamic time-linkage problems revisited. In: Giacobini, M., et al. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 735–744. Springer, Heidelberg (2009)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover (1998)
Rand, W., Riolo, R.: Measurements for understanding the behavior of the genetic algorithm in dynamic environments: A case study using the shaky ladder hyperplane-defined functions. In: Yang, S., Branke, J. (eds.) GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization (2005)
Richter, H.: Detecting change in dynamic fitness landscapes. In: Proc. 11th IEEE Congr. Evol. Comput., pp. 1613–1620 (2009)
Rohlfshagen, P., Lehre, P.K., Yao, X.: Dynamic evolutionary optimisation: An analysis of frequency and magnitude of change. In: Proc. 2009 Genetic and Evol. Comput. Conf., pp. 1713–1720 (2009)
Rohlfshagen, P., Yao, X.: Attributes of dynamic combinatorial optimisation. In: Li, X., et al. (eds.) SEAL 2008. LNCS, vol. 5361, pp. 442–451. Springer, Heidelberg (2008)
Rohlfshagen, P., Yao, X.: Dynamic combinatorial optimisation problems: An analysis of the subset sum problems. Soft Comput. 15(9), 1723–1734 (2011)
Rossi, C., Barrientos, A., del Cerro, J.: Two adaptive mutation operators for optima tracking in dynamic optimization problems with evolution strategies. In: Proc. 9th Annual Conf. Genetic and Evol. Comput., pp. 697–704 (2007)
Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms, 2nd edn. Springer (2006)
Simon, H.: Models of Man. Wiley, New York (1957)
Thompson, R.K., Wright, A.H.: Additively decomposable fitness functions. Tech. Rep., University of Montana, Computer Science Department (1996)
Tinos, R., Yang, S.: Continuous dynamic problem generators for evolutionary algorithms. In: Proc. 2007 IEEE Congr. Evol. Comput., pp. 236–243 (2007)
Tinós, R., Yang, S.: An analysis of the XOR dynamic problem generator based on the dynamical system. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 274–283. Springer, Heidelberg (2010)
Trojanowski, K., Michalewicz, Z.: Evolutionary algorithms for non-stationary environments. In: Proc. 8th Workshop on Intell. Inform. Syst., pp. 229–240 (1999)
Trojanowski, K., Michalewicz, Z.: Searching for optima in non-stationary environments. In: Proc. 1999 IEEE Congr. Evol. Comput., vol. 3, pp. 1843–1850. IEEE (1999)
Ursem, R.K., Krink, T., Jensen, M.T., Michalewicz, Z.: Analysis and modeling of control tasks in dynamic systems. IEEE Trans. Evol. Comput. 6(4), 378–389 (2002)
Weicker, K.: An analysis od dynamic severity and population size. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 159–168. Springer, Heidelberg (2000)
Weicker, K.: Evolutionary algorithms and dynamic optimization problems. Der Andere Verlag (2003)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997)
Yang, S.: Non-stationary problem optimization using the primal-dual genetic algorithms. In: Sarker, R., Reynolds, R., Abbass, H., Tan, K.C., McKay, R., Essam, D., Gedeon, T. (eds.) Proc. 2003 IEEE Congr. Evol. Comput., vol. 3, pp. 2246–2253 (2003)
Yang, S.: Constructing dynamic test environments for genetic algorithms based on problem difficulty. In: Proc. 2004 IEEE Congr. Evol. Comput., vol. 2, pp. 1262–1269 (2004)
Yang, S.: Memory-enhanced univariate marginal distribution algorithms for dynamic optimization problems. In: Proc. 2005 IEEE Congr. Evol. Comput., vol. 3, pp. 2560–2567 (2005)
Yang, S., Yao, X.: Population-based incremental learning with associative memory for dynamic environments. IEEE Trans. Evol. Comput. 12(5), 542–561 (2008)
Younes, A., Calamai, P., Basir, O.: Generalized benchmark generation for dynamic combinatorial problems. In: Yang, S., Branke, J. (eds.) GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization (2005)
Yu, X., Jin, Y., Tang, K., Yao, X.: Robust optimization over time – a new perspective on dynamic optimization problems. In: Proc. 2010 IEEE Congr. Evol. Comput., pp. 3998–4003 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rohlfshagen, P., Yao, X. (2013). Evolutionary Dynamic Optimization: Challenges and Perspectives. In: Yang, S., Yao, X. (eds) Evolutionary Computation for Dynamic Optimization Problems. Studies in Computational Intelligence, vol 490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38416-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-38416-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38415-8
Online ISBN: 978-3-642-38416-5
eBook Packages: EngineeringEngineering (R0)