1927 search results - page 7 / 386 » UMDAs for dynamic optimization problems |
165
Voted
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
94
Voted
CEC
2005
IEEE
15 years 6 days ago
2005
IEEE
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...