J4
Previous Articles Next Articles
HUANG Lan , WANG Kang-ping , ZHOU Chun-guang , YUAN Yuan , PANG Wei
Received:
Revised:
Online:
Contact:
Abstract: In the present paper the authors introduce an ant algorithm , a distributed algorithm for the solution of combinatorial optimization problems which has been inspired by the observation of real colonies of ants. Then the authors apply a hybrid approach of ant algorithm with 3-opt and cross-removing to the traveling salesman problem (TSP). The results show that it is able to find good solutions quickly.
Key words: ant algorithm, traveling salesman problem, combinatorial optimization
CLC Number:
HUANG Lan , WANG Kang-ping , ZHOU Chun-guang , YUAN Yuan , PANG Wei. Hybrid Approach Based on Ant Algorithm for Solving Traveling Salesman Problem[J].J4, 2002, 40(04): 369-373.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://xuebao.jlu.edu.cn/lxb/EN/
http://xuebao.jlu.edu.cn/lxb/EN/Y2002/V40/I04/369
Cited