Hybrid ant colony algorithm for traveling salesman problem*
Lan Huang, Chunguang Zhou, Kangping Wang · Progress in Natural Science Materials International · 2003
A hybrid approach based on ant colony algorithm for the traveling salesman problem is proposed, which is an improved algorithm characterized by adding a local search mechanism, a cross-removing strategy and candidate lists. Experimental results show that it is competitive in terms of solution quality and computation time.