电邮这篇文章 融合黑寡妇优化与记忆引导的混合蚁群算法求解旅行商问题
DOI: http://dx.doi.org/10.12349/iser.v7i3.9479
Article ID: 9479
摘要
关键词
全文:
PDF参考
Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: a computational study. Princeton university press.
Laporte, G. (1992). The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(2), 231-247.
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.
Blum, C. (2005). Ant colony optimization: Introduction and recent trends. Physics of Life Reviews, 2(4), 353-373.
Hayyolalam, V., & Kazem, A. A. P. (2020). Black widow optimization algorithm: A novel meta-heuristic approach for solving engineering optimization problems. Engineering Applications of Artificial Intelligence, 87, 103249.
Abdollahzadeh, B., Soleimanian Gharehchopogh, F., & Mirjalili, S. (2021). Black widow optimization: a comprehensive review, applications, and open issues. Artificial Intelligence Review, 54(8), 6169-6214.
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.
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.
Croes, G. A. (1958). A method for solving traveling-salesman problems. Operations Research, 6(6), 791-812.
Refbacks
- 当前没有refback。
版权所有（c）2026 高 宏, 李 迎春
此作品已接受知识共享署名-非商业性使用 4.0国际许可协议的许可。
