Электронная книга: Nacima Labadie «Metaheuristics for Vehicle Routing Problems»
This book is dedicated to metaheuristics as applied to vehicle routing problems. Several implementations are given as illustrative examples, along with applications to several typical vehicle routing problems. As a first step, a general presentation intends to make the reader more familiar with the related field of logistics and combinatorial optimization. This preamble is completed with a description of significant heuristic methods classically used to provide feasible solutions quickly, and local improvement moves widely used to search for enhanced solutions. The overview of these fundamentals allows appreciating the core of the work devoted to an analysis of metaheuristic methods for vehicle routing problems. Those methods are exposed according to their feature of working either on a sequence of single solutions, or on a set of solutions, or even by hybridizing metaheuristic approaches with others kind of methods. Издательство: "John Wiley&Sons Limited"
ISBN: 9781119136774 электронная книга Купить за 11393.47 руб и скачать на Litres |
Другие книги схожей тематики:
Автор | Книга | Описание | Год | Цена | Тип книги |
---|---|---|---|---|---|
Patrick Siarry | Metaheuristics for Production Scheduling | This book describes the potentialities of metaheuristics for solving production scheduling problems and the relationship between these two fields. For the past several years, there has been an… — John Wiley&Sons Limited, электронная книга Подробнее... | 16370.06 | электронная книга |
См. также в других словарях:
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Patrick Prosser — (* 8. September 1952 in Glasgow) ist Informatiker an der Universität Glasgow. Sein Hauptinteressengebiet ist Constraintprogrammierung und die Anwendung von Constraintmethoden in anderen, verwandten Forschungsgebieten. Sein bedeutendster… … Deutsch Wikipedia
Hyper-heuristic — A hyper heuristic is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting, combining, generating or adapting several simpler heuristics (or components of such… … Wikipedia
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Delayed column-generation — is an efficient algorithm for solving larger linear programs. The overarching idea is that many linear programs are too large to consider all the variables explicitly. Since most of the variables will be non basic and assume a value of zero in… … Wikipedia