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

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.

[1]  Dirk Van Oudheusden,et al.  Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Andrés L. Medaglia,et al.  Solving the Orienteering Problem with Time Windows via the Pulse Framework , 2015, Comput. Oper. Res..

[4]  Nacima Labadie,et al.  Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.

[5]  Giovanni Righini,et al.  Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming , 2009, Comput. Oper. Res..

[6]  Shih-Wei Lin,et al.  A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..

[7]  José R. Álvarez,et al.  Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II , 2005 .

[8]  Selmer M. Johnson.  Generation of permutations by adjacent transposition , 1963 .

[9]  Hoong Chuin Lau,et al.  An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows , 2015, EvoCOP.

[10]  Andrew Lim,et al.  An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..

[11]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[12]  Nacima Labadie,et al.  The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..

[13]  R. Montemanni,et al.  An Enhanced Ant Colony System for the Team Orienteering Problem with Time Windows , 2011, 2011 International Symposium on Computer Science and Society.

[14]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[15]  Shuo-Yan Chou,et al.  Solving the truck and trailer routing problem based on a simulated annealing heuristic , 2009, Comput. Oper. Res..

[16]  Günther R. Raidl,et al.  Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification , 2005, IWINAC.

[17]  Olatz Arbelaitz,et al.  Hybrid Approach for the Public Transportation Time Dependent Orienteering Problem with Time Windows , 2010, HAIS.

[18]  Qiang Meng,et al.  Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm , 2007 .

[19]  Jean-Marc Geib,et al.  A parallel adaptive tabu search approach , 1998, Parallel Comput..

[20]  Tunchan Cura,et al.  An artificial bee colony algorithm approach for the team orienteering problem with time windows , 2014, Comput. Ind. Eng..

[21]  Roberto Montemanni,et al.  An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.

[22]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[23]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.