Dynamic time-linkage problems revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5484 LNCS, Issue , 2009, Pages 735-744

  Nguyen, Trung Thanh ^a   Yao, Xin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; DYNAMIC OPTIMIZATION PROBLEMS; DYNAMIC TIME; FUNCTION VALUES; MAXIMUM SCORE; NEW CLASS; OPTIMAL RESULTS; OPTIMALITY; PREDICTION METHODS;

COMPUTER SCIENCE;

EID: 67650677065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01129-0_83     Document Type: Conference Paper

References (13)

1. Bäck, T.: On the behavior of evolutionary algorithms in dynamic environments. In: Proc. of the IEEE Intl. Conf. on Evolutionary Computation, pp. 446-451 (1998)
2. Bäck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford Univ. Press, Oxford (1996)
3. Bosman, P.A.N.: Learning, anticipation and time-deception in evolutionary online dynamic optimization. In: Proc. of the GECCO 2005 Conf., pp. 39-47 (2005)
4. Bosman, P.A.N., Poutré, H.L.: Learning and anticipation in online dynamic optimization with evolutionary algorithms: the stochastic case. In: GECCO 2007: Proc. of the 9th Conf. on Genetic and Evoluntionary Computation, pp. 1165-1172. ACM, New York (2007) (Pubitemid 47291678)
5. Bosman, P.A.N.: Learning and Anticipation in Online Dynamic Optimization. In: Yang, S., Ong, Y.S., Jin, Y. (eds.) Evolutionary Computation in Dynamic and Uncertain Environments, pp. 129-152. Springer, Berlin (2007)
6. Branke, J., Mattfeld, D.: Anticipation in dynamic optimization: The scheduling case. In: Deb, K., et al. (eds.) PPSN 2000. LNCS, vol.1917, pp. 253-262. Springer, Heidelberg (2000)
7. Dorfman, R.: An Economic Interpretation of Optimal Control Theory. American Economic Review 59(5), 817-831 (1969)
8. Van Hemert, J.I., La Poutre, J.A.: Dynamic routing problems with fruitful regions: Models and evolutionary computation. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol.3242, pp. 692-701. Springer, Heidelberg (2004) (Pubitemid 39750270)
9. Li, C., Yang, S., Nguyen, T.T., Yu, E.L., Yao, X., Jin, Y., Beyer, H.-G., Suganthan, P.N.: Benchmark Generator for CEC 2009 Competition on Dynamic Optimization, Technical report, University of Leicester and University of Birmingham, UK (2008), http://www.cs.le.ac.uk/people/syang/ECiDUE/DBG.tar.gz
10. Morrison, R.W.: Designing Evolutionary Algorithms for Dynamic Environments. Springer, Berlin (2004)
11. Nguyen, T.T.: A benchmark for dynamic time-linkage problems, Technical Report, School of Computer Science, University of Birmingham (2009)
12. Rohlfshagen, P., Yao, X.: Attributes of combinatorial optimisation. In: Proc. of the 7th Int. Conf. on Simulated Evolutionand Learning, pp. 442-451. Springer, Heidelberg (2008)
13. Sistu, P.B., Gopinath, R.S., Bequette, B.W.: Computational issues in nonlinear predictive control. Comput. Chem. Eng. 17, 361-367 (1993) (Pubitemid 23658678)