Author:
Wang Feipeng,Peng Hu,Deng Changshou,Tan Xujie,Zheng Likun
Reference16 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
2. Colorni, A., Dorigo, M.: Heuristics from nature for hard combinatorial optimization problems. Int. Trans. Oper. Res. 3(1), 1–21 (1996)
3. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)
4. Jiang, H., Qiu, T., Hu, Y., Li, M.-C., Luo, Z.-X.: Backbone analysis and applications in heuristic algorithm design. Acta Autom. Sin. 37(3), 257–269 (2011)
5. Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Talent Demand Analysis of LIS Based on Python and Apriori;Application of Intelligent Systems in Multi-modal Information Analytics;2020-07-21