Learning to solve multiple-TSP with time window and rejections via deep reinforcement learning

• Main Authors: ZHANG, Rongkai, ZHANG, Cong, CAO, Zhiguang, SONG, Wen, TAN, Puay Siew, ZHANG, Jie, WEN, Bihan, DAUWELS, Justin
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2022
• Subjects: Travelling Salesman Problem; Graph Neural Network; Deep Reinforcement Learning; Artificial Intelligence and Robotics; Transportation
• Online Access: https://ink.library.smu.edu.sg/sis_research/8128; https://ink.library.smu.edu.sg/context/sis_research/article/9131/viewcontent/2209.06094.pdf
• Institution: Singapore Management University

We propose a manager-worker framework (the implementation of our model is publically available at: https://github.com/zcaicaros/manager-worker-mtsptwr) based on deep reinforcement learning to tackle a hard yet nontrivial variant of Travelling Salesman Problem (TSP), i.e. multiple-vehicle TSP with time window and rejections (mTSPTWR), where customers who cannot be served before the deadline are subject to rejections. Particularly, in the proposed framework, a manager agent learns to divide mTSPTWR into sub-routing tasks by assigning customers to each vehicle via a Graph Isomorphism Network (GIN) based policy network. A worker agent learns to solve sub-routing tasks by minimizing the cost in terms of both tour length and rejection rate for each vehicle, the maximum of which is then fed back to the manager agent to learn better assignments. Experimental results demonstrate that the proposed framework outperforms strong baselines in terms of higher solution quality and shorter computation time. More importantly, the trained agents also achieve competitive performance for solving unseen larger instances.