Solving Time-Dependent Traveling Salesman Problem with Time Windows with Deep Reinforcement Learning
Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem. Recently, many researchers have used deep reinforcement learning to solve it. However, traffic factors are rarely considered in their works, in which the traveling time between customer locations is …