SAILS: Hybrid algorithm for the Team Orienteering Problem with Time Windows

• Main Authors: GUNAWAN, Aldy, LAU, Hoong Chuin, LU, Kun
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2015
• Subjects: Orienteering Problem; Time Windows; Hybrid Algorithm; Simulated Annealing; Iterated Local Search; Operations Research, Systems Engineering and Industrial Engineering; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/3398; https://ink.library.smu.edu.sg/context/sis_research/article/4399/viewcontent/SAILS.pdf
• Institution: Singapore Management University

The Team Orienteering Problem with Time Windows (TOPTW) is the extended version of the Orienteering Problem where each node is limited by a given time window. The objective is to maximize the total collected score from a certain number of paths. In this paper, a hybridization of Simulated Annealing and Iterated Local Search, namely SAILS, is proposed to solve the TOPTW. The efficacy of the proposed algorithm is tested using benchmark instances. The results show that the proposed algorithm is competitive with the state-of-the-art algorithms in the literature. SAILS is able to improve the best known solutions for 19 benchmark instances.