Evolutionary Algorithms and Dynamic Programming. Theile, M. 2009.
abstract   bibtex   
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the problems that have been considered are tackled by evolutionary algorithms that use a representation which enables them to construct solution in a dynamic programming fashion. We take a general approach and relate the construction of such algorithms to the development of algorithms using dynamic programming techniques. Thereby, we give general guidelines on how to develop evolutionary algorithms that have the additional ability of carrying out dynamic programming steps.
@unpublished{theile_evolutionary_2009,
	type = {Submitted},
	title = {Evolutionary {Algorithms} and {Dynamic} {Programming}},
	abstract = {Recently, it has been proven that evolutionary algorithms produce good results for a wide range of  combinatorial optimization problems. Some of the problems that have been
considered are tackled by evolutionary algorithms that use a
representation which enables them to construct solution in a dynamic programming fashion. We take a general approach and relate the construction of such algorithms to the development of algorithms using dynamic programming techniques. Thereby, we give general guidelines on how to develop evolutionary algorithms that have the additional ability of carrying out dynamic programming steps.},
	author = {Theile, Madeleine},
	year = {2009}
}

Downloads: 0