Abstract
Stochastic algorithms provide an effective framework to solve complex optimization problems, when derivative information is not available. Simulated Annealing and Genetic Algorithms are stochastic optimization methods that can identify putative optimal solutions without using derivative information. This article presents the mathematical foundations and the algorithmic framework of these two methods.
Original language | English |
---|---|
Title of host publication | Encyclopedia of Bioinformatics and Computational Biology |
Subtitle of host publication | ABC of Bioinformatics |
Publisher | Elsevier |
Pages | 321-327 |
Number of pages | 7 |
Volume | 1-3 |
ISBN (Electronic) | 9780128114322 |
ISBN (Print) | 9780128114148 |
DOIs | |
Publication status | Published - 1 Jan 2018 |
Keywords
- derivative-free optimization
- genetic algorithms
- global optimization
- simulated annealing