Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows
暂无分享,去创建一个
Charalampos Konstantopoulos | Damianos Gavalas | Grammati E. Pantziou | Konstantinos Mastakas | Yiannis Tasoulas
[1] Zhenping Li,et al. The Team Orienteering Problem with Capacity Constraint and Time Window , 2011 .
[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] R. Vohra,et al. The Orienteering Problem , 1987 .
[5] Dirk Van Oudheusden,et al. The Mobile Tourist Guide: An OR Opportunity , 2007, OR Insight.
[6] Roberto Montemanni,et al. An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.
[7] Nacima Labadie,et al. The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..
[8] G. Laporte,et al. A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.
[9] Zhenping Li,et al. The orienteering problem with compulsory nodes and time window , 2011, ICSSSM11.
[10] Shih-Wei Lin,et al. A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..
[11] Nikos A. Vlassis,et al. The global k-means clustering algorithm , 2003, Pattern Recognit..
[12] Dirk Van Oudheusden,et al. Iterated local search for the team orienteering problem with time windows , 2009, Comput. Oper. Res..
[13] Nacima Labadie,et al. Hybridized evolutionary local search algorithm for the team orienteering problem with time windows , 2011, J. Heuristics.
[14] Roberto Montemanni,et al. Coupling ant colony systems with strong local searches , 2012, Eur. J. Oper. Res..
[15] Gilbert Laporte,et al. The selective travelling salesman problem , 1990, Discret. Appl. Math..
[16] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..