Optimisation problem solving by swarm and evolutionary algorithms
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Была изучена общая постановка задач двухуровневой оптимизации, а также двухуровневая задача оптимизации топологии сети. Проведен обзор существующих методов оптимизации с применением роевого интеллекта и эволюционных подходов. Осуществлена апробацию инструментов роевого интеллекта для решения двухуровневых задач оптимизации на тестовых примерах. Проведено сравнение полученных результатов с эволюционными процедурами решения двухуровневых задач оптимизации на тестовых примерах (алгоритмы BLEAQ и BPSOQ). Адаптирован наиболее эффективный алгоритм к решению задач двухуровневой оптимизации на транспортных сетях (алгоритм PSODP–LeBlanc с динамическим коэффициентом инерции). Реализованы эффективные процедуры решения задачи оптимизации топологии транспортной сети с применением построенных эвристик.
General formulation of bilevel optimization problems was studied, as well as the bilevel problem of network topology optimizing. A review of existing optimization methods using swarm intelligence and evolutionary approaches has been carried out. Approbation of swarm intelligence tools for solving bilevel optimization problems on test examples was carried out. The obtained results are compared with evolutionary procedures for solving bilevel optimization problems on test examples (BLEAQ and BPSOQ algorithms). The most efficient algorithm is adapted for solving problems of bilevel optimization on transport networks (PSODP–LeBlanc algorithm with dynamic inertia coefficient). Efficient procedures for solving the problem of transport network topology optimization using the constructed heuristics are implemented.
General formulation of bilevel optimization problems was studied, as well as the bilevel problem of network topology optimizing. A review of existing optimization methods using swarm intelligence and evolutionary approaches has been carried out. Approbation of swarm intelligence tools for solving bilevel optimization problems on test examples was carried out. The obtained results are compared with evolutionary procedures for solving bilevel optimization problems on test examples (BLEAQ and BPSOQ algorithms). The most efficient algorithm is adapted for solving problems of bilevel optimization on transport networks (PSODP–LeBlanc algorithm with dynamic inertia coefficient). Efficient procedures for solving the problem of transport network topology optimization using the constructed heuristics are implemented.