Author:
Chen Xiaofeng,Tan Zhenhua,Yang Guangming,Xiangshuai Yan
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Yang, W.-B., Zhao, Y.-W.: Improved simulated annealing algorithm for TSP. Computer Engineering and Applications 46 (15), 34–36 (2010)
2. Lin, W., Delgado-Frias, J.G., Gause, D.C., et al.: Hybrid newton-raphson genetic algorithm for the traveling salesman problem. Cybernetics and Systems 26(4), 387–412 (1995)
3. Tan, K.C., Tang, H., Ge, S.S.: On parameter settings of Hopfield networks applied to traveling salesman problems. IEEE Transactions on Circuits and Systems 52(5), 994–1002 (2005)
4. Shan, L., Qiang, H., Li, J., Wang, Z.-Q.: Chaotic optimization algorithm based on Tent map. Control and Decision 20(2), 179–182 (2005)
5. Yuan, Z., Yang, L., Wu, Y.: Chaitic patticle sarm optimization algorithm for traveling salesman problem. In: Proceedings of the IEEE International Conference on Automation and Logistics, vol. 1, pp. 121–124 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献