Constraint-Based Local Search

Pascal Van Hentenryck, Laurent Michel

472 pages, parution le 23/11/2005

Ajouter à une liste

Indisponible

Résumé

The ubiquity of combinatorial optimization problems in our society is illustrated by the novel application areas for optimization technology, which range from supply chain management to sports tournament scheduling. Over the last two decades, constraint programming has emerged as a fundamental methodology to solve a variety of combinatorial problems, and rich constraint programming languages have been developed for expressing and combining constraints and specifying search procedures at a high level of abstraction. Local search approaches to combinatorial optimization are able to isolate optimal or near-optimal solutions within reasonable time constraints.

This book introduces a method for solving combinatorial optimization problems that combines constraint programming and local search, using constraints to describe and control local search, and a programming language, COMET, that supports both modeling and search abstractions in the spirit of constraint programming.

After an overview of local search including neighborhoods, heuristics, and metaheuristics, the book presents the architecture and modeling and search components of constraint-based local search and describes how constraint-based local search is supported in COMET. The book describes a variety of applications, arranged by meta-heuristics. It presents scheduling applications, along with the background necessary to understand these challenging problems. The book also includes a number of satisfiability problems, illustrating the ability of constraint-based local search approaches to cope with both satisfiability and optimization problems in a uniform fashion.

Pascal Van Hentenryck is Professor in the Department of Computer Science at Brown University. He is the author or editor of several previous MIT Press books, including Principles and Practice of Constraint Programming (1995).

L'auteur - Pascal Van Hentenryck

Pascal Van Hentenryck is Professor in the Department of Computer Science at Brown University. He is the author or editor of several MIT Press books.

L'auteur - Laurent Michel

Laurent Michel is Assistant Professor in the Department of Computer Science and Engineering at the University of Connecticut.

Sommaire

Local Search
- Neighborhood Search
- Heuristics and Mathematics
Constraint-Based Local Search
- Constraint-Based Local Search
- Modeling
- Searching
Comet
- Invariants
- Differentiable Objects
- Control
- First-Order Control
Applications
- Tabu Search
- Variable Neighborhood Search
- Simulated Annealing
- Guided Local Search
- Hybrid Evolutionary Search
- Domain-Independent Local Search
- Ant Colony Optimization
Scheduling
- Jobshop Scheduling
- Scheduling Abstractions
- Minimizing Total Tardiness in a Jobshop
- Minimizing Makespan in a Jobshop
- Minimizing Makespan in a Jobshop Again
- Cumulative Scheduling

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	The MIT Press
Auteur(s)	Pascal Van Hentenryck, Laurent Michel
Parution	23/11/2005
Nb. de pages	472
Format	21 x 23,5
Couverture	Relié
Poids	1125g
Intérieur	Noir et Blanc
EAN13	9780262220774
ISBN13	978-0-262-22077-4