Algorithm of the ant colony for one problem of placing with restrictions on capacities of manufacture

Abstract

A capacitated plant location problem is considered in the paper, and an ant colony algorithm is proposed for this problem. A new type of neighborhood is introduced, taking into account the problem specifics, which allows to improve the performance of local search algorithm. The computational results for the proposed algorithm are presented and discussed.