APA (7th ed.) Citation

Sun, L., Zhu, M., Li, J., & Zhang, H. (2025). Adaptive annealing dynamic Q-learning based on subroute optimization for solving the traveling salesman problem. Cluster Computing, 28(7), 1. https://doi.org/10.1007/s10586-025-05115-4

Chicago Style (17th ed.) Citation

Sun, Liming, Ming Zhu, Jing Li, and Haotian Zhang. "Adaptive Annealing Dynamic Q-learning Based on Subroute Optimization for Solving the Traveling Salesman Problem." Cluster Computing 28, no. 7 (2025): 1. https://doi.org/10.1007/s10586-025-05115-4.

MLA (9th ed.) Citation

Sun, Liming, et al. "Adaptive Annealing Dynamic Q-learning Based on Subroute Optimization for Solving the Traveling Salesman Problem." Cluster Computing, vol. 28, no. 7, 2025, p. 1, https://doi.org/10.1007/s10586-025-05115-4.