Author:
Chen Xiaofeng,Tan Zhenhua,Yang Guangming,Cheng Wei
Publisher
Springer Berlin Heidelberg
Reference11 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. Stutzle, T., Hhoos, H.: The MAX-MIN ant system and local search for the traveling salesman problem. In: Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 309–314. Indianapolis, USA (1997)
5. Colorni, A., Dor Igo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proc. Europ. Conf. Artif. Life, p. 1342142. Elsevier Publishing, Paris (1991)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献