Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest ...
Aug 16, 2024 · The idea of semi-random start is better management of the ants. This new technique is tested on Multiple Knapsack Problem (MKP). Benchmark ...
On this paper semi-random start is applied. A new kind of estimation of start nodes of the ants is made and several start strategies are prepared and combined.
On this paper semi-random start is applied. A new kind of estimation of start nodes of the ants is made and several start strategies are prepared and combined.
sign in. Inproceedings,. ACO with semi-random start applied on MKP. S. Fidanova, P. Marinov, and K. Atanassov. IMCSIT, page 887-891. IEEE, (2010 ). 1. 1. Meta ...
Stefka Fidanova, Pencho Marinov, Krassimir T. Atanassov: ACO with semi-random start applied on MKP. IMCSIT 2010: 887-891.
On this paper is proposed an ant algorithm with semi-random start. Several start strategies are prepared at the basis of the start nodes estimation. There ...
The idea of semi-random start is related to a better management of the ants. This new technique is tested on the Multiple Knapsack Problem (MKP). A Comparison ...
The Multi- ple Knapsack Problem (MKP) is used as a test problem. The goal is to analyze the dependence between start strategies and algorithm performance, and ...
The idea of semi-random start is related to a better management of the ants. This new technique is tested on the Multiple Knapsack Problem (MKP). A Comparison ...