Abstract: The traveling salesman problem (TSP) is NP-hard and difficult to solve since the search space increases significantly with problem size. Reinforcement learning (RL) is a promising method for ...