| [1] |
M. Adrews and A. Tuson.
Diversity does not necessarily imply adaptability.
In J. Branke, editor, GECCO Workshop on Evolutionary Algorithms
for Dynamic Optimization Problems, pages 24-28, 2003. [ bib ] |
| [2] |
P. Amato and M. Farina.
An ALife-inspired evolutionary algorithm for dynamic multiobjective
optimization problems.
In World Conference on Soft Computing, 2003. [ bib ] |
| [3] |
P. Amato, M. Farina, G. Palma, and D. Porto.
An alife-inspired evolutionary algorithm for adaptive control of
time-varying systems.
In K. C. Giannakoglou, D. T. Tsahalis, J. Périaux, K. D.
Papailiou, and T. Fogarty, editors, Evolutionary methods for design
optimization and control with applications to industrial problems (EuroGen),
pages 222-227. International Center for Numerical Methods in Engineering
(CIMNE), 2001. [ bib ] |
| [4] |
H. C. Andersen.
An investigation into genetic algorithms, and the relationship
between speciation and the tracking of optima in dynamic functions.
Honours thesis, Queensland University of Technology, Brisbane,
Australia, November 1991. [ bib ] |
| [5] |
P. J. Angeline.
Tracking extrema in dynamic environments.
In P. J. Angeline, R. G. Reynolds, J. R. McDonnell, and R. Eberhart,
editors, Sixth International Conference on Evolutionary Programming,
volume 1213 of LNCS, pages 335-345. Springer, 1997. [ bib ] |
| [6] |
P. J. Angeline, D. B. Fogel, and L. J. Fogel.
A comparison of self-adaptation methods for finite state machines in
dynamic environments.
In L. J. Fogel et al., editor, Conference on Evolutionary
Programming, pages 441-449, 1996. [ bib ] |
| [7] |
V. S. Aragon and S. C. Esquivel.
An evolutionary algorithm to track changes of optimum value locations
in dynamic environments.
Journal of Computer Science and Technology, 4(3):127-134,
2004. [ bib | .pdf ] |
| [8] |
D. V. Arnold and H.-G. Beyer.
Random Dynamics Optimum Tracking with Evolution Strategies.
In J.J. Merelo, P. Adamidis, H.-G. Beyer, J.L.
Fernández-Villacañas, and H.-P. Schwefel, editors, Parallel
Problem Solving from Nature, pages 3-12, Heidelberg, 2002. Springer.
http://sfbci.cs.uni-dortmund.de/home/English/Publications/Reference/Downloads/AB02d.psENDE. [ bib ] |
| [9] |
G. P. Babu.
Clustering in non-stationary environments using a clan-based
evolutionary approach.
Biol. Cybern., 73:367-374, 1995. [ bib ] |
| [10] |
T. Bäck.
On the behavior of evolutionary algorithms in dynamic environments.
In IEEE International Conference on Evolutionary Computation,
pages 446-451. IEEE, 1998. [ bib ] |
| [11] |
T. Bäck.
Self-adaptive genetic algorithms for dynamic environments with slow
dynamics.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 142-145, 1999. [ bib ] |
| [12] |
C. N. Bendtsen and T. Krink.
Dynamic memory model for non-stationary optimization.
In Congress on Evolutionary Computation, pages 145-150. IEEE,
2002. [ bib | .pdf ] |
| [13] |
A. Berro and Y. Duthen.
Search for optimum in dynamic environment an efficient agent-based
method.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 51-54, 2001. [ bib ] |
| [14] |
C. Bierwirth and H. Kopfer.
Dynamic task scheduling with genetic algorithms in manufacturing
systems.
Technical report, Department of Economics, University of Bremen,
Germany, 1994. [ bib ] |
| [15] |
C. Bierwirth, H. Kopfer, D. C. Mattfeld, and I. Rixen.
Genetic algorithm based scheduling in a dynamic manufacturing
environment.
In Proc. of IEEE Conference on Evolutionary Computation. IEEE
Press, 1995. [ bib | .ps ] |
| [16] |
C. Bierwirth and D. C. Mattfeld.
Production scheduling and rescheduling with genetic algorithms.
Evolutionary Computation, 7(1):1-18, 1999. [ bib ] |
| [17] |
T. Blackwell.
Swarms in dynamic environments.
In E. Cantu-Paz, editor, Genetic and Evolutionary Computation
Conference, volume 2723 of LNCS, pages 1-12. Springer, 2003. [ bib ] |
| [18] |
T. Blackwell and J. Branke.
Multi-swarm optimization in dynamic environments.
In G. R. Raidl, editor, Applications of Evolutionary Computing,
volume 3005 of LNCS, pages 489-500. Springer, 2004. [ bib ] |
| [19] |
T. M. Blackwell.
Particle swarms and population diversity I: Analysis.
In J. Branke, editor, GECCO Workshop on Evolutionary Algorithms
for Dynamic Optimization Problems, pages 9-13, 2003. [ bib ] |
| [20] |
T. M. Blackwell.
Particle swarms and population diversity II: Experiments.
In J. Branke, editor, GECCO Workshop on Evolutionary Algorithms
for Dynamic Optimization Problems, pages 14-18, 2003. [ bib ] |
| [21] |
T. M. Blackwell.
Particle swarms and population diversity.
Soft Computing - A Fusion of Foundations, Methodologies and
Applications, 9(11):793-802, 2005. [ bib ] |
| [22] |
T. M. Blackwell and P. J. Bentley.
Dynamic search with charged swarms.
In W. B. Langdon et al., editor, Genetic and Evolutionary
Computation Conference, pages 19-26. Morgan Kaufmann, 2002. [ bib ] |
| [23] |
D. Bonino, F. Corno, and G. Squillero.
Dynamic optimization of semantic annotation relevance.
In Congress on Evolutionary Computation, volume 2, pages
1301-1308, 2004. [ bib ] |
| [24] |
Peter A. N. Bosman.
Learning, anticipation and time-deception in evolutionary online
dynamic optimization.
In S. Yang and J. Branke, editors, GECCO Workshop on
Evolutionary Algorithms for Dynamic Optimization, 2005. [ bib ] |
| [25] |
Amine Boumaza.
Learning environment dynamics from self-adaptation.
In S. Yang and J. Branke, editors, GECCO Workshop on
Evolutionary Algorithms for Dynamic Optimization, 2005. [ bib ] |
| [26] |
J. Branke.
Memory enhanced evolutionary algorithms for changing optimization
problems.
In Congress on Evolutionary Computation CEC99, volume 3, pages
1875-1882. IEEE, 199. [ bib | .ps.gz ] |
| [27] |
J. Branke.
Evolutionary algorithms for dynamic optimization problems - a survey.
Technical Report 387, Insitute AIFB, University of Karlsruhe,
February 1999. [ bib ] |
| [28] |
J. Branke.
Evolutionary approaches to dynamic environments - a survey.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 134-137, 1999. [ bib | .ps ] |
| [29] |
J. Branke.
Evolutionary approaches to dynamic environments - updated survey.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 27-30, 2001. [ bib | .pdf ] |
| [30] |
J. Branke.
Evolutionary Optimization in Dynamic Environments.
Kluwer, 2001. [ bib | .html ] |
| [31] |
J. Branke.
Evolutionary approaches to dynamic optimization problems -
introduction and recent trends.
In J. Branke, editor, GECCO Workshop on Evolutionary Algorithms
for Dynamic Optimization Problems, pages 2-4, 2003. [ bib | http ] |
| [32] |
J. Branke, T. Kauß ler, C. Schmidt, and H. Schmeck.
A multi-population approach to dynamic optimization problems.
In Adaptive Computing in Design and Manufacturing 2000.
Springer, 2000. [ bib | .ps.gz ] |
| [33] |
J. Branke and D. Mattfeld.
Anticipation in dynamic optimization: The scheduling case.
In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J.
Merelo, and H.-P. Schwefel, editors, Parallel Problem Solving from
Nature (PPSN VI), volume 1917 of LNCS, pages 253-262. Springer,
2000. [ bib ] |
| [34] |
J. Branke, M. Orbayi, and S. Uyar.
The role of representations in dynamic knapsack problems.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3907 of LNCS, pages 764-775. Springer, 2006. [ bib ] |
| [35] |
J. Branke, E. Salihoglu, and S. Uyar.
Towards an analysis of dynamic environments.
In Hans-Georg Beyer et al., editors, Genetic and Evolutionary
Computation Conference, pages 1433-1439. ACM, 2005. [ bib ] |
| [36] |
J. Branke and H. Schmeck.
Designing evolutionary algorithms for dynamic optimization problems.
In S. Tsutsui and A. Ghosh, editors, Theory and Application of
Evolutionary Computation: Recent Trend s, pages 239-262. Springer, 2002. [ bib ] |
| [37] |
L.T. Bui, H.A. Abbass, and J. Branke.
Multiobjective optimization for dynamic environments.
In Congress on Evolutionary Computation, volume 3, pages 2349
- 2356. IEEE press, September 2005. [ bib | http ] |
| [38] |
L.T. Bui, H.A. Abbass, and J. Branke.
Multiobjective optimization for dynamic environments.
In Congress on Evolutionary Computation, volume 3, pages
2349-2356. IEEE press, 2005. [ bib | http ] |
| [39] |
A. Carlisle and G. Dozier.
Adapting particle swarm optimisationto dynamic environments.
In Proc of int conference on artificial intelligence, pages
429-434, 2000. [ bib ] |
| [40] |
H. M. Cartwright and A. L. Tuson.
Genetic algorithms and flowshop scheduling: towards the development
of a real-time process control system.
In T. C. Fogarty, editor, AISB Workshop on Evolutionary
Computing, volume 865 of LNCS, pages 277-290. Springer Verlag, 1994. [ bib ] |
| [41] |
W. Cedeno and V. R. Vemuri.
On the use of niching for dynamic landscapes.
In International Conference on Evolutionary Computation. IEEE,
1997. [ bib ] |
| [42] |
H. G. Cobb.
An investigation into the use of hypermutation as an adaptive
operator in genetic algorithms having continuouis, time-dependent
nonstationary environments.
Technical Report AIC-90-001, Naval Research Laboratory, Washington,
USA, 1990. [ bib | .ps.Z ] |
| [43] |
H. G. Cobb and J. J. Grefenstette.
Genetic algorithms for tracking changing environments.
In International Conference on Genetic Algorithms, pages
523-530. Morgan Kaufmann, 1993. [ bib | .ps ] |
| [44] |
P. Collard, C. Escazut, and A. Gaspar.
An evolutionary approach for time dependent optimization.
International Journal on Artificial Intelligence Tools,
6(4):665-695, 1997. [ bib ] |
| [45] |
H. H. Dam, H.A. Abbass, and C. Lokan.
The performance of the dxcs system on continuous-valued inputs in
stationary and dynamic environments.
In Congress on Evolutionary Computation, volume 1, pages
618-625. IEEE press, 2005. [ bib | http ] |
| [46] |
D. Dasgupta and D. R. McGregor.
Nonstationary function optimization using the structured genetic
algorithm.
In R. Männer and B. Manderick, editors, Parallel Problem
Solving from Nature, pages 145-154. Elsevier Science Publisher, 1992. [ bib | .ps.Z ] |
| [47] |
F. O. de Franca, F. J. Von Zuben, and L. N. de Castro.
An artificial immune network for multimodal function optimization on
dynamic environments.
In Genetic and Evolutionary Computation Conference, pages
289-296. ACM Press, 2005. [ bib | http ] |
| [48] |
G. Dozier.
Distributed steady-state neuro-evolutionary path planning, in
non-stationary environments using adaptive replacement.
In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and
H.-G. Beyer, editors, Genetic and Evolutionary Computation Conference,
pages 58-65. Morgan Kaufmann, 2000. [ bib ] |
| [49] |
G. Dozier.
Steady-state evolutionary path planning, adaptive replacement, and
hyper-diversity.
In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J.
Merelo, and H.-P. Schwefel, editors, Parallel Problem Solving from
Nature (PPSN VI), volume 1917 of LNCS, pages 562-570. Springer,
2000. [ bib ] |
| [50] |
S. Droste.
Analysis of the (1+1) ea for a dynamically changing onemax-variant.
In Congress on Evolutionary Computation, pages 55-60. IEEE
Press, 2002. [ bib ] |
| [51] |
S. Droste.
Analysis of the (1+1) ea for a dynamically bitwise changing
OneMax.
In E. Cantu-Paz, editor, Genetic and Evolutionary Computation
Conference, volume 2723 of LNCS, pages 909-921. Springer, 2003. [ bib ] |
| [52] |
J. Eggermont, T. Lenaerts, S. Poyhonen, and A. Termier.
Raising the dead; extending evolutionary algorithms with a case-based
memory.
In J. F. Miller et al., editors, Genetic Programming,
Proceedings of EuroGP'2001, volume 2038, pages 280-290. Springer, 2001. [ bib | .html ] |
| [53] |
R. Eriksson and B. Olsson.
On the performance of evolutionary algorithms with life-time adaption
in dynamic fitness landscapes.
In Congress on Evolutionary Computation, volume 2, pages
1293-1300, 2004. [ bib ] |
| [54] |
S. C. Esquivel and C. A. Coello Coello.
Particle swarm optimization in non-stationary environments.
In Advances in Artificial Intelligence, volume 3315 of
LNCS, pages 757 - 766. Springer, 2004. [ bib ] |
| [55] |
A.S. Etaner-Uyar and H.T. Uyar.
An event-driven test framework for evolutionary algorithms in dynamic
environments.
In Congress on Evolutionary Computation, volume 2, pages
2265-2272, 2004. [ bib ] |
| [56] |
H.-L. Fang, Peter Ross, and Dave Corne.
A promising genetic algorithm approach to job-shop scheduling,
rescheduling, and open-shop scheduling problems.
In S. Forrest, editor, International Conference on Genetic
Algorithms, pages 375-382. Morgan Kaufmann, 1993. [ bib | .pdf ] |
| [57] |
M. Farina, K. Deb, and P. Amato.
Dynamic multiobjektive optimization problems: Test cases,
approximation, and applications.
In C.M. Fonseca et al., editor, Evolutionary multiobjektive
optimization, LNCS, pages 311-326. Springer, 2003. [ bib ] |
| [58] |
M. Farina, K. Deb, and P. Amato.
Dynamic multiobjective optimization problems: test cases,
approximations, and applications.
IEE Transactions on Evolutionary Computation, 8(5):425-442,
2004. [ bib ] |
| [59] |
C. Fernandes, V. Ramos, and A.C. Rosa.
Varying the population size of artificial foraging swarms on time
varying landscapes.
In International Conference on Artificial Neural Networks:
Biological Inspirations, volume 3696 of LNCS, pages 311-316.
Springer, 2005. [ bib ] |
| [60] |
S. M. Garrett and J. H. Walker.
Genetic algorithms: Combinging evolutionary and 'non'-evolutionary
methods in tracking dynamic global optima.
In W. B. Langdon et al., editor, Genetic and Evolutionary
Computation Conference, pages 359-374. Morgan Kaufmann, 2002. [ bib ] |
| [61] |
A. Gaspar and P. Collard.
Time dependent optimization with a folding genetic algorithm.
In International Conference on Tools for Artificial
Intelligence, pages 207-214. IEEE Computer Society Press, 1997. [ bib ] |
| [62] |
A. Gaspar and P. Collard.
From gas to artificial immune systems: Improving adaptation in time
dependent optimization.
In Congress on Evolutionary Computation, volume 3, pages 1859
- 1866. IEEE, 1999. [ bib ] |
| [63] |
A. Gaspar and P. Collard.
There is alife beyond convergence: Using a dual sharing to adapt in
time dependent optimization.
In Congress on Evolutionary Computation, volume 3, pages 1867
- 1874. IEEE, 1999. [ bib ] |
| [64] |
A. Ghosh, S. Tsutsui, and H. Tanaka.
Function optimization in nonstationary environment using steady state
genetic algorithms with aging of individuals.
In IEEE International Conference on Evolutionary Computation,
pages 666-671, 1998. [ bib | .pdf ] |
| [65] |
J. Gilbert and M. Eppstein.
A case for codons in evolutionary algorithms.
In E. Cantu-Paz, editor, Genetic and Evolutionary Computation
Conference, volume 2723 of LNCS, pages 967-978. Springer, 2003. [ bib ] |
| [66] |
D. E. Goldberg and R. E. Smith.
Nonstationary function optimization using genetic algorithms with
dominance and diploidy.
In J. J. Grefenstette, editor, International Conference on
Genetic Algorithms, pages 59-68. Lawrence Erlbaum Associates, 1987. [ bib ] |
| [67] |
J. J. Grefenstette.
Genetic algorithms for changing environments.
In R. Maenner and B. Manderick, editors, Parallel Problem
Solving from Nature 2, pages 137-144. North Holland, 1992. [ bib | .ps.Z ] |
| [68] |
J. J. Grefenstette.
Evolvability in dynamic fitness landscapes: A genetic algorithm
approach.
In Congress on Evolutionary Computation, volume 3, pages
2031-2038. IEEE, 1999. [ bib | .pdf ] |
| [69] |
J. J. Grefenstette and C. L. Ramsey.
An approach to anytime learning.
In D. Sleeman and P. Edwards, editors, International conference
on Machine Learning, pages 189-195. Morgan Kaufmann, 1992. [ bib | .ps.Z ] |
| [70] |
E. Hart and P. Ross.
The evolution and analysis of a potential antibody library for use in
job-shop scheduling.
In D. Corne et al., editor, New Ideas in Optimization,
chapter 12, pages 185-202. McGraw Hill, 1999. [ bib ] |
| [71] |
Emma Hart and Peter Ross.
An immune system approach to scheduling in changing environments.
In Genetic and Evolutionary Computation Conference, pages
1559-1566. Morgan Kaufmann, 1999. [ bib ] |
| [72] |
X. Hu and R.C. Eberhart.
Adaptive particle swarm optimisation: detection and response to
dynamic systems.
In Proc Congress on Evolutionarx Computation, pages 1666-1670,
2002. [ bib ] |
| [73] |
C. Huang and L. M. Rocha.
Tracking extrema in dynamic environments using a coevolutionary
agent-based model of genotype edition.
In Hans-Georg Beyer et al., editors, Genetic and Evolutionary
Computation Conference, pages 545-552. ACM, 2005. [ bib ] |
| [74] |
T. Hussain, D. Montana, and G. Vidaver.
Evolution-based deliberative planning for cooperating unmanned ground
vehicles in a dynamic environment.
In Genetic and Evolutionary Computation Conference, LNCS, pages
1017-1029. Springer, 2004. [ bib | .pdf ] |
| [75] |
T. Jansen and U. Schellbach.
Theoretical analysis of a mutation-based evolutionary algorithm for a
tracking problem in lattice.
In Hans-Georg Beyer et al., editors, Genetic and Evolutionary
Computation Conference, pages 841-848. ACM, 2005. [ bib ] |
| [76] |
S. Janson and M. Middendorf.
A hierachical particle swarm optimizer for dynamc optimization
problems.
In G. R. Raidl, editor, Applications of evolutionary computing,
volume 3005 of LNCS, pages 513-524. Springer, 2004. [ bib ] |
| [77] |
Y. Jin and J. Branke.
Evolutionary optimization in uncertain environments-a survey.
IEEE Transactions on Evolutionary Computation, 9(3):303-317,
2005. [ bib ] |
| [78] |
Y. Jin and B. Sendhoff.
Constructing dynamic optimization test problems using the
multi-objective optimization concept.
In G. R. Raidl, editor, Applications of evolutionary computing,
volume 3005 of LNCS, pages 525-536. Springer, 2004. [ bib ] |
| [79] |
K. De Jong.
Evolving in a changing world.
In Z.W. Ras and A. Skowron, editors, Foundations of Intelligent
Systems, volume 1609 of LNCS, pages 512-519. Springer, 1999. [ bib ] |
| [80] |
K. Kalmanje.
Micro-genetic algorithms for stationary an nonstationary function
optimization.
In Intelligent Control and Adaptive Systems, volume 1196, pages
289-296, 1989. [ bib ] |
| [81] |
L. Kang, A. Zhou, B. McKay, and Y. Li.
Benchmarking algorithms for dynamic travelling salesman problems.
In Congress on Evolutionary Computation, volume 2, pages
1286-1292, 2004. [ bib ] |
| [82] |
A. Karaman, S. Uyar, and G. Eryigit.
The memory indexing evolutionary algorithm for dynamic environments.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3449 of LNCS, pages 563-573. Springer, 2005. [ bib ] |
| [83] |
C. L. Karr.
An architecture for adaptive process control systems.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 146-148, 1999. [ bib ] |
| [84] |
M.D. Kidwell and D.J. Cook.
Genetic algorithm for dynamic task scheduling.
In Proc. of the IEEE 13th International Phoenix Conference on
Computers and Communications, pages 61-67, 1994. [ bib ] |
| [85] |
M. Kobliha, J. Schwarz, and J. Ocena.
Bayesian optimization algorithms for dynamic problems.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3907 of LNCS, pages 800-804. Springer, 2006. [ bib ] |
| [86] |
K. Krishnakumar.
Micro-genetic algorithms for stationary and non-stationary function
optimization.
In Intelligent Control and Adaptive Systems, Proc. of the SPIE,
volume 1196, pages 289-296, 1989. [ bib | .pdf ] |
| [87] |
J. Lewis, E. Hart, and G. Ritchie.
A comparison of dominance mechanisms and simple mutation on
non-stationary problems.
In A. E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel,
editors, Parallel Problem Solving from Nature, number 1498 in LNCS,
pages 139-148. Springer, 1998. [ bib ] |
| [88] |
Y. Li and C. O. Wilke.
Digital evolution in time-dependent fitness landscapes.
Artificial Live, 10:123-134, 2004. [ bib ] |
| [89] |
A. Liekens, H. Eikelder, and P. Hilbers.
Finite population models of dynamic optimization with alternating
fitness functions.
In J. Branke, editor, GECCO Workshop on Evolutionary Algorithms
for Dynamic Optimization Problems, pages 19-23, 2003. [ bib ] |
| [90] |
Anthony M. L. Liekens.
Evolution of Finite Populations in Dynamic Environments.
PhD thesis, Technische Universität Eindhoven, 2005. [ bib ] |
| [91] |
W. Liles and K. De Jong.
The usefulness of tag bits in changing environments.
In Congress on Evolutionary Computation, volume 3, pages
2054-2060. IEEE, 1999. [ bib ] |
| [92] |
D. Lim, Y. Ong, and B. Lee.
Inverse multi-objective robust evolutionary design optimization in
the presence of uncertainty.
In S. Yang and J. Branke, editors, GECCO Workshop on
Evolutionary Algorithms for Dynamic Optimization, 2005. [ bib ] |
| [93] |
S.-C. Lin.
A genetic algorithm-based scheduling system for dynamic job shop
scheduling problems.
PhD thesis, Michigan State University, May 1997. [ bib ] |
| [94] |
S.-C. Lin, E. D. Goodman, and W. F. Punch.
A genetic algorithm approach to dynamic job shop scheduling problems.
In T. Bäck, editor, Seventh International Conference on
Genetic Algorithms, pages 481-488. Morgan Kaufmann, 1997. [ bib ] |
| [95] |
S. J. Louis and Z. Xu.
Genetic algorithms for open shop scheduling and re-scheduling.
In M. E. Cohen and D. L. Hudson, editors, ISCA Eleventh
International Conference on Computers and their Applications, pages 99-102,
1996. [ bib ] |
| [96] |
D. Maravall, J. de Lope, and M. A. Patricio.
Competitive goal coordination in automatic parking.
In G. R. Raidl, editor, Applications of evolutionary computing,
volume 3005 of LNCS, pages 537-548. Springer, 2004. [ bib ] |
| [97] |
D. C. Mattfeld and C. Bierwirth.
Minimizing job tardiness: Priority rules vs. adaptive scheduling.
In I. C. Parmee, editor, Adaptive Computing in Design and
Manufacture, pages 59-67. Springer, 1998. [ bib | .pdf ] |
| [98] |
D. C. Mattfeld and C. Bierwirth.
Adaptation and dynamic optimization problems: a view from general
system theory.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 138-141, 1999. [ bib ] |
| [99] |
D. C. Mattfeld and C. Bierwirth.
An efficient genetic algorithm for job shop scheduling with tardiness
objectives.
European Journal of Operational Research, 155(3):616-630,
2004. [ bib ] |
| [100] |
F.L. Minku and T.B. Ludermir.
Evolutionary strategies and genetic algorithms for dynamic parameter
optimization of evolving fuzzy neural networks.
In Congress on Evolutionary Computation, volume 3, pages
1951-1958. IEEE Press, 2005. [ bib | http ] |
| [101] |
N. Mori, S. Imanishi, H. Kita, and Y. Nishikawa.
Adaptation to changing environments by means of the memory based
thermodynamical genetic algorithm.
In T. Bäck, editor, International Conference on Genetic
Algorithms, pages 299-306. Morgan Kaufmann, 1997. [ bib ] |
| [102] |
N. Mori, H. Kita, and Y. Nishikawa.
Adaptation to a changing environment by means of the thermodynamical
genetic algorithm.
In H.-M. Voigt, editor, Parallel Problem Solving from Nature,
number 1141 in LNCS, pages 513-522. Springer Verlag Berlin, 1996. [ bib ] |
| [103] |
N. Mori, H. Kita, and Y. Nishikawa.
Adaptation to a changing environment by means of the feedback
thermodynamical genetic algorithm.
In A. E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel,
editors, Parallel Problem Solving from Nature, number 1498 in LNCS,
pages 149-158. Springer, 1998. [ bib | .pdf ] |
| [104] |
N. Mori, T. Kuda, and K. Matsumoto.
On genetic and environment identifying approaches to adaptation to
changing environments.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 39-42, 2001. [ bib ] |
| [105] |
R. Morrison.
Performance measurement in dynamic environments.
In J. Branke, editor, GECCO Workshop on Evolutionary Algorithms
for Dynamic Optimization Problems, pages 5-8, 2003. [ bib ] |
| [106] |
R. W. Morrison and K. A. DeJong.
A test problem generator for non-stationary environments.
In Congress on Evolutionary Computation, volume 3, pages
2047-2053. IEEE, 1999. [ bib | http ] |
| [107] |
R. W. Morrison and K. A. De Jong.
Triggered hypermutation revisited.
In Congress on Evolutionary Computation, pages 1025-1032,
2000. [ bib | http ] |
| [108] |
M. Munetomo, Y. Takai, and Y. Sato.
Genetic-based dynamic load balancing: Implementation and evaluation.
In H.-M. Voigt, editor, Parallel Problem Solving from Nature,
number 1141 in LNCS, pages 920-929. Springer Verlag Berlin, 1996. [ bib ] |
| [109] |
M. Munetomo, Y. Takai, and Y. Sato.
On tracking-ability of a stochastic genetic algorithm to changing
environments.
IEEE Transactions on Systems, Man and Cybernetics, 1996. [ bib ] |
| [110] |
T. Nanayakkara, K. Watanabe, and K. Izumi.
Evolving in dynamic environments through adaptive chaotic mutation.
In Third International Symposium on Artificial Life and
Robotics, volume 2, pages 520-523, 1999. [ bib | .ps ] |
| [111] |
A. Neubauer.
A comparative study of evolutionary algorithms for on-line parameter
tracking.
In H.-M. Voigt, editor, Parallel Problem Solving from Nature,
number 1141 in LNCS, pages 624-633. Springer Verlag Berlin, 1996. [ bib ] |
| [112] |
K. P. Ng and K. C. Wong.
A new diploid scheme and dominance change mechanism for
non-stationary function optimization.
In Sixth International Conference on Genetic Algorithms, pages
159-166. Morgan Kaufmann, 1995. [ bib ] |
| [113] |
S. Nolfi and D. Parisi.
Learning to adapt to changing environments in evolving neural
networks.
Technical report, Institute of Psychology C.N.R. - Rome, 1995. [ bib | .pdf ] |
| [114] |
S. Nolfi and D. Parisi.
Learning to adapt to changing environments in evolving neural
networks.
Adaptive Behavior, 5(1):75-98, 1997. [ bib ] |
| [115] |
G. Ochoa, C. Mädler-Kron, R. Rodriguez, and K. Jaffe.
Assortative mating in genetic algorithms for dynamic problems.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3449 of LNCS, pages 617-622. Springer, 2005. [ bib ] |
| [116] |
A. Sim oes and E. Costa.
Using biological inspiration to deal with dynamic environments.
In Proceedings of the seventh international conference on soft
computiong (MENDEL01), Brno, Czech Republic, 2001. [ bib ] |
| [117] |
A. Sim oes and E. Costa.
Using GAs to deal with dynamic environments: a comarative study of
several approaches based on promoting diversity.
In W. B. Jangdon, editor, Proceedings of the Genetic and
Evolutionary Copmutation Conference, GECCO-2002, New York, USA, 2002. [ bib ] |
| [118] |
A. Sim oes and E. Costa.
A comarative study using genetic algorithms to deal with dynamic
environments.
In D. W. Pearson, N. C. Steele, and R. Albrecht, editors,
Proceedings of the sixth international conference on neural networks and
genetic algorithms (ICANNGA03), pages 203-209. Springer, 2003. [ bib ] |
| [119] |
A. Sim oes and E. Costa.
An immune system-based genetic algorithm to deal with dynamic
environments: Diversity and memory.
In D. W. Pearson, N. C. Steele, and R. Albrecht, editors,
Proceedings of the Sixth international conference on neural networks and
genetic algorithms (ICANNGA03), pages 168-174. Springer, 2003. [ bib ] |
| [120] |
K. Ohkura and K. Ueda.
Adaptation in dynamic environment using genetic algorithms with
redundant representation and additional genetic operators.
In Dagli and Cihan, editors, Proc. Intelligent engineering
systems through artificial neural networks, pages 291-296, 1994. [ bib ] |
| [121] |
F. Oppacher and M. Wineberg.
The shifting balance genetic algorithm: Improving the ga in a dynamic
environment.
In Wolfgang Banzhaf et al., editor, Genetic and Evolutionary
Computation Conference (GECCO), volume 1, pages 504 - 510. Morgan Kaufmann,
San Francisco, 1999. [ bib | .pdf ] |
| [122] |
F. Oppacher and M. Wineberg.
The shifting balance genetic algorithm: Improving the ga in a dynamic
environment.
In W. Banzhalf et al., editor, Genetic and Evolutionary
Computation Conference, volume 1, pages 504-510. Morgan Kaufmann, 1999. [ bib ] |
| [123] |
P. Osmera, V. Kvasnicka, and J. Pospichal.
Genetic algorithms with diploid chromosomes.
In Proceedings of Mendel'97, pages 111-116. PC-DIR Brno, 1997. [ bib ] |
| [124] |
G. Pankratz.
Speditionelle Transportdisposition - Modell- und
Verfahrensentwicklung unter Berücksichtigung von Dynamik und
Fremdvergabe.
Deutscher Universitäts-Verlag, Wiesbaden, 2002. [ bib ] |
| [125] |
G. Pankratz.
Dynamic vehicle routing by means of a genetic algorithm.
International Journal of Physical Distribution and Logistics
Management, 35(5):362-383, 2005. [ bib ] |
| [126] |
D. Parrott and X. Li.
A particle swarm model for tracking multiple peaks in a dynamic
environment using speciation.
In Congress on Evolutionary Computation, pages 98-103. IEEE,
2004. [ bib ] |
| [127] |
K. Parsopoulos and M. Vranhatis.
Unified particle swarm optimization in dynamic environments.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3449 of LNCS, pages 590-599. Springer, 2005. [ bib ] |
| [128] |
C. A. G. Pico and R. L. Wainwright.
Dymanic scheduling of computer tasks using genetic algorithms.
In IEEE Conference on Evolutionary Computation, volume 2, pages
829-833, 1994. [ bib ] |
| [129] |
V. Ramos, C. Fernandes, and A.C. Rosa.
On ants, bacteria and dynamic environments.
In Natural Computing and Application Workshop, 2005. [ bib ] |
| [130] |
C. L. Ramsey and J. J. Grefenstette.
Case-based initialization of genetic algorithms.
In S. Forrest, editor, International Conference on Genetic
Algorithms, pages 84-91. Morgan Kaufmann, 1993. [ bib | .ps.Z ] |
| [131] |
W. Rand and R. Riolo.
Measurements for understanding the behavior of the genetic algorithm
in dynamic environments: A case study using the shaky ladder
hyperplane-defined functions.
In S. Yang and J. Branke, editors, GECCO Workshop on
Evolutionary Algorithms for Dynamic Optimization, 2005. [ bib ] |
| [132] |
W. Rand and R. Riolo.
The problem with a self-adaptive mutation rate in some environments.
In Hans-Georg Beyer et al., editors, Genetic and Evolutionary
Computation Conference, pages 1493-1500. ACM, 2005. [ bib ] |
| [133] |
W. Rand and R. Riolo.
Shaky ladders, hyperplane-defined functions and genetic algorithms:
systematic controlled observation in dynamic environments.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3449 of LNCS, pages 600-609. Springer, 2005. [ bib ] |
| [134] |
W. Rand and Rick Riolo.
The effect of building block construction on the behavior of the ga
in dynamic environments: A case study using the shaky ladder
hyperplane-defined functions.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3907 of LNCS, pages 776-787. Springer, 2006. [ bib ] |
| [135] |
C. Reeves and H. Karatza.
Dynamic sequencing of a multi-processor system: a genetic algorithm
approach.
In R. F. Albrecht, C. R. Reeves, and N. C. Steele, editors,
Artificial Neural Nets and Genetic Algorithms, pages 491-495. Springer,
1993. [ bib ] |
| [136] |
H. Richter.
Behavior of evolutionary algorithms in chaotically changing fitness
landscapes.
In X. Yao et al., editors, Parallel Problem Solving from
Nature, volume 3242 of LNCS, pages 111-120. Springer, 2004. [ bib ] |
| [137] |
H. Richter.
A study of dynamic severity in chaotic fitness landscapes.
In Congress on Evolutionary Computation, volume 3, pages
2824-2831. IEEE press, 2005. [ bib | http ] |
| [138] |
M. Rocha, J. Neves, and A. Veloso.
Evolutionary algorithms for static and dynamic optimization of
fed-batch fermentation processes.
In B. Ribeiro et al., editors, Adaptive and Natural Computing
Algorithms, pages 288-291. Springer, 2005. [ bib ] |
| [139] |
C. Ronnewinkel and T. Martinez.
Explicit speciation with few a priori parameters for dynamic
optimization problems.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 31-34, 2001. [ bib ] |
| [140] |
C. Ronnewinkel, C.O. Wilke, and T. Martinetz.
Genetic algorithms in time-dependent environments.
In Theoretical Aspects of Evolutionary Computing. Springer,
2000. [ bib | http ] |
| [141] |
J. E. Rowe.
Finding attractors for periodic fitness functions.
In W. Banzhaf et al., editors, Genetic and Evolutionary
Computation Conference, pages 557-563. Morgan Kaufmann, 1999. [ bib ] |
| [142] |
J. E. Rowe.
Cyclic attractors and quasispecies adaptability.
In L. Kallel, B. Naudts, and A. Rogers, editors, Theoretical
Aspects of Evolutionary Computing, pages 251-259. Springer, 2001. [ bib ] |
| [143] |
C. Ryan.
The degree of oneness.
In First Online Workshop on Soft Computing, pages 43-49, 1996. [ bib | .html ] |
| [144] |
C. Ryan.
Diploidy without dominance.
In J. T. Alander, editor, Third Nordic Workshop on Genetic
Algorithms, pages 45-52, 1997. [ bib ] |
| [145] |
R. Salomon and P. Eggenberger.
Adaptation on the evolutionary time scale: A working hypothesis and
basic experiments.
In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers,
editors, 3rd European Conference on Artificial Evolution, number 1363
in LNCS, pages 251-262. Springer, 1997. [ bib | .pdf ] |
| [146] |
Y. Sano, H. Kita, I. Kamihira, and M. Yamaguchi.
Online optimization of an engine controller by means of a genetic
algorithm using history of search.
In Simulated Evolution and Learning, pages 2929-2934.
Springer, 2000. [ bib ] |
| [147] |
R. Santana, A. Ochoa, and M. R. Soto.
Evolutionary algorithms for dynamic optimization problems: An
approach using evolutionary theory and the incident edge model.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 149-152, 1999. [ bib ] |
| [148] |
J. Sarma and K. De Jong.
The behavior of spatially distributed evolutionary algorithms in
non-stationary environments.
In W. Banzhaf et al., editor, GECCO, volume 1, pages 572 -578.
Morgan Kaufmann, San Francisco, California, 1999. [ bib ] |
| [149] |
T. Sasaki and M. Tokoro.
Adaptation toward changing environments: Why darwinian in nature?
In P. Husbands and I. Harvey, editors, European Conference on
Artificial Life. MIT Press, 1997. [ bib | .ps.gz ] |
| [150] |
T. Sasaki and M. Tokoro.
Adaptation under changing environments with various rates of
inheritance of acquired characters.
In X. Yao et al., editor, Simulated Evolution and Learning,
number 1585 in LNCS, pages 34-41. Springer, 1998. [ bib | .ps.gz ] |
| [151] |
T. Sasaki and M. Tokoro.
Evolving learnable neural networks under changing environments with
various rates of inheritance of acquired characters: Comparison between
darwinian and lamarckian evolution.
Artificial Life, 5(3):203-223, 1999. [ bib ] |
| [152] |
M. Schmidt, M. Michalewicz, C. Chiriac, and Z. Michalewicz.
Optimization in a dynamic environment: A case study.
In Congress on Evolutionary Computation, volume 1, pages
781-788. IEEE press, 2005. [ bib | http ] |
| [153] |
L. Schönemann.
On the influence of population sizes in evolution strategies in
dynamic environments.
In J. Branke, editor, GECCO Workshop on Evolutionary Algorithms
for Dynamic Optimization Problems, pages 29-33, 2003. [ bib | http ] |
| [154] |
L. Schönemann.
The impact of population sizes and diversity on the adaptability of
evolution strategies in dynamic environments.
In Congress on Evolutionary Computation, volume 2, pages
1270-1277, 2004. [ bib ] |
| [155] |
A. Singh, D.E. Goldberg, and Y.P. Chen.
Modified linkage learning genetic algorithm for difficult
non-stationary problems.
In Genetic and Evolutionary Computation Conference, page 699.
ACM, 2002. [ bib ] |
| [156] |
J. E. Smith and F. Vavak.
Replacement strategies in steady state genetic algorithms: Dynamic
environments.
Journal of Computing and Information Technology, 7(1):49-59,
1999. [ bib | .ps.zip ] |
| [157] |
R. E. Smith.
Diploid genetic algorithms for search in time varying environments.
In Annual Southeast Regional Conference of the ACM, pages
175-179, New York, 1987. [ bib ] |
| [158] |
S. A. Stanhope and J. M. Daida.
Optimal mutation and crossover rates for a genetic algorithm
operating in a dynamic environment.
In Evolutionary Programming VII, number 1447 in LNCS, pages
693-702. Springer, 1998. [ bib ] |
| [159] |
Stephen A. Stanhope and Jason M. Daida.
Genetic algorithm fitness dynamics in a changing environment.
In Congress on Evolutionary Computation, volume 3, pages
1851-1858. IEEE, 1999. [ bib ] |
| [160] |
P. D. Stroud.
Kalman-extended genetic algorithm for search in nonstationary
environments with noisy fitness evaluations.
IEEE Transactions on Evolutionary Computation,
5(1):66-77, 2001. [ bib | .pdf ] |
| [161] |
J. C. W. Sullivan and A. G. Pipe.
An evolution strategy for on-line optimisation of dynamic objective
functions.
In H.-M. Voigt, editor, Parallel Problem Solving from Nature,
number 1141 in LNCS. Springer Verlag Berlin, 1996. [ bib ] |
| [162] |
T. Tagami and J. Tanomaru.
Enhanced performance of genetic algorithms in non-stationary
environment.
In S. Louis, editor, Golden West International Conference on
Intelligent Systems, pages 51-54. Raleigh, 1995. [ bib ] |
| [163] |
R. Tinos and A.C.P.L.F. de Carvalho.
A genetic algorithm with gene dependent mutation probability for
non-stationary optimization problems.
In Congress on Evolutionary Computation, volume 2, 2004. [ bib ] |
| [164] |
R. Tinos and S. Yang.
Genetic algorithms with self-organized criticality for dynamic
optimization problems.
In Congress on Evolutionary Computation, volume 3, pages
2816-2823. IEEE press, 2005. [ bib | http ] |
| [165] |
K. Trojanowski and Z. Michalewicz.
Searching for optima in non-stationary environments.
In Congress on Evolutionary Computation, volume 3, pages
1843-1850. IEEE, 1999. [ bib ] |
| [166] |
K. Trojanowski and Z. Michalewicz.
Evolutionary optimization in non-stationary environments.
Journal of Computer Science and Technology, 1(2):93-124, 2000. [ bib | http ] |
| [167] |
K. Trojanowski, Z. Michalewicz, and Jing Xiao.
Adding memory to the evolutionary planner/navigator.
In IEEE Intl. Conference on Evolutionary Computation, pages
483-487, 1997. [ bib | .ps.Z ] |
| [168] |
K. Tumer and A. Agogino.
Coordinating multi-rover systems: Evaluation functions for dynamic
and noisy environments.
In Hans-Georg Beyer et al., editors, Genetic and Evolutionary
Computation Conference, pages 591-598. ACM, 2005. [ bib ] |
| [169] |
R. K. Ursem.
Multinational GA optimization techniques in dynamic environments.
In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and
H.-G. Beyer, editors, Genetic and Evolutionary Computation Conference,
pages 19-26. Morgan Kaufmann, 2000. [ bib ] |
| [170] |
R. K. Ursem, T. Krink, M. T. Jensen, and Z. Michalewicz.
Analysis and modeling of control tasks in dynamic systems.
IEEE Transactions on Evolutionary Computation, 6(4):378-389,
2002. [ bib ] |
| [171] |
A. Sima Uyar and A. Emre Harmanci.
Performance comparisons of genotype to phenotype mapping schemes for
diploid representations in changing environments.
In Ahmad Lotfi, Jon Garibaldi, and Robert John, editors,
International Conference on Recent Advances in Soft Computing, pages
128-134, Nottingham, United Kingdom, 2002. The Nottingham Trent University. [ bib ] |
| [172] |
A. Sima. Uyar and A. Emre Harmanci.
A new population based adaptive domination change mechanism for
diploid genetic algorithms in dynamic environments.
Soft Computing - A Fusion of Foundations, Methodologies and
Applications, 9(11):803-814, 2005. [ bib ] |
| [173] |
J. Vaccaro and C. Guest.
Evolutionary bayesian network dynamic planner for game risk.
In G. R. Raidl, editor, Applications of evolutionary computing,
volume 3005 of LNCS, pages 549-560. Spinger, 2004. [ bib ] |
| [174] |
J. van Hemert, C. Van Hoyweghen, E. Lukshandl, and K. Verbeeck.
A futurist approach to dynamic environments.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 35-38, 2001. [ bib ] |
| [175] |
J. I. van Hemert and J. A. La Poutre.
Dynamic routing problems with fruitful regions: Models and
evolutionary computation.
In X. Yao et al., editor, Parallel Problem Solving from
Nature, volume 3242 of LNCS, pages 692-701. Springer, 2004. [ bib ] |
| [176] |
F. Vavak and T. C. Fogarty.
A comparative study of steady state and generational genetic
algorithms for use in nonstationary environments.
In T. C. Fogarty, editor, AISB workshop on Evolutionary
Computing, number 1143 in LNCS, pages 297-304. Springer, 1996. [ bib ] |
| [177] |
F. Vavak, T. C. Fogarty, and P. Cheng.
Load balancing application of the genetic algorithm in a
nonstationary environment.
In T. Fogarty, editor, AISB Workshop on Evolutionary Computing,
number 993 in LNCS, pages 224-233. Springer, 1995. [ bib ] |
| [178] |
F. Vavak, T. C. Fogarty, and K. Jukes.
A genetic algorithm with variable range of local search for tracking
changing environments.
In H.-M. Voigt, editor, Parallel Problem Solving from Nature,
number 1141 in LNCS. Springer Verlag Berlin, 1996. [ bib ] |
| [179] |
F. Vavak, K. Jukes, and T. C. Fogarty.
Adaptive balancing of a bank of sugar-beet presses using a genetic
algorithm with variable local search range.
In International Mendel Conference on Genetic Algorithms, pages
164-169. PC-DIR Publishing, 1997. [ bib ] |
| [180] |
F. Vavak, K. Jukes, and T. C. Fogarty.
Adaptive combustion balancing in multiple burner boiler using a
genetic algorithm with variable range of local search.
In T. Bäck, editor, International Conference on Genetic
Algorithms, pages 719-726. Morgan Kaufmann, 1997. [ bib | .ps ] |
| [181] |
F. Vavak, K. Jukes, and T. C. Fogarty.
Learning the local search range for genetic optimisation in
nonstationary environments.
In IEEE Intl. Conf. on Evolutionary Computation ICEC'97, pages
355-360. IEEE Publishing, 1997. [ bib ] |
| [182] |
F. Vavak, K. A. Jukes, and T. C. Fogarty.
Performance of a genetic algorithm with variable local search range
relative to frequency for the environmental changes.
In Koza et al., editor, International Conference on Genetic
Programming. Morgan Kaufmann, 1998. [ bib ] |
| [183] |
L. G. Volkert.
Levels of adaptation: insights into survival in dynamic environments.
In Congress on Evolutionary Computation, pages 139-144. IEEE
Press, 2002. [ bib ] |
| [184] |
N. Wagner, Z. Michalewicz, M. Khouja, and R. R. McGregor.
Forecasting with a dynamic window of time: The DyFor genetic
program model.
In L. Bolc, Z. Michalewicz, and T. Nishida, editors, Intelligent
Media Technology for Communicative Intelligence, volume 3490 of LNCS,
pages 205-214. Springer, 2005. [ bib | Abstract ] |
| [185] |
H. C. Wan, K. Dautenhahn, and C.L. Nehaniv.
Autobiographic agents in dynamic virtual environments - performance
comparison for different memory control architectures.
In Congress on Evolutionary Computation, volume 1, pages
573-580. IEEE press, 2005. [ bib | http ] |
| [186] |
K. Weicker.
An analysis od dynamic severity and population size.
In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J.
Merelo, and H.-P. Schwefel, editors, Parallel Problem Solving from
Nature (PPSN VI), volume 1917 of LNCS. Springer, 2000. [ bib ] |
| [187] |
K. Weicker.
Performance measures for dynamic environments.
In J.J. Merelo, P. Adamidis, H.-G. Beyer, J.L.
Fernández-Villacañas, and H.-P. Schwefel, editors, Parallel
Problem Solving from Nature, volume 2439 of LNCS, pages 64-73.
Springer, 2002. [ bib ] |
| [188] |
K. Weicker.
Evolutionary algorithms and dynamic optimization problems.
Der Andere Verlag, 2003. [ bib ] |
| [189] |
K. Weicker.
An empirical investigation of optimum tracking with evolution
strategies.
In World Conference on Soft Computing, 2004. [ bib ] |
| [190] |
K. Weicker.
Analysis of local operators applied to discrete tracking problems.
Soft Computing - A Fusion of Foundations,Methodologies and
Applications, 9(11):778-792, 2005. [ bib ] |
| [191] |
K. Weicker and N. Weicker.
On evolution strategy optimization in dynamic environments.
In Congress on Evolutionary Computation, volume 3, pages
2039-2046, 1999. [ bib ] |
| [192] |
K. Weicker and N. Weicker.
Dynamic rotation and partial visibility.
In Congress on Evolutionary Computation, pages 1125-1131,
2000. [ bib ] |
| [193] |
C. O. Wilke.
Evolution in time-dependent fitness landscapes.
Technical Report IR-INI 98-09, Institut für Neuroinformatik,
Ruhr-Universität Bochum, 1998. [ bib | http ] |
| [194] |
C. O. Wilke.
Evolutionary Dynamic in Time-Dependent Environments.
Shaker Verlag, 1999. [ bib | .ps.gz ] |
| [195] |
M. Wineberg and F. Oppacher.
Enhancing the GA's ability to cope with dynamic environments.
In Whitley et al., editor, Genetic and Evolutionary Computation
Conference, pages 3-10. Morgan Kaufmann, 2000. [ bib | .pdf ] |
| [196] |
K. Yamasaki.
Dynamic pareto optimum GA against the changing environments.
In GECCO Workshop on Evolutionary Algorithms for Dynamic
Optimization Problems, pages 47-50, 2001. [ bib | .ps.gz ] |
| [197] |
K. Yamasaki, K. Kitakaze, and M. Sekiguchi.
Dynamic optimization by evolutionary algorithms applied to financial
time series.
In Congress on Evolutionary Computation, pages 2017-2022.
IEEE, 2002. [ bib ] |
| [198] |
S. Yang.
Constructing dynamic test environments for genetic algorithms based
on problem difficulty.
In Congress on Evolutionary Computation, volume 2, pages
1262-1269, 2004. [ bib | .pdf ] |
| [199] |
S. Yang.
Memory-based immigrants for genetic algorithms in dynamic
environments.
In Hans-Georg Beyer et al., editors, Genetic and Evolutionary
Computation Conference, pages 1115-1122. ACM, 2005. [ bib ] |
| [200] |
S. Yang.
Memory-enhanced univariate marginal distribution algorithms for
dynamic optimization problems.
In Congress on Evolutionary Computation, volume 3, pages
2560-2567. IEEE press, 2005. [ bib | http ] |
| [201] |
S. Yang.
Population-based incremental learning with memory scheme for changing
environments.
In Hans-Georg Beyer et al., editors, Genetic and Evolutionary
Computation Conference, pages 711-718. ACM, 2005. [ bib ] |
| [202] |
S. Yang.
Associative memory scheme for genetic algorithms in dynamic
environments.
In F. Rothlauf et al., editors, Applications of Evolutionary
Computing, volume 3907 of LNCS, pages 788-799. Springer, 2006. [ bib ] |
| [203] |
S. Yang and Xin Yao.
Experimental study on population-based incremental learning
algorithms for dynamic optimization problems.
Soft Computing - A Fusion of Foundations, Methodologies and
Applications, 9(11):815-834, 2005. [ bib ] |
| [204] |
A. Younes, P. Calamai, and O. Basir.
Generalized benchmark generation for dynamic combinatorial problems.
In S. Yang, J. Branke, et al., editors, GECCO Workshop on
Evolutionary Algorithms for Dynamic Optimization, 2005. [ bib ] |
| [205] |
H. Yu, A. S. Wu, K.-C. Lin, and G. Schiavone.
Adaptation of length in a nonstationary environment.
In E. Cantu-Paz, editor, Genetic and Evolutionary Computation
Conference, volume 2724 of LNCS, pages 1541-1553. Springer, 2003. [ bib ] |
| [206] |
S. Y. Zeng, J. He, L.S. Kang, and H. de Garis.
A novel evolutionary algorithm based on an orthogonal design for
dynamic optimization problems.
In Congress on Evolutionary Computation, pages 1188 - 1195.
IEEE press, 2005. [ bib ] |
This file has been generated by bibtex2html 1.79