Presentation	2001/5/11 Genetic Algorithms under Dynamic Environment Kazuko Yamasaki,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The purpose of this study is to show the two new views of the studies under dynamic environment and to propose new method "Dynamic Pareto Optimum GA". The former is that "In the static environment, the adaptation is done for the optimum solutions, but in the case of dynamic environment, the adaptation should be done toward the characteristics of environmental changes." The latter is "When the environmental changes are faster than the velocity of adaptation, we have to choose how we adapt." In this new method, genes, schemas and chromosomes are not conserved, but the past fitness values are retained as internal time series of each agent. By pareto-optimum, this method decides which agent should be conserved.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	dynamic environment / adaptation / genetic algorithms / pareto optimum
Paper #	AI2001-8
Date of Issue

Conference Information
Committee	AI
Conference Date	2001/5/11(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Artificial Intelligence and Knowledge-Based Processing (AI)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Genetic Algorithms under Dynamic Environment
Sub Title (in English)
Keyword(1)	dynamic environment
Keyword(2)	adaptation
Keyword(3)	genetic algorithms
Keyword(4)	pareto optimum
1st Author's Name	Kazuko Yamasaki
1st Author's Affiliation	Department of Environmental Information Tokyo University of Information Sciences()
Date	2001/5/11
Paper #	AI2001-8
Volume (vol)	vol.101
Number (no)	66
Page	pp.pp.-
#Pages	8
Date of Issue