Double-Type Ant Colony Algorithm Considering Dynamic Guidance and Neighborhood Interaction
When solving traveling salesman problem (TSP), the ant colony algorithm is easy to fall into local optimum and convergence speed is slow, a double-type ant colony algorithm considering dynamic guidance and neighborhood interaction is proposed. Firstly, the algorithm combines the dynamic guidance str...
Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Chinês |
| Baskı/Yayın Bilgisi: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2020-06-01
|
| Seri Bilgileri: | Jisuanji kexue yu tansuo |
| Konular: | |
| Online Erişim: | http://fcst.ceaj.org/CN/abstract/abstract2234.shtml |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|