基于记忆引导重启的蚁群算法求解 TSP 问题
DOI: http://dx.doi.org/10.12349/tie.v3i3.10036
Article ID: 10036
摘要
关键词
参考
Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: a computational study. Princeton university press.
Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 26(1), 29-41.
Dorigo, M., & Stützle, T. (2004). Ant colony optimization. MIT press.
Stützle, T., & Hoos, H. H. (2000). MAX–MIN ant system. Future generation computer systems, 16(8), 889-914.
Ouyang, X., & D. L. (2013). A novel hybrid algorithm based on ant colony optimization and Nelder-Mead simplex search for traveling salesman problem. Journal of Computational Information Systems, 9(5), 1867-1874.
de O. Campos, P. R. A., & Nascimento, M. Z. (2017). A restart strategy for enhancing the performance of population-based metaheuristics. Applied Soft Computing, 61, 1142-1154.
Lü, Z., & Hao, J. K. (2010). Adaptive tabu search for the traveling salesman problem. Computers & Operations Research, 37(7), 1225-1232.
Dorigo, M. (1992). Optimization, Learning and Natural Algorithms (Ph.D. thesis). Politecnico di Milano, Italy.
Rios, L. H., & Sahinidis, N. V. (2013). Derivative-free optimization: a review of algorithms and comparison of software implementations. Journal of Global Optimization, 56(3), 1247-1293.
Refbacks
- 当前没有refback。
版权所有（c）2026 高 宏, 李 迎春
此作品已接受知识共享署名-非商业性使用 4.0国际许可协议的许可。
