Abstract: In the dynamic traveling salesman problem (TSP), the vertices and/or weights of the graph that represents the TSP are changed during the optimization process. The dynamic TSP with weight ...
Abstract: This study explores optimizing the Traveling Salesman Problem (TSP) using Q-Learning reinforcement learning. The proposed method builds a Q-table to learn the optimal path and employs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback