Metaheuristics for hard optimization : simulated annealing, tabu search, evolutionary and genetic algorithms, ant colonies, methods and case studies
Metaheuristics for Hard Optimization comprises of three parts. The first part is devoted to the detailed presentation of the four most widely known metaheuristics: the simulated annealing method, tabu search, the evolutionary algorithms, ant colony algorithms. Each one of these metaheuristics is act...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
2006.
Cham : Springer Nature |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) Trad. de : " Métaheuristiques pour l'optimisation difficile " par Amitava Chatterjee |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | Metaheuristiques pour l'optimisation difficile., English |
| Edition sous un autre format: | • Metaheuristics for Hard Optimization, Texte imprimé, 9783540230229 • Metaheuristics for Hard Optimization, Texte imprimé, 9783540803744 • Metaheuristics for Hard Optimization, Texte imprimé, 9783642061943 |
Inhaltsangabe:
- Presentation of the Main Metaheuristics
- Simulated Annealing
- Tabu Search
- Evolutionary Algorithms
- Ant Colony Algorithms
- Variants, Extensions and Methodological Advices
- Some Other Metaheuristics
- Extensions
- Methodology
- Case Studies
- Optimization of UMTS Radio Access Networks with Genetic Algorithms
- Genetic Algorithms Applied to Air Traffic Management
- Constraint Programming and Ant Colonies Applied to Vehicle Routing Problems.