A Heuristic-Biased GRASP for the Team Orienteering Problem

This paper introduces a route-planning problem in the sector of tourism. The Tourist Trip Design Problem seeks to maximize the number of points of interest to visit. This paper also proposes an optimization approach for a multi-day planning problem for sightseeing. In order to solve this optimization problem, an efficient Greedy Randomized Adaptive Search Procedure is developed to obtain high-quality solutions. Enhanced solution construction mechanisms and bias functions used in construction mechanism have been proposed. The computational experiments indicate the solving scheme is able to report competitive solutions by using short computational times.

[1]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[2]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[3]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..

[4]  Shih-Wei Lin,et al.  Solving the team orienteering problem using effective multi-start simulated annealing , 2013, Appl. Soft Comput..

[5]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[6]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..

[7]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[8]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[9]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[10]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

[11]  Dirk Van Oudheusden,et al.  A Path Relinking approach for the Team Orienteering Problem , 2010, Comput. Oper. Res..

[12]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications , 2010 .

[13]  Dirk Van Oudheusden,et al.  The Mobile Tourist Guide: An OR Opportunity , 2007, OR Insight.

[14]  Duc-Cuong Dang,et al.  A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem , 2013, CPAIOR.

[15]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[16]  Dirk Van Oudheusden,et al.  A guided local search metaheuristic for the team orienteering problem , 2009, Eur. J. Oper. Res..

[17]  Andrew L. Johnson,et al.  An augmented large neighborhood search method for solving the team orienteering problem , 2013, Expert Syst. Appl..

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

[19]  Duc-Cuong Dang,et al.  A memetic algorithm for the team orienteering problem , 2008, 4OR.