Efficient Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows
暂无分享,去创建一个
[1] Bruce L. Golden,et al. The team orienteering problem , 1996 .
[2] Richard F. Hartl,et al. Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..
[3] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[4] G. Laporte,et al. A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.
[5] Adil M. Bagirov,et al. Modified global k-means algorithm for minimum sum-of-squares clustering problems , 2008, Pattern Recognit..
[6] Dirk Van Oudheusden,et al. Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..
[7] Nacima Labadie,et al. Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.
[8] Roberto Montemanni,et al. Coupling ant colony systems with strong local searches , 2012, Eur. J. Oper. Res..
[9] Alain Hertz,et al. Metaheuristics for the team orienteering problem , 2005, J. Heuristics.
[10] Dirk Van Oudheusden,et al. The City Trip Planner: An expert system for tourists , 2011, Expert Syst. Appl..
[11] Roberto Montemanni,et al. An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.
[12] R. Vohra,et al. The Orienteering Problem , 1987 .
[13] Gilbert Laporte,et al. The selective travelling salesman problem , 1990, Discret. Appl. Math..
[14] Charalampos Konstantopoulos,et al. A survey on algorithmic approaches for solving tourist trip design problems , 2014, Journal of Heuristics.
[15] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..
[16] Nikos A. Vlassis,et al. The global k-means clustering algorithm , 2003, Pattern Recognit..
[17] Shih-Wei Lin,et al. A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..
[18] Nacima Labadie,et al. The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..
[19] Tom M. Cavalier,et al. A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..
[20] Andrew Lim,et al. An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..