![](images/graphics/blank.gif)
Using hyper populated ant colonies for solving the TSP
21
lượt xem 1
download
lượt xem 1
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
The paper discusses the application of hyper populated ant colonies to the well-known traveling salesman problem (TSP). The ant colony optimization (ACO) approach offers reasonably good quality solutions for the TSP, but it suffers from its inherent non-determinism and as a consequence the processing time is unpredictable. The paper tries to mitigate the problem by a substantial increase in the number of used ants.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD