## Meta-Heuristics: Theory and ApplicationsIbrahim H. Osman, James P. Kelly 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

MetaHeuristics An Overview | 1 |

A Parallel Genetic Algorithm for the Set Partitioning Problem | 23 |

Evolutionary Computation and Heuristics | 37 |

Gene Pool Recombination in Genetic Algorithms | 53 |

Genetic and Local Search Algorithms as Robust and Simple Optimization Tools | 63 |

Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree | 83 |

An Aggressive Search Procedure for the Bipartite Drawing Problem | 97 |

Guided Search for the Shortest Path on Transportation Networks | 115 |

Tabu Thresholding for the Frequency Assignment Problem | 343 |

A New Tabu Search Approach to the 01 Equicut Problem | 361 |

Simple Tabu Thresholding and the Pallet Loading Problem | 379 |

CRITICAL EVENT TABU SEARCH FOR MULTIDIMENSIONAL KNAPSACK PROBLEMS | 407 |

Solving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scaling | 429 |

Comparison of Heuristics for the 01 Multidimensional Knapsack Problem | 449 |

Probabilistic Move Selection in Tabu Search for ZeroOne Mixed Integer Programming Problems | 467 |

A StarShaped Diversification Approach in Tabu Search | 489 |

A Metaheuristic for the Timetabling Problem | 133 |

Complex Sequencing Problems and Local Search Heuristics | 151 |

Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties | 167 |

Heuristics for the Optimal Control of Thermal Energy Storage | 183 |

Exploiting Block Structure to Improve ResourceConstrained Project Schedules | 203 |

Combining the LargeStep Optimization with TabuSearch Application to The JobShop Scheduling Problem | 219 |

JobShop Scheduling by Simulated Annealing Combined with Deterministic Local Search | 237 |

Cybernetic Optimization by Simulated Annealing An Implementation of Parallel Processing Using Probabilistic Feedback Control | 249 |

A simulated annealing algorithm for the computation of marginal costs of telecommunication links | 265 |

Learning to Recognize UnPromising Simulated Annealing Runs Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing | 277 |

A Preliminary Investigation into the Performance of Heuristic Search Methods Applied to Compound Combinatorial Problems | 299 |

Tabu Search Combination and Integration | 319 |

Vector Quantization with the Reactive Tabu Search | 331 |

Communication Issues in Designing Cooperative MultiThread Parallel Searches | 503 |

A Study on Algorithms for Selecting r Best Elements from An Array | 523 |

A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem | 537 |

Chunking Applied to Reactive Tabu Search | 555 |

Tabu Search on the Geometric Traveling Salesman Problem | 571 |

Mixing Different Components of Metaheuristics | 589 |

A Probabilistic Analysis of Local Search | 605 |

The Clustered Traveling Salesman Problem A Genetic Approach | 619 |

A Tabu Search based Heuristic for Arc Routing with a Capacity Constraint and Time Deadline | 633 |

Supervision in the SelfOrganizing Feature Map Application to the Vehicle Routing Problem | 651 |

A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem | 661 |

Fast Local Search Algorithms for the Handicapped Persons Transportation Problem | 677 |

### Other editions - View all

### Common terms and phrases

applied average block branch and bound candidate list chunking colour combinatorial optimization computational results considered constraints convergence criterion crossover current solution defined distribution edges elements feasible solution Figure frequency genetic algorithm given global Glover graph Graph Coloring greedy heuristic implementation improving phase infeasible initial solution instances integer knapsack problem local optima local search memory metaheuristics minimal minimum mixed phase move mutation neighborhood node number of iterations objective function objective function value Operations Research optimal solution optimum Osman paper parallel parameter partition penalty performance population probabilistic random randomly restart samples scheduling problem search algorithm search methods search procedure search threads selection sequence shortest path simulated annealing solution space solutions obtained solving Step structure subsets Table tabu list tabu search tabu thresholding techniques temperature test problems tion transition traveling salesman problem variable vector Vehicle Routing Problem vertex vertices