Conference Proceeding Article
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.
Orienteering Problem, Time Windows, Hybrid Algorithm, Simulated Annealing, Iterated Local Search
Operations Research, Systems Engineering and Industrial Engineering | Theory and Algorithms
Intelligent Systems and Decision Analytics
MISTA 2015: Proceedings of the 7th Multidisciplinary International Scheduling Conference, Prague, Czech Republic, August 25-28, 2015
City or Country
GUNAWAN, Aldy; LAU, Hoong Chuin; and LU, Kun.
SAILS: Hybrid algorithm for the Team Orienteering Problem with Time Windows. (2015). MISTA 2015: Proceedings of the 7th Multidisciplinary International Scheduling Conference, Prague, Czech Republic, August 25-28, 2015. 276-295. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3398
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.