Local Search in Combinatorial Optimization (Wiley-Interscience Series in Discrete Mathematics and Optimization) - Hardcover

Hardcover

ISBN 10: 0471948225 ISBN 13: 9780471948223

Publisher: John Wiley & Sons Inc, 1997

Synopsis

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures and is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide applicability of its evolving techniques point to the rapidity with which the field is moving and presage the ever-increasing interaction between it and computer science. The Series provides a broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, mathematical programming and the analysis of algorithms, and including such topics as Ramsey theory, transversal theory, block designs, finite geometries, Polya theory, graph and matroid algorithms, network flows, polyhedral combinatorics and computational complexity. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record in this extraordinary development. Recent title in the Series: Theory and Algorithms for Linear Optimization: An Interior Point Approach C. Roos, T. Terlaky Delft University of Technology, The Netherlands and J.-Ph. Vial University of Geneva, Switzerland Linear Optimization (LO) is one of the most widely taught and fast developing techniques in mathematics, with applications in many areas of science, commerce and industry. The dramatically increased interest in the subject is due mainly to advances in computer technology and to the development of Interior Point Methods (IPM) for LO. This book provides a unified presentation of the field by way of an interior point approach to both the theory of LO and algorithms for LO (design, covergence, complexity and asymptotic behaviour). A common thread throughout the book is the role of strictly complementary solutions, which play a crucial role in the interior point approach and distinguishes the new approach from the classical Simplex-based approach. The approach to LO in this book is new in many aspects. In particular the IPM based development of duality theory is surprisingly elegant. The algorithmic parts of the book contain a complete discussion of many algorithmic variants, including predictor-corrector methods, partial updating, higher order methods and sensitivity and parametric analysis. The comprehensive and up-to-date coverage of the subject, together with the clarity of presentation, ensures that this book will be an invaluable resource for researchers and professionals who wish to develop their understanding of LOs and IPMs . Numerous exercises are provided to help consolidate understanding of the material and more than 45 figures are included to illustrate the characteristics of the algorithms. A general understanding of linear algebra and calculus is assumed and the preliminary chapters provide a self-contained introduction for readers who are unfamiliar with LO methods. These chapters will also be of interest for readers who wish to take a fresh look at the topics. 1997

About this title

From the Publisher:

In recent years major methodological progress has been made in the design and analysis of local search algorithms in combinatorial optimization. Until now the results have been scattered throughout the available literature. This is the first book to collect results, consolidate the insights and stimulate further progress in the field. Chapters on simulated annealing, tabu search, genetic algorithms and neural networks, applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design.

From the Inside Flap:

Local Search in Combinatorial Optimization Edited by Emile H. L. Aarts Philips Research Laboratories, Eindhoven and Eindhoven University of Technology, Eindhoven Jan Karel Lenstra Eindhoven University of Technology, Eindhoven and CWI Amsterdam In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. 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 a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever increasing attention. The contributions to this book cover local search and its variants from both a theoretical and practical point of view, each with a chapter written by leading authorities on that particular aspect. Chapters 1 to 7 deal with the theory of local search and describe the principal search strategies such as simulated annealing, tabu search, genetic algorithms and neural networks. The remaining chapters present a wealth of results on applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design. This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science. Contents Preface Contributors I Introduction Emile H. L. Aarts, Jan Karel Lenstra 2 Computational complexity Mihalis Yannakakis 3 Local improvement on discrete structures Craig A. Tovey 4 Simulated annealing Emile H. L. Aarts, Jan H. M. Korst, Peter J. M. van Laarhoven 5 Tabu search Alain Hertz, Eric Taillard, Dominique de Werra 6 Genetic algorithms Heinz Mühlenbein 7 Artificial neural networks Carsten Peterson, Bo Söderberg 8 The travelling salesman problem: a case study David S. Johnson, Lyle A. McGeoch 9 Vehicle routing: modern heuristics Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin 10 Vehicle routing: handling edge exchanges Gerard A. P. Kindervater, Martin W. P. Savelsbergh 11 Machine scheduling Edward J. Anderson, Celia A. Glass, Chris N. Potts 12 VLSI layout synthesis Emile H. L. Aarts, Peter J. M. van Laarhoven, C. L. Liu, Peichen Pan 13 Code design liro S. Honkala, Patric R. J. Östergård Bibliography Author index Subject index

About this edition

• Publisher: John Wiley & Sons Inc
• Publication date: 1997
• ISBN 10: 0471948225
• ISBN 13: 9780471948223
• Binding: Hardcover
• Edition number: 1
• Number of pages: 522
• Editor: Aarts Emile, Lenstra J. K.