Finding the global optimal solution in Dynamic multiple TSPTW with data-driven ACO

Zimu Xu, Jiahui Yu,Weifeng Su

2021 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/IOP/SCI)（2021）

引用 1|浏览3

暂无评分

摘要

Dynamic Travelling Salesman Problem (D-TSP) is a classic dynamic optimization problem (DOP), which aims to maintain the optimal route with every change of the graph. D-TSP often greedily pursues the current optimum after each change efficiently and does not lead to the global optimum. This paper proposes a new model, Data-driven Ant Colony Optimization (D-ACO), to solve the problem by considering ...

查看译文

关键词

AI Applications,Planning and scheduling,Combinatorial Optimization,Traveling salesman Problem,Data-driven,Bootstrap Sample,Dynamic Optimization,Ant Colony Optimization

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要