Artificial Fish Algorithm to Solve Traveling Salesman Problem

Abstract:

Article Preview

TSP has been studied in many methods by various algorithms. with the increase of the TSP scale, there are some problems appear in the related solution ,such as solving the optimal solution and so on. With the increasing calculation nodes, the convergence degree and computing difficulty of TSP will increase enormously. Artificial fish is an optimize algorithm based on biology model putting forward at present. Proposed a solution for TSP based on the Artificial fish algorithm, describes the mathematic model of TSP, and Expounds the steps of the algorithm in details. by testing the algorithm, we know that, the algorithm can obtain the best solution, in global search, convergence rate,,but the robustness has to be improved in the future.

Info:

Periodical:

Edited by:

Dongye Sun, Wen-Pei Sung and Ran Chen

Pages:

4410-4414

DOI:

10.4028/www.scientific.net/AMM.121-126.4410

Citation:

J. P. Wang et al., "Artificial Fish Algorithm to Solve Traveling Salesman Problem", Applied Mechanics and Materials, Vols. 121-126, pp. 4410-4414, 2012

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.