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 metaheuristic...
Κύριοι συγγραφείς: | , , , |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2006.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.