Ebook: Meta-Heuristics: Theory and Applications

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.

---

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.

---

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.
Content:
Front Matter....Pages i-x
Meta-Heuristics: An Overview....Pages 1-21
A Parallel Genetic Algorithm for the Set Partitioning Problem....Pages 23-35
Evolutionary Computation and Heuristics....Pages 37-52
Gene Pool Recombination in Genetic Algorithms....Pages 53-62
Genetic and Local Search Algorithms as Robust and Simple Optimization Tools....Pages 63-82
Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree....Pages 83-96
An Aggressive Search Procedure for the Bipartite Drawing Problem....Pages 97-113
Guided Search for the Shortest Path on Transportation Networks....Pages 115-131
A Metaheuristic for the Timetabling Problem.....Pages 133-149
Complex Sequencing Problems and Local Search Heuristics....Pages 151-166
Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties....Pages 167-182
Heuristics for the Optimal Control of Thermal Energy Storage....Pages 183-201
Exploiting Block Structure to Improve Resource-Constrained Project Schedules....Pages 203-217
Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem....Pages 219-236
Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search....Pages 237-248
Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control....Pages 249-264
A simulated annealing algorithm for the computation of marginal costs of telecommunication links....Pages 265-275
Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing....Pages 277-297
A Preliminary Investigation into the Performance of Heuristic Search Methods Applied to Compound Combinatorial Problems....Pages 299-317
Tabu Search, Combination and Integration....Pages 319-330
Vector Quantization with the Reactive Tabu Search....Pages 331-342
Tabu Thresholding for the Frequency Assignment Problem....Pages 343-359
A New Tabu Search Approach to the 0–1 Equicut Problem....Pages 361-377
Simple Tabu Thresholding and the Pallet Loading Problem.....Pages 379-405
Critical Event Tabu Search for Multidimensional Knapsack Problems....Pages 407-427
Solving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scaling....Pages 429-448
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem....Pages 449-465
Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems....Pages 467-487
A Star-Shaped Diversification Approach in Tabu Search....Pages 489-502
Communication Issues in Designing Cooperative Multi-Thread Parallel Searches....Pages 503-522
A Study on Algorithms for Selecting r Best Elements from An Array....Pages 523-535
A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem....Pages 537-553
Chunking Applied to Reactive Tabu Search....Pages 555-569
Tabu Search on the Geometric Traveling Salesman Problem....Pages 571-587
Mixing Different Components of Metaheuristics....Pages 589-603
A Probabilistic Analysis of Local Search....Pages 605-618
The Clustered Traveling Salesman Problem: A Genetic Approach....Pages 619-631
A Tabu Search based Heuristic for Arc Routing with a Capacity Constraint and Time Deadline....Pages 633-649
Supervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problem....Pages 651-660
A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem....Pages 661-675
Fast Local Search Algorithms for the Handicapped Persons Transportation Problem....Pages 677-690

---

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.
Content:
Front Matter....Pages i-x
Meta-Heuristics: An Overview....Pages 1-21
A Parallel Genetic Algorithm for the Set Partitioning Problem....Pages 23-35
Evolutionary Computation and Heuristics....Pages 37-52
Gene Pool Recombination in Genetic Algorithms....Pages 53-62
Genetic and Local Search Algorithms as Robust and Simple Optimization Tools....Pages 63-82
Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree....Pages 83-96
An Aggressive Search Procedure for the Bipartite Drawing Problem....Pages 97-113
Guided Search for the Shortest Path on Transportation Networks....Pages 115-131
A Metaheuristic for the Timetabling Problem.....Pages 133-149
Complex Sequencing Problems and Local Search Heuristics....Pages 151-166
Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties....Pages 167-182
Heuristics for the Optimal Control of Thermal Energy Storage....Pages 183-201
Exploiting Block Structure to Improve Resource-Constrained Project Schedules....Pages 203-217
Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem....Pages 219-236
Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search....Pages 237-248
Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control....Pages 249-264
A simulated annealing algorithm for the computation of marginal costs of telecommunication links....Pages 265-275
Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing....Pages 277-297
A Preliminary Investigation into the Performance of Heuristic Search Methods Applied to Compound Combinatorial Problems....Pages 299-317
Tabu Search, Combination and Integration....Pages 319-330
Vector Quantization with the Reactive Tabu Search....Pages 331-342
Tabu Thresholding for the Frequency Assignment Problem....Pages 343-359
A New Tabu Search Approach to the 0–1 Equicut Problem....Pages 361-377
Simple Tabu Thresholding and the Pallet Loading Problem.....Pages 379-405
Critical Event Tabu Search for Multidimensional Knapsack Problems....Pages 407-427
Solving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scaling....Pages 429-448
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem....Pages 449-465
Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems....Pages 467-487
A Star-Shaped Diversification Approach in Tabu Search....Pages 489-502
Communication Issues in Designing Cooperative Multi-Thread Parallel Searches....Pages 503-522
A Study on Algorithms for Selecting r Best Elements from An Array....Pages 523-535
A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem....Pages 537-553
Chunking Applied to Reactive Tabu Search....Pages 555-569
Tabu Search on the Geometric Traveling Salesman Problem....Pages 571-587
Mixing Different Components of Metaheuristics....Pages 589-603
A Probabilistic Analysis of Local Search....Pages 605-618
The Clustered Traveling Salesman Problem: A Genetic Approach....Pages 619-631
A Tabu Search based Heuristic for Arc Routing with a Capacity Constraint and Time Deadline....Pages 633-649
Supervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problem....Pages 651-660
A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem....Pages 661-675
Fast Local Search Algorithms for the Handicapped Persons Transportation Problem....Pages 677-690
....