In this chapter we start to focus our attention only on heuristic methods, describing several important, well-established methods and trying to point out how and why they are useful whenever we face certain difficult optimization problems. Although (meta)heuristic algorithms are numerous, we opted for presenting here just a few of them, that, we believe, can give the reader a good view of the whole class. The emphasis will be on their qualitative aspects.
KeywordsGenetic Algorithm Particle Swarm Optimization Simulated Annealing Differential Evolution Metaheuristic Method
Unable to display preview. Download preview PDF.
- 6.Dorigo, M., Stützle, T.: Ant Colony Optimization. Bradford Books (2004)Google Scholar
- 7.Dréo, J., Pétrowski, A., Siarry, P., Taillard, E.: Metaheuristics for Hard Optimization Methods and Case Studies - Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies. Springer, Berlin (2006)Google Scholar
- 10.Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 20.Weise, T.: Global Optimization Algorithms - Theory and Application, http://www.it-weise.de/ (accessed July 11, 2011)