Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows
暂无分享,去创建一个
Charalampos Konstantopoulos | Damianos Gavalas | Grammati E. Pantziou | Konstantinos Mastakas | Nikolaos Vathis
[1] Olatz Arbelaitz,et al. Integrating public transportation in personalised electronic tourist guides , 2013, Comput. Oper. Res..
[2] Dorothea Wagner,et al. User-Constrained Multi-Modal Route Planning , 2012, ALENEX.
[3] Andrzej Lingas,et al. Approximation algorithms for time-dependent orienteering , 2001, Inf. Process. Lett..
[4] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..
[5] Gilbert Laporte,et al. The selective travelling salesman problem , 1990, Discret. Appl. Math..
[6] Nacima Labadie,et al. The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..
[7] Charalampos Konstantopoulos,et al. Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows , 2013, SEA.
[8] Shih-Wei Lin,et al. A simulated annealing heuristic for the team orienteering problem with time windows , 2012, Eur. J. Oper. Res..
[9] Farhad Samadzadegan,et al. Time-dependent personal tour planning and scheduling in metropolises , 2011, Expert Syst. Appl..
[10] Roberto Montemanni,et al. An ant colony system for team orienteering problems with time windows , 2023, 2305.07305.
[11] F. Spieksma. On the approximability of an interval scheduling problem , 1999 .
[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] Richard F. Hartl,et al. Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..