Study on the TSP Problem Based on SA Algorithm

Article Preview

Abstract:

This paper describes the simulated annealing algorithm and TSP problems, analyze the applicability of simulated annealing algorithm to solve TSP problem, and takes China urban travel questions as an examples to vertified the validity of the model, the results showed that when the number of iterations reached at 4000,it will obtain the optimal solution.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1316-1319

Citation:

Online since:

November 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Xin zhenming. The improved simulated annealing algorithm research and application based on TSP[D]. Northeast Normal University, (2010).

Google Scholar

[2] Huang lishao. Research on TSP based on simulated annealing algorithm[J]. Computer and Telecommunication, 2012(04). 36-38.

Google Scholar

[3] I. Kamwa and K. Srinivasan, A Kalman filter-based technique for combined digital estimation of voltage flicker and phasor in power distribution systems, ETEP, vol. 3, no. 2, pp.131-142 (1993).

DOI: 10.1002/etep.4450030204

Google Scholar

[4] M. T. Chen, Digital algorithms for measurement of voltage flicker, Proc. Inst. Elec. Eng. Gen. Transm. Distrib., vol. 144, no. 2, pp.175-180 (1997).

DOI: 10.1049/ip-gtd:19970683

Google Scholar

[5] S. Nuccio, A digital instrument for measurement of voltage flicker, Proc. IEEE IMTC, pp.281-284 (1997).

Google Scholar