Meta-Heuristics
Theory and Applications
Published on 31. March 1996
Book
Hardback
X, 690 pages
978-0-7923-9700-7 (ISBN)
Description
Meta-heuristics have developed dramatically since their inception in the early 1980s. They have had widespread success in attacking a variety of practical and difficult combinatorial optimization problems. These families of approaches include, but are not limited to greedy random adaptive search procedures, genetic algorithms, problem-space search, neural networks, simulated annealing, tabu search, threshold algorithms, and their hybrids. They incorporate concepts based on biological evolution, intelligent problem solving, mathematical and physical sciences, nervous systems, and statistical mechanics. Since the 1980s, a great deal of effort has been invested in the field of combinatorial optimization theory in which heuristic algorithms have become an important area of research and applications.
This volume is drawn from the first conference on Meta-Heuristics and contains 41 papers on the state-of-the-art in heuristic theory and applications. The book treats the following meta-heuristics and applications: Genetic Algorithms, Simulated Annealing, Tabu Search, Networks & Graphs, Scheduling and Control, TSP, and Vehicle Routing Problems. It represents research from the fields of Operations Research, Management Science, Artificial Intelligence and Computer Science.
This volume is drawn from the first conference on Meta-Heuristics and contains 41 papers on the state-of-the-art in heuristic theory and applications. The book treats the following meta-heuristics and applications: Genetic Algorithms, Simulated Annealing, Tabu Search, Networks & Graphs, Scheduling and Control, TSP, and Vehicle Routing Problems. It represents research from the fields of Operations Research, Management Science, Artificial Intelligence and Computer Science.
More details
Edition
1996 ed.
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Research
Illustrations
X, 690 p.
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 42 mm
Weight
1203 gr
ISBN-13
978-0-7923-9700-7 (9780792397007)
DOI
10.1007/978-1-4613-1361-8
Schweitzer Classification
Other editions
Additional editions
E-Book
12/2012
Springer
€309.23
Available for download
Book
09/2011
Springer
€374.49
Shipment within 15-20 days
Content
Ch. 1 "Meta-Heuristics: An Overview".- Genetic Algorithms.- Ch. 2 "A Parallel Genetic Algorithm for the Set Partitioning Problem".- Ch. 3 "Evolutionary Computation and Heuristics".- Ch. 4 "Gene Pool Recombination in Genetic Algorithms".- Ch. 5 "Genetic and Local Search Algorithms as Robust and Simple Optimization Tools".- Networks and Graphs.- Ch. 6 "Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree".- Ch. 7 "An Aggressive Search Procedure for the Bipartite Drawing Problem".- Ch. 8 "Guided Search for the Shortest Path on Transportation Networks".- Scheduling and Control.- Ch. 9 "A Metaheuristic for the Timetabling Problem".- Ch. 10 "Complex Sequencing Problems and Local Search Heuristics".- Ch. 11 "Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties".- Ch. 12 "Heuristics for the Optimal Control of Thermal Energy Storage".- Ch. 13 "Exploiting Block Structure to Improve Resource-Constrained Project Schedules".- Ch. 14 "Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem".- Ch. 15 "Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search".- Simulated Annealing.- Ch. 16 "Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control".- Ch. 17 "A Simulated Annealing Algorithm for the Computation of Marginal Costs of Telecommunication Links".- Ch. 18 "Learning to Recognize (Un) Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing".- Ch. 19 "A Preliminary Investigation into the Performance of Heuristic Search Methods Applied to CompoundCombinatorial Problems".- Tabu Search.- Ch. 20 "Tabu Search, Combination and Integration".- Ch. 21 "Vector Quantization with the Reactive Tabu Search".- Ch. 22 "Tabu Thresholding for the Frequency Assignment Problem".- Ch. 23 "A New Tabu Search Approach to the 0-1 Equicut Problem".- Ch. 24 "Simple Tabu Thresholding and the Pallet Loading Problem".- Ch. 25 "Critical Event Tabu Search for Multidimensional Knapsack Problems".- Ch. 26 "Solving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scaling".- Ch. 27 "Comparison of Heuristics for the 0-1 Multidimensional Knapsack Problem".- Ch. 28 "Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems".- Ch. 29 "A Star-Shaped Diversification Approach in Tabu Search".- Ch. 30 "Communication Issues in Designing Cooperative Multi-Thread Parallel Searches".- Ch. 31 "A Study on Algorithms for Selecting r Best Elements from An Array".- Ch. 32 "A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem".- Ch. 33 "Chunking Applied to Reactive Tabu Search".- Ch. 34 "Tabu Search on the Geometric Traveling Salesman Problem".- Traveling Salesman Problems.- Ch. 35 "Mixing Different Components of Metaheuristics".- Ch. 36 "A Probabilistic Analysis of Local Search".- Ch. 37 "The Clustered Traveling Salesman Problem: A Genetic Approach".- Vehicle Routing Problems.- Ch. 38 "A Tabu Search Based Heuristic for Arc Routing with a Capacity Constraint and Time Deadline".- Ch. 39 "Supervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problem".- Ch. 40 "A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle RoutingProblem".- Ch. 41 "Fast Local Search Algorithms for the Handicapped Persons Transportation Problem".