Local Search in Combinatorial Optimization

Front Cover
Princeton University Press, 1997 - Computers - 512 pages
1 Review

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.

In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergċrd.

 

What people are saying - Write a review

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

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
Bibliography
457
Author index
495
Subject index
507
Copyright

Vehicle routing modern heuristics
311

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

About the author (1997)

Emile Aarts is Vice-President and Scientific Program Director of the Philips Research Laboratories, Eindhoven, and a Professor of Computer Science at Eindhoven University of Technology. Jan Karel Lenstra is the John P. Hunter Chair and Professor of Industrial and Systems Engineering at the Georgia Institute of Technology.

Bibliographic information