Hybrid Metaheuristics An Emerging Approach to Optimization /

Optimization problems are of great importance in many fields. They can be tackled, for example, by approximate algorithms such as metaheuristics. Examples of metaheuristics are simulated annealing, tabu search, evolutionary computation, iterated local search, variable neighborhood search, and ant co...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Blum, Christian (Επιμελητής έκδοσης), Aguilera, Maria José Blesa (Επιμελητής έκδοσης), Roli, Andrea (Επιμελητής έκδοσης), Sampels, Michael (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Σειρά:Studies in Computational Intelligence, 114
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Hybrid Metaheuristics: An Introduction
  • Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
  • The Relation Between Complete and Incomplete Search
  • Hybridizations of Metaheuristics With Branch & Bound Derivates
  • Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
  • Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
  • Hybrid Metaheuristics for Packing Problems
  • Hybrid Metaheuristics for Multi-objective Combinatorial Optimization
  • Multilevel Refinement for Combinatorial Optimisation: Boosting Metaheuristic Performance.