Metaheuristics [electronic resource] / edited by Patrick Siarry.

Інтелектуальна відповідальність: Вид матеріалу: Серіальне виданняПублікація: Cham : Springer International Publishing : Imprint: Springer.Опис: online resourceISSN:
  • 2522-8994
Тематика(и): Додаткові фізичні формати: Printed version: : Немає назвиЕлектронне місцезнаходження та доступ: Зведення: In recent years, metaheuristics have become important tools for solving hard optimization problems encountered in industry, as well as in the theoretical field. Many different metaheuristics exist, and new ones are under constant development. Some of the most famous examples are evolutionary algorithms (EAs), Tabu search (TS), simulated annealing (SA), ant colony optimization (ACO), particle swarm optimization (PSO), greedy randomized adaptive search procedures (GRASP), and memetic algorithms. This journal brings together outstanding research and recent developments in the field of metaheuristics and their applications in the industrial world. Among the subjects to be considered are theoretical developments in metaheuristics such as EAs, TS, SA, ACO, PSO, GRASP, memetic algorithms, variable neighbourhood search, guided local search, scatter search, and path relinking; performance comparisons of metaheuristics; cooperative methods combining different types of approaches such as constraint programming and mathematical programming techniques; parallel and distributed metaheuristics for multiobjective optimization; adaptation of discrete metaheuristics to continuous optimization; dynamic optimization; software implementations; and real-life applications.
Тип одиниці: ЕЖурнал Списки з цим бібзаписом: Springer EJournals (till 2020.02 Network Access) | Springer EJournals till 2020.02 (Open Access + Network Access)
Мітки з цієї бібліотеки: Немає міток з цієї бібліотеки для цієї назви. Ввійдіть, щоб додавати мітки.
Оцінки зірочками
    Середня оцінка: 0.0 (0 голос.)
Немає реальних примірників для цього запису

In recent years, metaheuristics have become important tools for solving hard optimization problems encountered in industry, as well as in the theoretical field. Many different metaheuristics exist, and new ones are under constant development. Some of the most famous examples are evolutionary algorithms (EAs), Tabu search (TS), simulated annealing (SA), ant colony optimization (ACO), particle swarm optimization (PSO), greedy randomized adaptive search procedures (GRASP), and memetic algorithms. This journal brings together outstanding research and recent developments in the field of metaheuristics and their applications in the industrial world. Among the subjects to be considered are theoretical developments in metaheuristics such as EAs, TS, SA, ACO, PSO, GRASP, memetic algorithms, variable neighbourhood search, guided local search, scatter search, and path relinking; performance comparisons of metaheuristics; cooperative methods combining different types of approaches such as constraint programming and mathematical programming techniques; parallel and distributed metaheuristics for multiobjective optimization; adaptation of discrete metaheuristics to continuous optimization; dynamic optimization; software implementations; and real-life applications.

Немає коментарів для цієї одиниці.

для можливості публікувати коментарі.