Essays And Surveys In Metaheuristics Book

	Preface
1	Selected Topics in Simulated Annealing	1
2	Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs	39
3	A GRASP for Job Shop Scheduling	59
4	A Reactive GRASP for Transmission Network Expansion Planning	81
5	Tabu Search for Two-Dimensional Irregular Cutting	101
6	A Study of Global Convexity for a Multiple Objective Travelling Salesman Problem	129
7	A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem	151
8	A Simulated Annealing Approach for Minimum Cost Isolated Failure Immune Networks	169
9	A GRASP Interactive Approach to the Vehicle Routing Problem with Backhauls	185
10	Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem	201
11	A Scatter Search Algorithm for the Maximum Clique Problem	227
12	The Noising Methods: A Survey	245
13	Strategies for the Parallel Implementation of Metaheuristics	263
14	Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems	309
15	GRASP: An Annotated Bibliography	325
16	Recent Advances in Tabu Search	369
17	Lagrangean Tabu Search	379
18	A GIDS Metaheuristic Approach to the Fleet Size and Mix Vehicle Routing Problem	399
19	Developments of Variable Neighborhood Search	415
20	Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms	441
21	Ant Colony Optimization: An Overview	469
22	Intensification Neighborhoods for Local Search Methods	493
23	New Heuristics for the Euclidean Steiner Problem in R[superscript n]	509
24	Mathematical Analysis of Evolutionary Algorithms	525
25	Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem	557
26	Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem	589
27	POPMUSIC - Partial Optimization Metheuristic under Special Intesification Conditions	613
28	Subcost-Guided Simulated Annealing	631
29	A Pruning Pattern List Approach to the Permutation Flowshop Scheduling Problem	641