A New General Purpose Binary-Coded Ant Algorithm

In this paper a new general purpose ant algorithm is presented. Proposed binarycoded ant algorithm (BCAA) allocates some bits for each variable and one node for each bit. lfthe ant passes through a node, the value of the corresponding bit is one, otherwise zero. By decoding these bits, we obtain variables values. To determine best pheromone updating method, four pheromone updating methods are tested. Performance of the new algorithm is evaluated on two benchmark problems. The proposed BCAA is very similar to a binary genetic algorithm (GA), thus can be used on all optimization problems on which a binary GA can be used.

کلیدواژه ها:

Binary-coded ant algorithm ، optimization