- ホーム
- > 洋書
- > 英文書
- > Science / Mathematics
Full Description
This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASPand combinatorial optimization. For the practitioner who needs to solve combinatorial optimization problems, the book provides a chapter with four case studies and implementable templates for all algorithms covered in the text. This book, with its excellent overview of GRASP, will appeal to researchers and practitioners of combinatorial optimization who have a need to find optimal or near optimal solutions to hard combinatorial optimization problems.
Contents
Foreword.- Preface.- 1. Introduction.- 2. A short tour of combinatorial optimization and computational complexity.- 3. Solution construction and greedy algorithms.- 4. Local search.- 5. GRASP: The basic heuristic.- 6. Runtime distributions.- 7. GRASP: extended construction heuristics.- 8. Path-relinking.- 9. GRASP with Path-relinking.- 10. Parallel GRASP heuristics.- 11. GRASP for continuous optimization.- 12. Case studies.- References.- Index.
