Metaheuristics (eBook, PDF)
-6%
80,95 €
Statt 85,99 €**
80,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar
Statt 85,99 €**
80,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
Als Download kaufen
Statt 85,99 €**
-6%
80,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar
Abo Download
9,90 € / Monat*
*Abopreis beinhaltet vier eBooks, die aus der tolino select Titelauswahl im Abo geladen werden können.

inkl. MwSt.
Sofort per Download lieferbar

Einmalig pro Kunde einen Monat kostenlos testen (danach 9,90 € pro Monat), jeden Monat 4 aus 40 Titeln wählen, monatlich kündbar.

Mehr zum tolino select eBook-Abo
Jetzt verschenken
Statt 85,99 €**
-6%
80,95 €
inkl. MwSt.
**Preis der gedruckten Ausgabe (Gebundenes Buch)
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
40 °P sammeln

  • Format: PDF


The aim of Metaheuristics: Progress in Complex Systems Optimization is to provide several different kinds of information: a delineation of general metaheuristics methods, a number of state-of-the-art articles from a variety of well-known classical application areas as well as an outlook to modern computational methods in promising new areas. Therefore, this book may equally serve as a textbook in graduate courses for students, as a reference book for people interested in engineering or social sciences, and as a collection of new and promising avenues for researchers working in this field.…mehr

  • Geräte: PC
  • ohne Kopierschutz
  • eBook Hilfe
  • Größe: 16.07MB
Produktbeschreibung
The aim of Metaheuristics: Progress in Complex Systems Optimization is to provide several different kinds of information: a delineation of general metaheuristics methods, a number of state-of-the-art articles from a variety of well-known classical application areas as well as an outlook to modern computational methods in promising new areas. Therefore, this book may equally serve as a textbook in graduate courses for students, as a reference book for people interested in engineering or social sciences, and as a collection of new and promising avenues for researchers working in this field. Highlighted are recent developments in the areas of Simulated Annealing, Path Relinking, Scatter Search, Tabu Search, Variable Neighborhood Search, Hyper-heuristics, Constraint Programming, Iterated Local Search, GRASP, bio-inspired algorithms like Genetic Algorithms, Memetic Algorithms, Ant Colony Optimization or Swarm Intelligence, and several other paradigms. TOC:General concepts, case studies and software tools.- Path relinking, scatter search, and tabu search.- Bio-inspired methods.- Special neighbourhood paradigms.- Linear and non-linear models including relaxation methods.- Hybridization.- Multiobjective, dynamic and stochastic problems and parallel computation.- New research avenus and application areas.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

  • Produktdetails
  • Verlag: Springer-Verlag GmbH
  • Erscheinungstermin: 13.08.2007
  • Englisch
  • ISBN-13: 9780387719214
  • Artikelnr.: 37287720
Autorenporträt
Karl F. Doerner, University of Vienna, Austria / Michel Gendreau, CIRRELT, Montreal, Canada / Peter Greistorfer, Karl-Franzens-Universität Graz, Austria / Walter Gutjahr, University of Vienna, Austria / Richard F. Hartl, University of Vienna, Austria / Marc Reimann, ETH Zurich, Switzerland
Inhaltsangabe
Scatter Search.- Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem.- A Scatter Search Heuristic for the Fixed-Charge Capacitated Network Design Problem.- Tabu Search.- Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems.- Log-Truck Scheduling with a Tabu Search Strategy.- Nature-inspired methods.- Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms.- Reviewer Assignment for Scientific Articles using Memetic Algorithms.- GRASP and Iterative Methods.- Grasp with Path-Relinking for the Tsp.- Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem.- Dynamic and Stochastic Problems.- Variable Neighborhood Search for the Probabilistic Satisfiability Problem.- The ACO/F-Race Algorithm for Combinatorial Optimization Under Uncertainty.- Adaptive Control of Genetic Parameters for