On the performance of evolutionary algorithms with life-time adaptation in dynamic fitness landscapes

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 2, Issue , 2004, Pages 1293-1300

  Eriksson, Roger ^a   Olsson, Björn ^a  

^a UNIVERSITY OF SKÖVDE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC FITNESS LANDSCAPES; GLOBAL OPTIMIZATION METHOD; LIFE-TIME ADAPTATION;

ENVIRONMENTAL ENGINEERING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

EVOLUTIONARY ALGORITHMS;

EID: 4344661570     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (48)

1. N. Krasnogor. Studies on the Theory and Design Space of Memetic Algorithms. PhD thesis, Faculty of Computing, Engineering and Mathematical Sciences, Univ. of the West of England, Bristol, UK, 2002.
2. W.E. Hart. Adaptive global optimization with local search. PhD thesis, Univ. of California, San Diego, CA, USA, 1994.
3. B. Freisleben and P. Merz. A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. In Proc. 1996 IEEE Int. Conf. on Evolutionary Computation, pages 616-621. IEEE Press, 1996.
4. P. Merz and B. Freisleben. Genetic Local Search for the TSP: New Results. In Proc. of the 1997 IEEE Int. Conf. on Evolutionary Computation, pages 159-164. IEEE Press, 1997.
5. P. Merz and B. Freisleben. A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In Proc. Congress on Evolutionary Computation, volume 3, pages 2063-2070. IEEE Press, 1999.
6. P. Merz and B. Freisleben. Genetic algorithms for binary quadratic programming. In Proc. of the Genetic and Evolutionary Computation Conf., volume 1, pages 417-424. Morgan Kaufmann, 1999.
7. R. Dorne and J.-K. Hao. A new genetic local search algorithm for graph coloring. In Parallel Problem Solving from Nature - PPSN V, pages 745-754. Springer, 1998.
8. G. E. Hinton and S. J. Nowlan. How learning can guide evolution. Complex Systems, 1(1):495-502, 1987.
9. D. H. Ackley and M. L. Littman. Interactions between learning and evolution. In C. G. Langton, C. Taylor, J, D. Farmer, and S. Rasmussen, editors, Artificial Life II, pages 487-509. Addison-Wesley, 1992.
10. F. Gruau and D. Whitley. Adding learning to the cellular development of neural networks: Evolution and the Baldwin effect. Evol. Camp., 1(3):213-233, 1993.
11. D. Whitley, V. S. Gordon, and K. Mathias. Lamarckian evolution, the Baldwin effect and function optimization. In Y. Davidor and H.-P. Schwefel, editors, Parallel Problem Solving from Nature - PPSN III, pages 6-15. Springer, 1994.
12. R. Eriksson and B. Olsson. On the behavior of evolutionary global-local hybrids with dynamic fitness functions. In Parallel Problem Solving from Nature - PPSN VII, pages 13-22. Springer, 2002.
13. T. Sasaki and M. Tokoro. Adaptation toward changing environments: Why Darwinian in nature? In P. Husbands and I. Harvey, editors, Proc. of the Fourth European Conf. on Artificial Lift, pages 145-153, Cambridge, MA, 1997. MIT Press.
14. T. Sasaki and M. Tokoro. Comparison between Lamarckian and Darwinian evolution on a model using neural networks and genetic algorithms. Knowledge and Information Systems, 2(2):201-222, 2000.
15. S. Nolfi and D. Parisi. Learning to adapt to changing environments in evolving neural networks. Adaptive Behavior, 5(1):75-98, 1996.
16. S. Nolfi and D. Floreano. Coevolving predator and prey robots: Do "arms races" arise in artificial evolution? Artificial Life, 4(4):311-335, 1998.
17. K. A. De Jong. Evolving in a changing world. In Zbigniew W. Raś and Andrzej Skowron, editors, 11th Int. Symposium on Foundations of Intelligent Systems, pages 512-519. Springer, 1999.
18. K. A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI, USA, 1975.
19. D. E. Goldberg and R. E. Smith. Nonstationary function optimization using genetic algorithms with dominance and diploidy. In 2nd Int. Conf. on Genetic Algorithms, pages 59-68. Lawrence Erlbaum, 1987.
20. D. Dasgupta and D.R. McGregor. Nonstationary function optimization using the structured genetic algorithm. In Parallel Problem Solving from Nature, pages 145-154. Elsevier, 1992.
21. K.P. Ng and K.C. Wong. A new diploid scheme and dominance change mechanism for non-stationary function optimization. In Proc. 6th Int. Conf. on Genetic Algorithms, pages 159-166. Morgan Kaufmann, 1995.
22. B.S. Hadad and C.F. Eick. Supporting polyploidy in genetic algorithms using dominance vectors. In Evolutionary Programming VI, pages 223-234. Springer, 1997.
23. T. Kuo and S.-Y. Hwang. Using disruptive selection to maintain diversity in genetic algorithms. Applied Intelligence, 7(3):257-267, 1997.
24. A. Ghosh, S. Tsutsui, and H. Tanaka. Function optimization in non-stationary environment using steady state genetic algorithms with aging of individuals. In Proc. of the 1998 IEEE Int. Conf. on Evolutionary Computation, pages 666-671. IEEE Press, 1998.
25. J. Lewis, E. Hart, and G. Ritchie. A comparison of dominance mechanisms and simple mutation on non-stationary problems. In Parallel Problem Solving from Nature - PPSN V, pages 139-148. Springer, 1998.
26. N. Mori, H. Kita, and Y. Nishikawa. Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm. In Parallel Problem Solving from Nature - PPSN V, pages 149-158. Springer, 1998.
27. H.-L. Fang, P. Ross, and D. Corne. A promising genetic algorithm approach to job-shop scheduling, re-scheduling, and open-shop scheduling problems. In Proc. 5th Int. Conf. on Genetic Algorithms, pages 375-382. Morgan Kaufmann, 1993.
28. S.-C. Lin, E.D. Goodman, and W.F. Punch III. A genetic algorithm approach to dynamic job shop scheduling problems. In Proc. 7th Int. Conf. on Genetic Algorithms, pages 481-488. Morgan Kaufmann, 1997.
29. C. Bierwirth and D.C. Mattfeld. Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7(1):1-17, 1999.
30. E. Pettit and K.M. Swigger. An analysis of genetic-based pattern tracking and cognitive-based component tracking models of adaptation. In Proc. National Conf. on Artificial Intelligence, pages 327-332. AAAI Press, 1983.
31. F. Vavak and T.C. Fogarty. A comparative study of steady state and generational genetic algorithms. In Proc. AISB Workshop on Evolutionary Computing, pages 297-304, 1996.
32. P. Collard, C. Escazut, and A. Gaspar, An evolutionary approach for time dependant optimization. Int. J. on Artificial Intelligence Tools, 6(4):665-695, 1997.
33. A. Gaspar and P. Collard. Time dependent optimization with a folding genetic algorithm. In 9th Int. Conf. on Tools with Artificial Intelligence (ICTAI '97), pages 207-214. IEEE Computer Society Press, 1997.
34. 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, pages 693-702. Springer, 1998.
35. C.O. Wilke and T. Martinetz. Adaptive walks on time-dependent fitness landscapes. Physical Review E, 60(2):2154-2159, 1999.
36. P.J. Angeline. Tracking extrema in dynamic environments. In Proc. 6th Int. Conf. on Evolutionary Programming, pages 335-345. Springer, 1997.
37. R. Salomon and P. Eggenberger. Adaptation on the evolutionary time scale: A working hypothesis and basic experiments. In 3rd European Conf. on Artificial Evolution, pages 251-262. Springer, 1997.
38. T. Bäck. On the behavior of evolutionary algorithms in dynamic environments. In Proc. 5th IEEE Conf. on Evol. Comp., pages 446-451. IEEE Press, 1998.
39. J. Branke. Memory enhanced evolutionary algorithms for changing optimization problems. In Proc. Congr. on Evolutionary Computation, volume 3, pages 1875-1882. IEEE Press, 1999.
40. J.J. Grefenstette. Evolvability in dynamic fitness landscapes: A genetic algorithm approach. In Proc. of the Congress on Evolutionary Computation, pages 652-659. IEEE Press, 1999. [82].
41. R.W. Morrison and K.A. De Jong. A test problem generator for non-stationary environments. In Proc. Congress on Evolutionary Computation, volume 3, pages 2047-2053. IEEE Press, 1999.
42. S.A. Kauffman. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, 1993.
43. J. Branke. Evolutionary optimization in dynamic environments, volume 3 of Genetic Algorithms and Evolutionary Computation. Kluwer, 2001.
44. J.J. Grefenstette. Genetic algorithms for changing environments. In Parallel Problem Solving from Nature, pages 137-144. North Holland, 1992.
45. T. Blickle and L. Thiele. A comparison of selection schemes used in evolutionary algorithms. Evol. Comp., 4(4):361-394, 1997.
46. M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, 1995.
47. W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery. Numerical recipes in C: the art of scientific computing. Cambridge University Press, 2nd edition, 1992.
48. R. P. Brent. Algorithms for Minimization without Derivatives. Prentice-Hall, 1973.