+612 9045 4394
 
CHECKOUT
Meta-Heuristics : Advances and Trends in Local Search Paradigms for Optimization :  Advances and Trends in Local Search Paradigms for Optimization - Stefan Voss

Meta-Heuristics : Advances and Trends in Local Search Paradigms for Optimization

Advances and Trends in Local Search Paradigms for Optimization

By: Stefan Voss (Editor), Silvano Martello (Editor), Ibrahim H. Osman (Editor), Catherine Roucairol (Editor)

Hardcover Published: December 2009
ISBN: 9780792383697
Number Of Pages: 511

Share This Book:

Hardcover

RRP $1014.99
$702.75
31%
OFF
or 4 easy payments of $175.69 with Learn more
Ships in 7 to 10 business days

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies. The book is divided into six parts, grouped mainly by the techniques considered. The extensive first part with twelve papers covers tabu search and its application to a great variety of well-known combinatorial optimization problems (including the resource-constrained project scheduling problem and vehicle routing problems). In the second part we find one paper where tabu search and simulated annealing are investigated comparatively and two papers which consider hybrid methods combining tabu search with genetic algorithms. The third part has four papers on genetic and evolutionary algorithms. Part four arrives at a new paradigm within meta-heuristics. The fifth part studies the behavior of parallel local search algorithms mainly from a tabu search perspective. The final part examines a great variety of additional meta-heuristics topics, including neural networks and variable neighbourhood search as well as guided local search. Furthermore, the integration of meta-heuristics with the branch-and-bound paradigm is investigated.

Preface
Tabu Search Algorithms and Lower Bounds for the Resource-Constrained Project Scheduling Problemp. 1
Metaheuristic for the Vehicle Routing Problem with Time Windowsp. 19
New Heuristic Algorithms for the Crew Scheduling Problemp. 37
Enhanced Continuous Tabu Search: An Algorithm for Optimizing Multiminima Functionsp. 49
Local Search in Constraint Programming: Experiments with Tabu Search on the Vehicle Routing Problemp. 63
Tabu Search for Graph Coloring, T-colorings and Set T-coloringsp. 77
Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programsp. 93
Actuator Selection for the Control of Multi-Frequency Noise in Aircraft Interiorsp. 111
Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problemp. 125
Candidate List and Exploration Strategies for Solving 0/1 MIP Problems using a Pivot Neighborhoodp. 141
Global and Local Moves in Tabu Search: A Real-Life Mail Collecting Applicationp. 155
Flow Line Scheduling by Tabu Searchp. 175
Using Lower Bounds in Minimum Span Frequency Assignmentp. 191
A Hybrid Heuristic for Multiobjective Knapsack Problemsp. 205
Hybrid Genetic Tabu Search for a Cyclic Scheduling Problemp. 213
Adaptive Genetic Algorithms: A Methodology for Dynamic Autoconfiguration of Genetic Search Algorithmsp. 231
The Lavish Ordering Genetic Algorithmp. 249
Fitness Landscapes and Performance of Meta-Heuristicsp. 257
A Network-Based Adaptive Evolutionary Algorithm for Constraint Satisfaction Problemsp. 269
Applying the Ant System to the Vehicle Routing Problemp. 285
Cooperative Intelligent Search Using Adaptive Memory Techniquesp. 297
The Max-Min Ant System and Local Search for Combinatorial Optimization Problemsp. 313
Towards an Evolutionary Method - Cooperating Multi-Thread Parallel Tabu Search Hybridp. 331
Parallel Tabu Search for Large Optimization Problemsp. 345
Sequential and Parallel Local Search Algorithms for Job Shop Schedulingp. 359
An Experimental Study of Systemic Behavior of Cooperative Search Algorithmsp. 373
A Hopfield-Tank Neural Network Model for the Generalized Traveling Salesman Problemp. 393
Generalized Cybernetic Optimization: Solving Continuous Variable Problemsp. 403
Solving the Progressive Party Problem by Local Searchp. 419
An Introduction to Variable Neighborhood Searchp. 433
A Variable Depth Search Algorithm for the Generalized Assignment Problemp. 459
Guided Local Search for the Vehicle Routing Problem with Time Windowsp. 473
Memory Adaptive Reasoning and Greedy Assignment Techniques for the Capacitated Minimum Spanning Tree Problemp. 487
A Chunking Based Selection Strategy for Integrating Meta-Heuristics with Branch and Boundp. 499
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780792383697
ISBN-10: 0792383699
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 511
Published: December 2009
Publisher: Springer
Country of Publication: NL
Dimensions (cm): 23.5 x 15.5  x 3.18
Weight (kg): 0.91