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...

Popoln opis

Bibliografske podrobnosti

Glavni avtor:	PAN Han, YOU Xiaoming, LIU Sheng
Format:	Artigo
Jezik:	Chinês
Izdano:	Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press 2020-06-01
Serija:	Jisuanji kexue yu tansuo
Teme:	ant colony algorithm maximal spanning tree minimum spanning tree attraction factor traveling salesman problem (tsp)
Online dostop:	http://fcst.ceaj.org/CN/abstract/abstract2234.shtml
Oznake:	Označite Brez oznak, prvi označite!