+612 9045 4394
 
CHECKOUT
Essays and Surveys in Metaheuristics : Operations Research/Computer Science Interfaces - Celso C. Ribeiro

Essays and Surveys in Metaheuristics

Operations Research/Computer Science Interfaces

By: Celso C. Ribeiro (Editor), Pierre Hansen (Editor)

Hardcover Published: 31st October 2001
ISBN: 9780792375203
Number Of Pages: 651

Share This Book:

Hardcover

$452.20
or 4 easy payments of $113.05 with Learn more
Ships in 15 business days

Earn 904 Qantas Points
on this Book

Other Available Editions (Hide)

  • Paperback View Product Published: 26th October 2012
    Ships in 15 business days
    $497.53

The field of metaheuristics has been fast evolving in recent years. Techniques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimization problems. A very large number of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry. Essays and Surveys in Metaheuristics goes beyond the recent conference-oriented volumes in Metaheuristics, with its focus on surveys of recent developments of the main metaheuristics. Well-known specialists have written surveys on the following subjects: simulated annealing (E. Aarts and J. Korst, The Netherlands), noising methods (I. Charon and O. Hudry, France), strategies for the parallel implementation of metaheuristics (V.-D. Cung and C. Roucairol, France, and S.L. Martins and C.C. Ribeiro, Brazil), greedy randomized adaptive search procedures (P. Festa, Italy, and M.G.C. Resende, USA), tabu search (M. Gendreau, Canada), variable neighborhood search (P. Hansen and N. Mladenovic, Canada), ant colonies (V. Maniezzo and A. Carbonaro, Italy), and evolutionary algorithms (H. MA1/4hlenbein and Th. Mahnig, Germany). Several further essays address issues or variants of metaheuristics, as well as innovative or successful applications of metaheuristics to classical or new combinatorial optimization problems.

Preface
Selected Topics in Simulated Annealingp. 1
Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphsp. 39
A GRASP for Job Shop Schedulingp. 59
A Reactive GRASP for Transmission Network Expansion Planningp. 81
Tabu Search for Two-Dimensional Irregular Cuttingp. 101
A Study of Global Convexity for a Multiple Objective Travelling Salesman Problemp. 129
A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problemp. 151
A Simulated Annealing Approach for Minimum Cost Isolated Failure Immune Networksp. 169
A GRASP Interactive Approach to the Vehicle Routing Problem with Backhaulsp. 185
Parallel Cooperative Approaches for the Labor Constrained Scheduling Problemp. 201
A Scatter Search Algorithm for the Maximum Clique Problemp. 227
The Noising Methods: A Surveyp. 245
Strategies for the Parallel Implementation of Metaheuristicsp. 263
Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problemsp. 309
GRASP: An Annotated Bibliographyp. 325
Recent Advances in Tabu Searchp. 369
Lagrangean Tabu Searchp. 379
A GIDS Metaheuristic Approach to the Fleet Size and Mix Vehicle Routing Problemp. 399
Developments of Variable Neighborhood Searchp. 415
Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithmsp. 441
Ant Colony Optimization: An Overviewp. 469
Intensification Neighborhoods for Local Search Methodsp. 493
New Heuristics for the Euclidean Steiner Problem in R[superscript n]p. 509
Mathematical Analysis of Evolutionary Algorithmsp. 525
Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problemp. 557
Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problemp. 589
POPMUSIC - Partial Optimization Metheuristic under Special Intesification Conditionsp. 613
Subcost-Guided Simulated Annealingp. 631
A Pruning Pattern List Approach to the Permutation Flowshop Scheduling Problemp. 641
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780792375203
ISBN-10: 0792375203
Series: Operations Research/Computer Science Interfaces
Audience: General
Format: Hardcover
Language: English
Number Of Pages: 651
Published: 31st October 2001
Publisher: Springer
Country of Publication: US
Dimensions (cm): 24.59 x 15.7  x 3.23
Weight (kg): 0.82
Edition Type: Annotated

Earn 904 Qantas Points
on this Book

Popular Searches