# Электронная книга: Christine Solnon «Ant Colony Optimization and Constraint Programming»

Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search approaches and metaheuristics, and shows how they can be integrated within constraint programming languages. The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems. The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems. Издательство: "John Wiley&Sons Limited"
ISBN: 9781118619667 электронная книга Купить за 12483.68 руб и скачать на Litres |

### Look at other dictionaries:

**Optimization (mathematics)**— In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… … Wikipedia**Mathematical optimization**— For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia**List of computer science conferences**— This is a list of academic conferences in computer science. Most of these academic conferences are annual or bi annual events.The order with which the conferences are listed in their respective fields corresponds to a rough and non authoritative… … Wikipedia**Travelling salesman problem**— The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia**Metaheuristic**— In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia**Genetic algorithm**— A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia**Sequenzierung (Produktion)**— Als Sequenzierung oder Sequenzplanung (im wissenschaftlichen Bereich auch unter dem englischen Begriff sequencing and scheduling geläufig) wird in der Produktionsplanung die Bildung einer Fertigungsreihenfolge von Produktionsaufträgen bezeichnet … Deutsch Wikipedia