E-Book, Englisch, Band 39, 410 Seiten
Reihe: Operations Research/Computer Science Interfaces Series
Doerner / Gendreau / Greistorfer Metaheuristics
1. Auflage 2007
ISBN: 978-0-387-71921-4
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
Progress in Complex Systems Optimization
E-Book, Englisch, Band 39, 410 Seiten
Reihe: Operations Research/Computer Science Interfaces Series
ISBN: 978-0-387-71921-4
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
This book's aim 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.
Autoren/Hrsg.
Weitere Infos & Material
1;Chapter 1 EXPERIMENTS USING SCATTER SEARCH FOR THE MULTIDEMAND MULTIDIMENSIONAL KNAPSACK PROBLEM;15
2;Chapter 2 A SCATTER SEARCH HEURISTIC FOR THE FIXED-CHARGE CAPACITATED NETWORK DESIGN PROBLEM;37
3;Chapter 3 TABU SEARCH-BASED METAHEURISTIC ALGORITHM FOR LARGE-SCALESET COVERING PROBLEMS;54
4;Chapter 4 LOG- TRUCK SCHEDULING WITH A TABU SEARCH STRATEGY;75
5;Chapter 5 SOLVING THE CAPACITATEDMULTI-FACILITY WEBER PROBLEM BY SIMULATED ANNEALING, THRESHOLD ACCEPTING AND GENETIC ALGORITHMS;100
6;Chapter 6 REVIEWER ASSIGNMENT FORCIENTIFIC ARTICLES USINGEMETIC ALGORITHMS;122
7;Chapter 7 GRASP WITH PATH-RELINKING FOR THE TSP;145
8;Chapter 8 USING A RANDOMISED ITERATIVE IMPROVEMENT ALGORITHM WITH COMPOSITE NEIGHBOURHOOD STRUCTURES FOR THE UNIVERSITY COURSE TIMETABLING PROBLEM;161
9;Chapter 9 VARIABLE NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC SATISFIABILITY PROBLEM;179
10;Chapter 10 THE ACO/F-RACE ALGORITHM FOR COMBINATORIAL OPTIMIZATION UNDER UNCERTAINTY;195
11;Chapter 11 ADAPTIVE CONTROL OF GENETIC PARAMETERS FOR DYNAMIC COMBINATORIAL PROBLEMS;210
12;Chapter 12 A MEMETIC ALGORITHM FOR DYNAMIC LOCATION PROBLEMS;229
13;Chapter 13 A STUDY OF CANONICAL GAs FOR NSOPs;249
14;Chapter 14 PARTICLE SWARM OPTIMIZATION AND SEQUENTIAL SAMPLING IN NOISY ENVIRONMENTS;265
15;Chapter 15 EMBEDDING A CHAINED LIN-KERNIGHAN ALGORITHM INTO A DISTRIBUTED ALGORITHM;279
16;Chapter 16 EXPLORING GRID IMPLEMENTATIONS OF PARALLEL COOPERATIVE METAHEURISTICS;298
17;Chapter 17 USING EXPERIMENTAL DESIGN TO ANALYZE STOCHASTIC LOCAL SEARCH ALGORITHMS FOR MULTIOBJECTIVE PROBLEMS;325
18;Chapter 18 DISTANCE MEASURES AND FITNESS-DISTANCE ANALYSIS FOR THE CAPACITATED VEHICLE ROUTING PROBLEM;345
19;Chapter 19 TUNING TABU SEARCH STRATEGIES VIA VISUAL DIAGNOSIS;365
20;Chapter 20 SOLVING VEHICLE ROUTING USING IOPT;389
