Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Ibaraki T., Nonobe K., Yagiura M. — Metaheuristics: Progress as Real Problem Solvers
Ibaraki T., Nonobe K., Yagiura M. — Metaheuristics: Progress as Real Problem Solvers

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Metaheuristics: Progress as Real Problem Solvers

Авторы: Ibaraki T., Nonobe K., Yagiura M.

Аннотация:

Our globalized world brings us increasing complexity and many computationally hard problems. Metaheuristics are mathematical optimization methods that have become a powerful answer to many of these difficult problems. As a growing set of robust methods, Metaheuristics is producing effective algorithms that compute approximate solutions of high quality in realistic computational time.

METAHEURISTICS: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.

The volume's objective is to consolidate works in operations research, management science, artificial intelligence, computer science, and related fields to further the understanding of basic principles and the developing domain of Metaheuristics. This includes genetic algorithms, simulated annealing, tabu search, evolutionary computation, greedy randomized adaptive search procedures (GRASP), scatter search, ant system, variable neighborhood search, guided local search, iterated local search, noising methods, threshold accepting, memetic algorithms, neural networks, and other hybrid and/or variant approaches for solving hard combinatorial problems.



Язык: en

Рубрика: Computer science/

Статус предметного указателя: Неизвестно

ed2k: ed2k stats

Год издания: 2005

Количество страниц: 419

Добавлена в каталог: 28.04.2014

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте