References
- 1.Karapetyan, D. Lin-Kernighan Heuristic Adaptations for the Generalized Travelling Salesman Problem. - European Journal of Operational Research, Vol. 208, 2011, pp. 221-232.
- 2. Zhang, Y., L. Li. MST Ant Colony Optimization with Lin-Kerninghan Local Search for the Traveling Salesman Problem. - ISCID, Vol. 166, 2008, pp. 344-347.
- 3. Hu, G., et al. Binary Ant Colony Algorithm with Controllable Search Bias - Control Theory & Applications, Vol. 28, 2011, No 8, pp. 1071-1080.
- 4. Meng, Xiangping, et al. Ant Algorithm Based on Direction-Coordinating. - Control and Decision, Vol. 28, 2013, No 5, pp. 782-786.
- 5. Wu, Hua-feng, et al. Improved Ant Colony Algorithm Based on Natural Selection Strategy for Solving TSP Problem. - Journal on Communications, Vol. 34, 2013, No 4, pp. 165-170.
- 6.Liao, T., T. Stutzle, M. A. Montesde Oca, M. Dorigo. A Unified Ant Colony Optimization Algorithm for Continuous Optimization. - European Journal of Operational Research, Vol. 234, 2014, pp. 597-609.
- 7. Helsgaun, K. An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. - European Journal of Operational Research, Vol. 126, 2000, No 1, pp. 106-130.
- 8. Held, M., R. M. Karp. The Traveling-Salesman Problem and Minimum Spanning Trees - Oper. Res., Vol. 18, 1970, pp. 1138-1162.
- 9. Held, M., R. M. Karp. The Traveling-Salesman Problem and Minimum Spanning Trees. Part II. - Math. Programming, Vol. 1, 1971, pp. 16-25.
- 10. Poljak, B. T. A General Method of Solving Extremum Problems. - Soviet Math. Dokl., Vol. 8, 1967, pp. 593-597.
- 11. University of Heidelberg. TSPLIB website [EB/OL]. http://www.iwr.Uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp
- 12. Tan, G., D. Mamady. Real-Time Global Optimal Path Planning of Mobile Robots Based on Modified Ant System Algorithm [C]. ICNC’2006, pp. 204-214.
- 13. Stutzle, T., H. Hoos. MAX-MIN Ant System and Local Search for the Traveling Problem - In: Proc. of IEEE International Conference on Evolutionary Computation, 1997, pp. 309-315.