Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.
BuchGebunden
410 Seiten
Englisch
Springererschienen am23.08.2007
Provides several different kinds of information: a delineation of general metaheuristics methods, many advanced articles from a variety of classical application areas as well as an outlook to modern computational methods in promising areas. This book is suitable for students, and for people who are interested in engineering or social sciences.mehr
Verfügbare Formate
BuchGebunden
EUR106,99
BuchKartoniert, Paperback
EUR117,69
E-BookPDF1 - PDF WatermarkE-Book
EUR96,29

Produkt

KlappentextProvides several different kinds of information: a delineation of general metaheuristics methods, many advanced articles from a variety of classical application areas as well as an outlook to modern computational methods in promising areas. This book is suitable for students, and for people who are interested in engineering or social sciences.
Details
ISBN/GTIN978-0-387-71919-1
ProduktartBuch
EinbandartGebunden
Verlag
Erscheinungsjahr2007
Erscheinungsdatum23.08.2007
ReiheOperations Research/Computer Science Interfaces Series
Seiten410 Seiten
SpracheEnglisch
IllustrationenXIV, 410 p. 66 illus.
Artikel-Nr.11800772
Rubriken
GenreWirtschaft

Inhalt/Kritik

Inhaltsverzeichnis
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 Dynamic Combinatorial Problems.- A Memetic Algorithm for Dynamic Location Problems.- A Study of Canonical GAs for NSOPs.- Particle Swarm Optimization and Sequential Sampling in Noisy Environments.- Distributed and Parallel Algorithms.- Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm.- Exploring Grid Implementations of Parallel Cooperative Metaheuristics.- Algorithm Tuning, Algorithm Design and Software Tools.- Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems.- Distance Measures and Fitness-Distance Analysis for the Capacitated Vehicle Routing Problem.- Tuning Tabu Search Strategies Via Visual Diagnosis.- Solving Vehicle Routing Using IOPT.mehr