Mauricio G.C. Resende; J. Pinho de Sousa Metaheuristics 9781441954039

Варианты приобретения

Цена: 37594.00р.
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Америка: Есть
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Mauricio G.C. Resende; J. Pinho de Sousa
Название: Metaheuristics
ISBN: 9781441954039
Издательство: Springer
Классификация:

Оптимизация

Прикладная математика

Математическая теория вычислений

Искусственный интеллект

ISBN-10: 1441954031
Обложка/Формат: Paperback
Страницы: 719
Вес: 1.02 кг.
Дата издания: 06.12.2010
Серия: Applied Optimization
Язык: English
Размер: 234 x 156 x 37
Основная тема: Computer Science
Подзаголовок: Computer Decision-Making
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Combinatorial optimization is the process of finding the best, or optimal, so- lution for problems with a discrete set of feasible solutions. Applications arise in numerous settings involving operations management and logistics, such as routing, scheduling, packing, inventory and production management, lo- cation, logic, and assignment of resources. The economic impact of combi- natorial optimization is profound, affecting sectors as diverse as transporta- tion (airlines, trucking, rail, and shipping), forestry, manufacturing, logistics, aerospace, energy (electrical power, petroleum, and natural gas), telecommu- nications, biotechnology, financial services, and agriculture. While much progress has been made in finding exact (provably optimal) so- lutions to some combinatorial optimization problems, using techniques such as dynamic programming, cutting planes, and branch and cut methods, many hard combinatorial problems are still not solved exactly and require good heuristic methods. Moreover, reaching optimal solutions is in many cases meaningless, as in practice we are often dealing with models that are rough simplifications of reality. The aim of heuristic methods for combinatorial op- timization is to quickly produce good-quality solutions, without necessarily providing any guarantee of solution quality. Metaheuristics are high level procedures that coordinate simple heuristics, such as local search, to find solu- tions that are of better quality than those found by the simple heuristics alone: Modem metaheuristics include simulated annealing, genetic algorithms, tabu search, GRASP, scatter search, ant colony optimization, variable neighborhood search, and their hybrids.

Metaheuristics, Mauricio G.C. Resende; J. Pinho de Sousa