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

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

blank
blank
blank
Красота
blank
Glover F.W., Kochenberger G.A. (eds) — Handbook of Metaheuristics
Glover F.W., Kochenberger  G.A. (eds) — Handbook of Metaheuristics

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

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

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



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


Название: Handbook of Metaheuristics

Авторы: Glover F.W., Kochenberger G.A. (eds)

Аннотация:

The Handbook of Metaheuristics provides both the research and practitioner communities with a comprehensive coverage of the metaheuristic methodologies that have proven to be successful in a wide variety of real-world problem settings. Moreover, it is these metaheuristic strategies that hold particular promise for success in the future. The various chapters serve as stand alone presentations giving both the necessary background underpinnings as well as practical guides for implementation. In most settings a problem solver has an option as to which metaheuristic approach should be adopted for the problem at hand. Alternative methodologies typically exist that could be employed to produce high quality solutions. Often it becomes a matter of choosing one of several approaches that could be adopted. The very nature of metaheuristics invites an analyst to modify basic methods in response to problem characteristics, past experiences, and personal preferences. The chapters in this handbook are designed to facilitate this as well. This Handbook consists of 19 chapters. Topics covered include Scatter Search, Tabu Search, Genetic Algorithms, Genetic Programming, Memetic Algorithms, Variable Neighborhood Search, Guided Local Search, GRASP, Ant Colony Optimization, Simulated Annealing, Iterated Local Search, Multi-Start Methods, Constraint Programming, Constraint Satisfaction, Neural Network Methods for Optimization, Hyper-Heuristics, Parallel Strategies for Metaheuristics, Metaheuristic Class Libraries, and A-Teams. This family of metaheuristic chapters provides a state-of-the-art, comprehensive coverage of the major topics and methodologies of modern metaheuristics.


Язык: en

Рубрика: Математика/Оптимизация и управление/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Acceptance Criterion      332 479
Ant colony optimization      251
Arc Routing Problem      18
Aspiration criteria      44
Asychronous Teams      537
Bin packing problem      460
Bipartite Drawing Problem      8
Candidate list      45 221 275 376
Capacitated Plant Location Problem      38
Constraint programming      151 369
Constraint satisfaction      405
Continuous Optimization      167
Cooling schedule      303
Crossover      58 480
Diversification      46
EasyLocal      520
Ejection Chains      398
Elastic net      439 448
Frequency assignment problem      209
Generalized assignment problem      265
Generating Diverse MIP Solutions      26
Genetic algorithm      55 189 301 481 488
Genetic programming      83
Global optimization      337
Graph coloring      9
Graphs and Networks      159
GRASP      151 219 358
Guided Local Search      186
HotFrame      518 522
Hyper-heuristics      457
Intensification      45
iOpt      520
Iterated Local Search      321 524
Job shop scheduling      17
Knapsack problem      72
Linear ordering problem      7 363
Location and Clustering Problems      155
MAX-CUT      161
MAX-SAT      191 344
Maximum clique      12 160
Memetic algorithm      107
Metaheuristic Class Libraries      515
Multi-Start Methods      355
Multicommodity Network Design      11
Mutation      58 70 480
Neighborhood Structure      41
NeighborSearcher      520
Neural networks      429
Noising Methods      300
Parallel Strategies      475
Path Relinking      5 27 231 359
Permutation Problems      74 329
Propagation      382 406
Proximate Optimality Principle      231
Quadratic assignment problem      156 204 334
Repair Methods      410
Resource Constrained Project Scheduling      21
SAT      191
Scatter search      3
Scheduling problems      164 341
Search space      41
Set covering problem      266
Simulated annealing      287 482 492
Synthesis of Antennas      94
Synthesis of controllers      91
Synthesis of Metabolic Pathways      95
Tabu search      37 40 150 189 301 482 496 525
Templar      519
Tournament selection      67
Traveling salesman problem      152 190 202 253 334 339 433
Variable Neighborhood Search      145
Vehicle routing problem      38 152 192
Workforce Scheduling      206
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте