Chuan Wang1,*, Ruoyu Zhu2, Yi Jiang3, Weili Liu4, Sang-Woon Jeon5, Lin Sun2, Hua Wang6
CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.2, pp. 1209-1228, 2023, DOI:10.32604/cmes.2022.022807
Abstract The dynamic traveling salesman problem (DTSP) is significant in logistics distribution in real-world applications in smart cities, but it is uncertain and difficult to solve. This paper proposes a scheme library-based ant colony optimization (ACO) with a two-optimization (2-opt) strategy to solve the DTSP efficiently. The work is novel and contributes to three aspects: problem model, optimization framework, and algorithm design. Firstly, in the problem model, traditional DTSP models often consider the change of travel distance between two nodes over time, while this paper focuses on a special DTSP model in that the node locations change dynamically over time. Secondly,… More >
Login
Register
