Local Search in Combinatorial OptimizationEmile H. L. Aarts, Jan Karel Lenstra In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. |
Contents
Introduction | 1 |
Computational complexity | 19 |
Local improvement on discrete structures | 57 |
Simulated annealing | 91 |
Tabu search | 121 |
Genetic algorithms | 137 |
Artificial neural networks | 173 |
The traveling salesman problem a case study | 215 |
Vehicle routing handling edge exchanges | 337 |
Machine scheduling | 361 |
VLSI layout synthesis | 415 |
Code design | 441 |
457 | |
495 | |
507 | |
Vehicle routing modern heuristics | 311 |