Abstract:
We study the ant colony method developed to solve the traveling salesman problem. We consider the possibility to apply the ant colony method to other graph-based problems: to the problem of collecting resources under various constraints and conditions and to the routing problem for several vehicles with the possibility to choose the place where these vehicles are located. We develop an algorithm that implements this method. We give an estimate of the algorithm's efficiency for various problems. The algorithms has proven to converge quickly, and the resulting solution is close to the optimal. This method can be recommended for solving most graph-based problems.
Fulltext:
PDF file (2292 kB)
