摘要
The traveling salesman problem (TSP) is one of the best-known combinatorial optimization problems. Many methods derived from TSP have been applied to study autonomous vehicle route planning with fuel constraints. Nevertheless, less attention has been paid to reinforcement learning (RL) as a potential method to solve refueling problems. This paper employs RL to solve the traveling salesman problem With refueling (TSPWR). The technique proposes a model (actions, states, reinforcements) and RL-TSPWR algorithm. Focus is given on the analysis of RL parameters and on the refueling influence in route learning optimization of fuel cost. Two RL algorithms: Q-learning and SARSA are compared. In addition, RL parameter estimation is performed by Response Surface Methodology, Analysis of Variance and Tukey Test. The proposed method achieves the best solution in 15 out of 16 case studies.
学科与关键词
- Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problemsZheng, Jiongzhi; He, Kun*; Zhou, Jianrong; Jin, Yan; Li, Chu-MinKnowledge-Based Systems, 2023, 260: 110144.被引 18
- Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problemZhang, Jin*; Liu, Qing; Han, XiaoHangPLoS One, 2023, 18(3): e0283207.被引 2
- Solving Dynamic Traveling Salesman Problems With Deep Reinforcement LearningZhang, Zizhen; Liu, Hong*; Zhou, MengChu; Wang, JiahaiIEEE Transactions on Neural Networks and Learning Systems, 2023, 34(4): 2119-2132.被引 50
