Abstract
Many real-world dynamic problems have constraints, and in certain cases not only the objective function changes over time, but also the constraints. However, there is little research on whether current algorithms work well on continuous dynamic constrained optimization problems (DCOPs). This chapter investigates this issue. The chapter will present some studies on the characteristics that can make DCOPs difficult to solve by some existing dynamic optimization (DO) algorithms. We will then introduce a set of benchmark problems with these characteristics and test several representative DO strategies on these problems. The results confirm that DCOPs do have special characteristics that can significantly affect algorithm performance. Based on the analyses of the results, a list of potential requirements that an algorithm should meet to solve DCOPs effectively will be proposed.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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
Aickelin, U., Dowsland, K.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J. of Sched. 3, 139–153 (2000)
Andrews, M., Tuson, A.L.: Dynamic optimisation: A practitioner requirements study. In: Proc. 24th Annual Workshop of the UK Planning and Scheduling Special Interest Group (2005)
Araujo, L., Merelo, J.J.: A genetic algorithm for dynamic modelling and prediction of activity in document streams. In: Proc. 9th Annual Conf. Genetic and Evol. Comput., pp. 1896–1903 (2007)
Ayvaz, D., Topcuoglu, H., Gurgen, F.: A comparative study of evolutionary optimization techniques in dynamic environments. In: Proc. 8th Annual Conf. Genetic and Evol. Comput., pp. 1397–1398 (2006)
Blackwell, T., Branke, J.: Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Trans. Evol. Comput. 10(4), 459–472 (2006)
Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer (2001)
Cobb, H.G.: An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuouis, time-dependent nonstationary environments. Tech. Rep. AIC-90-001, Naval Research Laboratory, Washington, USA (1990)
Deb, K., Rao N., U.B., Karthik, S.: Dynamic multi-objective optimization and decision-making using modified NSGA-II: A case study on hydro-thermal power scheduling. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 803–817. Springer, Heidelberg (2007)
Deb, K., Saha, A.: Finding multiple solutions for multimodal optimization problems using a multi-objective evolutionary approach. In: Proc. 12th Annual Conf. Genetic and Evol. Comput., pp. 447–454 (2010)
Floudas, C., Pardalos, P., Adjiman, C., Esposito, W., Gumus, Z., Harding, S., Klepeis, J., Meyer, C., Schweiger, C.: Handbook of Test Problems in Local and Global Optimization. In: Noncovex Optimization and Its Applications, vol. 33. Kluwer Academic Publishers (1999)
Grefenstette, J.J.: Genetic algorithms for changing environments. In: Proc. 2nd Int. Conf. Parallel Problem Solving from Nature, pp. 137–144 (1992)
Ioannou, P., Chassiakos, A., Jula, H., Unglaub, R.: Dynamic optimization of cargo movement by trucks in metropolitan areas with adjacent ports. Tech. Rep., METRANS Transportation Center, University of Southern California, Los Angeles, CA 90089, USA (2002), http://www.metrans.org/research/final/00-15_Final.htm
Kim, H.: Target exploration for disconnected feasible regions in enterprise-driven multilevel product design. American Institute of Aeronautics and Astronautics Journal 44(1), 67–77 (2006)
Liu, C.A.: New dynamic constrained optimization pso algorithm. In: Proc. 4th Int. Conf. Natural Comput., pp. 650–653 (2008)
Mertens, K., Holvoet, T., Berbers, Y.: The DynCOAA algorithm for dynamic constraint optimization problems. In: Proc. 5th Int. Joint Conf. Autonomous Agents and Multiagent Syst., pp. 1421–1423 (2006)
Michalewicz, Z.: The second version of Genocop III: a system which handles also nonlinear constraints, http://www.cs.adelaide.edu.au/zbyszek/EvolSyst/gcopIII10.tar.Z (accessed February 2009)
Morales, K.A., Quezada, C.: A universal eclectic genetic algorithm for constrained optimization. In: Proc. 6th Europ. Congr. Intell. & Soft Comput., pp. 518–522 (1998)
Moser, I., Hendtlass, T.: A simple and efficient multi-component algorithm for solving dynamic function optimisation problems. In: Proc. 2007 IEEE Congr. Evol. Comput., pp. 252–259 (2007)
Nguyen, T.T.: A proposed real-valued dynamic constrained benchmark set. Tech. Rep., School of Computer Science, Univesity of Birmingham (2008), http://www.staff.ljmu.ac.uk/enrtngu1/Papers/DCOPbenchmark.pdf
Nguyen, T.T.: Continuous Dynamic Optimisation Using Evolutionary Algorithms. Ph.D. thesis, School of Computer Science, University of Birmingham (2011), http://etheses.bham.ac.uk/1296 and http://www.staff.ljmu.ac.uk/enrtngu1/theses/phdthesisnguyen.pdf
Nguyen, T.T., Yao, X.: Benchmarking and solving dynamic constrained problems. In: Proc. 2009 IEEE Congr. Evol. Comput., pp. 690–697 (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)
Nguyen, T.T., Yao, X.: Continuous dynamic constrained optimisation - the challenges. IEEE Trans. Evol. Comput. 166, 769–786 (2012)
Nguyen, T.T., Yao, X.: Detailed experimental results of GA, RIGA, HyperM and GA+Repair on the G24 set of benchmark problems. Tech. Rep., School of Computer Science, University of Birmingham (2010), http://www.staff.ljmu.ac.uk/enrtngu1/Papers/DCOPfulldata.pdf
Nguyen, T.T., Yao, X.: Solving dynamic constrained optimisation problems using stochastic ranking and repair methods. IEEE Trans. Evol. Comput. (2010) (submitted), http://www.staff.ljmu.ac.uk/enrtngu1/Papers/NguyenYaodRepairGA.pdf
Parrott, D., Li, X.: Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans. Evol. Comput. 10(4), 440–458 (2006)
Prata, D.M., Lima, E.L., Pinto, J.C.: Simultaneous data reconciliation and parameter estimation in bulk polypropylene polymerizations in real time. Macromolecular Symposia 243(1), 91–103 (2006)
Richter, H.: Detecting change in dynamic fitness landscapes. In: Proc. 2009 IEEE Congr. Evol. Comput., pp. 1613–1620 (2009)
Richter, H.: Memory design for constrained dynamic optimization problems. In: Di Chio, C., et al. (eds.) EvoApplicatons 2010, Part I. LNCS, vol. 6024, pp. 552–561. Springer, Heidelberg (2010)
Richter, H., Yang, S.: Learning behavior in abstract memory schemes for dynamic optimization problems. Soft Comput. 13(12), 1163–1173 (2009)
Rocha, M., Neves, J., Veloso, A.: Evolutionary algorithms for static and dynamic optimization of fed-batch fermentation processes. In: Ribeiro, B., et al. (eds.) Adaptive and Natural Computing Algorithms, pp. 288–291. Springer (2005)
Singh, H.K., Isaacs, A., Nguyen, T.T., Ray, T., Yao, X.: Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems. In: Proc. 2009 IEEE Congr. Evol. Comput., pp. 3127–3134 (2009)
Tawdross, P., Lakshmanan, S.K., Konig, A.: Intrinsic evolution of predictable behavior evolvable hardware in dynamic environment. In: Proc. 6th Int. Conf. Hybrid Intell. Syst., p. 60 (2006)
Thompson, J.M., Dowsland, K.A.: A robust simulated annealing based examination timetabling system. Comput. Oper. Res. 25(7-8), 637–648 (1998)
Wang, Y., Wineberg, M.: Estimation of evolvability genetic algorithm and dynamic environments. Genetic Programming and Evolvable Machines 7(4), 355–382 (2006)
Williams, K.P.: Simple genetic algorithm (SGA) source code (in C), http://www.kenwilliams.org.uk/code/ga2.c (accessed December 2008)
Yang, S.: Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evol. Comput. 16(3), 385–416 (2008)
Yang, S., Yao, X.: Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput. 9(11), 815–834 (2005)
Zhang, Z., Liao, M., Wang, L.: Multi-objective immune genetic algorithm solving dynamic single-objective multimodal constrained optimization. In: Proc. 8th Int. Conf. Natural Comput., pp. 864–868 (2012)
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
Nguyen, T.T., Yao, X. (2013). Evolutionary Optimization on Continuous Dynamic Constrained Problems - An Analysis. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-38416-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38415-8
Online ISBN: 978-3-642-38416-5
eBook Packages: EngineeringEngineering (R0)