26 citations · 32 across the 10 of their papers we have counts for
5 papers · 1 filter
Herder Ants: Ant Colony Optimization with Aphids for Discrete Event-Triggered Dynamic Optimization Problems
Jonas Skackauskas, Tatiana Kalganova
Currently available dynamic optimization strategies for Ant Colony Optimization (ACO) algorithm offer a trade-off of slower algorithm convergence or significant penalty to solution…
Hybrid 2-stage Imperialist Competitive Algorithm with Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problem
Ivars Dzalbs, Tatiana Kalganova
The Multi-Depot Vehicle Routing Problem (MDVRP) is a real-world model of the simplistic Vehicle Routing Problem (VRP) that considers how to satisfy multiple customer demands from n…
Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem
Ivars Dzalbs, Tatiana Kalganova, Ian Dear
The multidimensional knapsack problem is a well-known constrained optimization problem with many real-world engineering applications. In order to solve this NP-hard problem, a new…
Dynamic Impact for Ant Colony Optimization algorithm
Jonas Skackauskas, Tatiana Kalganova, Ian Dear +1
This paper proposes an extension method for Ant Colony Optimization (ACO) algorithm called Dynamic Impact. Dynamic Impact is designed to solve challenging optimization problems tha…
Accelerating supply chains with Ant Colony Optimization across range of hardware solutions
Ivars Dzalbs, Tatiana Kalganova
Ant Colony algorithm has been applied to various optimization problems, however most of the previous work on scaling and parallelism focuses on Travelling Salesman Problems (TSPs).…