Abstract
A special class of optimal discrete-valued control problems is solved by two different global optimization techniques, namely, the Simulated Annealing algorithm (SA) and the Genetic algorithm (GA). Two numerical examples have been solved to examine the efficiency of each of these two methods.
Original language | English |
---|---|
Pages (from-to) | 735-756 |
Number of pages | 22 |
Journal | Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms |
Volume | 11 |
Issue number | 6 |
Publication status | Published - 1 Dec 2004 |
Keywords
- Discrete valued
- Genetic algorithm
- Global optimization
- Optimal control
- Simulated annealing
ASJC Scopus subject areas
- Applied Mathematics
- Discrete Mathematics and Combinatorics