[1]
|
E. Angelelli, C. Archetti and M. Vindigni, The clustered orienteering problem, European J. Oper. Res., 238 (2014), 404-414.
doi: 10.1016/j.ejor.2014.04.006.
|
[2]
|
C. Archetti, D. Feillet, A. Hertz and M. G. Speranza, The capacitated team orienteering and profitable tour problems, Journal of the Operational Research Society, 60 (2009), 831-842.
doi: 10.1057/palgrave.jors.2602603.
|
[3]
|
Y. Cai, Z. Zhang, S. Guo, H. Qin and A. Lim, A tree-based tabu search algorithm for the manpower allocation problem with time windows and job-teaming constraints, In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, Beijing, China, 3-9 (2013), 496-502.
|
[4]
|
P. Cappanera, L. Gouveia and M. G. Scutellà, The skill vehicle routing problem, Network Optimization, 6701 (2011), 354-364.
doi: 10.1007/978-3-642-21527-8_40.
|
[5]
|
A. M. Caunhye, X. Nie and S. Pokharel, Optimization models in emergency logistics: A literature review, Socio-economic Planning Sciences, 46 (2012), 4-13.
doi: 10.1016/j.seps.2011.04.004.
|
[6]
|
J. F. Cordeau, G. Laporte, F. Pasin and S. Ropke, Scheduling technicians and tasks in a telecommunications company, J. Sched., 13 (2010), 393-409.
doi: 10.1007/s10951-010-0188-7.
|
[7]
|
I. M. Chao, B. L. Golden and E. A. Wasil, The team orienteering problem, European Journal of Operational Research, 88 (1996), 464-474.
doi: 10.1016/0377-2217(94)00289-4.
|
[8]
|
X. Chen, B. W. Thomas and M. Hewitt, The technician routing problem with experience-based service times, Omega, 61 (2016), 49-61.
doi: 10.1016/j.omega.2015.07.006.
|
[9]
|
T. Cura, An artificial bee colony algorithm approach for the team orienteering problem with time windows, Computers & Industrial Engineering, 74 (2014), 270-290.
doi: 10.1016/j.cie.2014.06.004.
|
[10]
|
S. M. R. Davoodi and A. Goli, An integrated disaster relief model based on covering tour using hybrid Benders decomposition and variable neighborhood search: Application in the Iranian context, Computers & Industrial Engineering, 130 (2019), 370-380.
doi: 10.1016/j.cie.2019.02.040.
|
[11]
|
A. Dohn, E. Kolind and J. Clausen, The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach, Comput. Oper. Res., 36 (2009), 1145-1157.
doi: 10.1016/j.cor.2007.12.011.
|
[12]
|
P. F. Dutot, A. Laugier and A. M. Bustos, Technicians and Interventions Scheduling for Telecommunications, Technical report, France Telcom Research and Development, 2006.
|
[13]
|
L. Evers, A. I. Barros, H. Monsuur and A. Wgelmans, Online stochastic UAV mission planning with time windows and time-sensitive targets, European Journal of Operational Research, 238 (2014), 348-362.
doi: 10.1016/j.ejor.2014.03.014.
|
[14]
|
S. Faraj and Y. Xiao, Coordination in fast-response organizations, Management Science, 52 (2006), 1155-1169.
doi: 10.1287/mnsc.1060.0526.
|
[15]
|
L. M. Gambardella, R. Montemanni and D. Weyland, Coupling ant colony systems with strong local searches, European J. Oper. Res., 220 (2012), 831-843.
doi: 10.1016/j.ejor.2012.02.038.
|
[16]
|
C. Garcia, Synchronized Multi-Assignment Orienteering, 1.1 (2021).
doi: 10.5281/zenodo.5699598.
|
[17]
|
C. Garcia, G. Rabadi and F. Handy, Dynamic resource allocation and coordination for high-load crisis volunteer management, Journal of Humanitarian Logistics and Supply Chain Management, 8 (2018), 533-556.
doi: 10.1108/JHLSCM-02-2018-0019.
|
[18]
|
D. Gavalas, V. Kasapakis, C. Konstantopoulos, G. Pantziou, N. Vathis and C. Zaroliagis, The eCOMPASS multimodal tourist tour planner, Expert Systems with Applications, 42 (2015), 7303-7316.
doi: 10.1016/j.eswa.2015.05.046.
|
[19]
|
B. L. Golden, L. Levy and R. Vohra, The orienteering problem, Naval Research Logistics, 34 (1987), 307-318.
doi: 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D.
|
[20]
|
A. Goli, H. Khademi-Zare, R. Tavakkoli-Moghaddam, A. Sadeghieh, M. Sasanian and R. M. Kordestanizadeh, An integrated approach based on artificial intelligence and novel meta-heuristic algorithms to predict demand for dairy products: A case study, Network: Computation in Neural Systems, 32 (2021), 1-35.
doi: 10.1080/0954898X.2020.1849841.
|
[21]
|
A. Goli and B. Malmir, A covering tour approach for disaster relief locating and routing with fuzzy demand, International Journal of Intelligent Transportation Systems Research, 18 (2020), 140-152.
doi: 10.1007/s13177-019-00185-2.
|
[22]
|
A. Goli, E. B. Tirkolaee and N. S. Aydin, Fuzzy integrated cell formation and production scheduling considering automated guided vehicles and human factors, IEEE Transactions on Fuzzy Systems, 29 (2021), 3686-3695.
doi: 10.1109/TFUZZ.2021.3053838.
|
[23]
|
A. Goli, H. K. Zare, R. Tavakkoli-Moghaddam and A. Sadeghieh, A comprehensive model of demand prediction based on hybrid artificial intelligence and metaheuristic algorithms: A case study in dairy industry, Journal of Industrial and Systems Engineering, 11 (2018), 190-203.
|
[24]
|
A. Goli, H. K. Zare, R. Tavakkoli-Moghaddam and A. Sadeghieh, Application of robust optimization for a product portfolio problem using an invasive weed optimization algorithm, Numer. Algebra Control Optim., 9 (2019), 187-209.
doi: 10.3934/naco.2019014.
|
[25]
|
A. Gunawan, H. C. Lau and K. Lu, An iterated local search algorithm for solving the orienteering problem with time windows, Evolutionary Computation in Combinatorial Optimization, 9026 (2015), 61-73.
doi: 10.1007/978-3-319-16468-7_6.
|
[26]
|
A. Gunawan, H. C. Lau and K. Lu, SAILS: Hybrid algorithm for the team orienteering problem with time windows, Proceedings of the 7th Multidisciplinary International Scheduling Conference (MISTA 2015), Prague, Czech Republic (2015), 276–295.
|
[27]
|
A. Gunawan, H. C. Lau and K. Lu, Well-Tuned ILS for Extended Team Orienteering Problem with Time Windows, LARC Technical Report Series, Singapore Management University.
|
[28]
|
A. Gunawan, H. C. Lau and P. Vansteenwegen, Orienteering Problem: A survey of recent variants, solution approaches and applications, European J. Oper. Res, 255 (2016), 315-332.
doi: 10.1016/j.ejor.2016.04.059.
|
[29]
|
F. Hammami, M. Rekik and L. C. Coelho, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, Comput. Oper. Res., 123 (2020), 105034, 18 pp.
doi: 10.13140/RG.2.2.12346.54722.
|
[30]
|
H. Hashimoto, S. Boussier, M. Vasquez and C. Wilbaut, A GRASP-based approach for technicians and interventions scheduling for telecommunications, Ann. Oper. Res., 183 (2011), 143-161.
doi: 10.1007/s10479-009-0545-0.
|
[31]
|
J. Holguín-Veras, M. Jaller, L. N. Van Wassenhove, N. Prez and T. Wachtendorf, Material convergence: Important and understudied disaster phenomenon, Natural Hazards Review, 15 (2012), 1-12.
|
[32]
|
J. Holguín-Veras, M. Jaller, L. N. Van Wassenhove, N. Pérez and T. Wachtendorf, On the unique features of post-disaster humanitarian logistics, Journal of Operations Management, 30 (2012), 494-506.
|
[33]
|
Q. Hu and A. Lim, An iterative three-component heuristic for the team orienteering problem with time windows, European Journal of Operational Research, 232 (2014), 276-286.
|
[34]
|
C. A. Hurkens, Incorporating the strength of MIP modeling in schedule construction, RAIRO-Oper. Res., 43 (2009), 409-420.
doi: 10.1051/ro/2009026.
|
[35]
|
Y. Jiang and Y. Yuan, Emergency logistics in a large-scale disaster context: Achievements and challenges, Int. J. Environ. Res. Public Health, 16 (2019), 779 pp.
doi: 10.3390/ijerph16050779.
|
[36]
|
A. A. Juan, A. Freixes, J. Panadero, C. Serrat and A. Estrada-Morena, Routing drones in smart cities: A biased-randomized algorithm, Transportation Research Procedia, 47 (2020), 243-250.
|
[37]
|
M. G. Kantor and M. B. Rosenwein, The orienteering problem with time windows, Journal of the Operational Research Society, 43 (1992), 629-635.
|
[38]
|
A. A. Kovacs, S. N. Parragh, K. F. Doerner and R. F. Hartl, Adaptive large neighborhood search for service technician routing and scheduling problems, J. Sched., 15 (2012), 579-600.
doi: 10.1007/s10951-011-0246-9.
|
[39]
|
N. Labadie, R. Mansini, J. Melechovsky and R. Wolfler Calvo, Hybridized evolutionary local search algorithm for the team orienteering problem with time windows, Journal of Heuristics, 17 (2011), 729-753.
|
[40]
|
N. Labadie, R. Mansini, J. Melechovsky and R. Wolfler Calvo, The team orienteering problem with time windows: An LP-based granular variable neighborhood search, European J. Oper. Res., 220 (2012), 15-27.
doi: 10.1016/j.ejor.2012.01.030.
|
[41]
|
K. Lassiter, A. Khademi and K. M. Taaffe, A robust optimization approach to volunteer management in humanitarian crises, International Journal of Production Economics, 163 (2015), 97-111.
doi: 10.1016/j.ijpe.2015.02.018.
|
[42]
|
Y. Li, A. Lim and B. Rodrigues, Manpower Allocation with time windows and job teaming constraints, Naval Res. Logist., 52 (2005), 302-311.
doi: 10.1002/nav.20075.
|
[43]
|
S. W. Lin and V. F. Yu, A simulated annealing heuristic for the team orienteering problem with time windows, European J. Oper. Res., 217 (2012), 94-107.
doi: 10.1016/j.ejor.2011.08.024.
|
[44]
|
R. Liu, Y. Tao and X. Xie, An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits, Comput. Oper. Res., 101 (2019), 250-262.
doi: 10.1016/j.cor.2018.08.002.
|
[45]
|
M. Moskal and R. Batta, Adaptive unmanned aerial vehicle surveillance using a prize-collecting vertex routing model, Military Operations Research, 24 (2019), 5-22.
|
[46]
|
E. H. Özder, E. Özcan and T. Eran, A systematic literature review for personnel scheduling problems, International Journal of Information Technology & Decision Making, 19 (2020), 1695-1735.
|
[47]
|
S. M. Pahlevan, S. M. S. Hosseini and A. Goli, Sustainable supply chain network design using products' life cycle in the aluminum industry, Environmental Science and Pollution Research, 2021.
doi: 10.1007/s11356-020-12150-8.
|
[48]
|
V. Pillac, C. Gueret and A. Medaglia, On the dynamic technician routing and scheduling problem, ODYSSEUS 2012 - 5th International Workshop on Freight Transportation and Logistics, Mikonos, Greece (2012), 194.
|
[49]
|
D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Comput. Oper. Res., 34 (2007), 2403-2435.
doi: 10.1016/j.cor.2005.09.012.
|
[50]
|
I. Roozbeh, J. W. Hearne and D. Pahlevani, A solution approach to the orienteering problem with time windows and synchronisation constraints, Heliyon, 6 (2020), e04202.
doi: 10.1016/j.heliyon.2020.e04202.
|
[51]
|
S. Ropke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Science, 40 (2006), 455-472.
doi: 10.1287/trsc.1050.0135.
|
[52]
|
M. A. Salazar-Aguilar, A. Langevin and G. Laporte, The multi-district team orienteering problem, Comput. Oper. Res., 41 (2014), 76-82.
doi: 10.1016/j.cor.2013.07.026.
|
[53]
|
A. Santini, An adaptive large neighbourhood search algorithm for the orienteering problem, Expert Systems with Applications, 123 (2019), 154-167.
doi: 10.1016/j.eswa.2018.12.050.
|
[54]
|
B. Sarasola and K. Doerner, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, Networks, 75 (2020), 64-85.
doi: 10.1002/net.21905.
|
[55]
|
S. Schwarze and S. Voß, Improved load balancing and resource utilization for the skill vehicle routing problem, Optim. Lett., 7 (2013), 1805-1823.
doi: 10.1007/s11590-012-0524-2.
|
[56]
|
S. Schwarze and S. Voß, A bicriteria skill vehicle routing problem with time windows and an application to pushback operations at airports, Logistics Management, In: Dethloff J., Haasis HD., Kopfer H., Kotzab H., Schönberger J. (eds), (2014), 289–300.
doi: 10.1007/978-3-319-13177-1_23.
|
[57]
|
W. Souffriau, P. Vansteenwegen, G. Vanden Berghe and D. Van Oudheusden, The multiconstraint team orienteering problem with multiple time windows, Transportation Science, 47 (2013), 53-63.
|
[58]
|
M. Van der Merwe, J. P. Minas, M. Ozlen and J. W. Hearne, The cooperative orienteering problem with time windows, Optimization Online, (2014).
|
[59]
|
P. Vansteenwegen and A. Gunawan, Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits, EURO Advanced Tutorials on Operational Research. Springer, Cham, 2019.
doi: 10.1007/978-3-030-29746-6.
|
[60]
|
P. Vansteenwegen, W. Souffriau and D. Van Oudheusden, The orienteering problem: A survey, European J. Oper. Res., 209 (2011), 1-10.
doi: 10.1016/j.ejor.2010.03.045.
|
[61]
|
P. Vansteenwegen, W. Souffriau, G. Vanden Berghe and D. Van Oudheusden, Iterated local search for the team orienteering problem with time windows, Computers & Operations Research, 36 (2009), 3281-3290.
|
[62]
|
V. Yu, P. Jewpanya, S. W. Lin and A. A. N. P. Redi, Team orienteering problem with time windows and time-dependent scores, Computers & Industrial Engineering, 127 (2019), 213-224.
doi: 10.1016/j.cie.2018.11.044.
|
[63]
|
B. Yuan, R. Liu and Z. Jiang, A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements, International Journal of Production Research, 53 (2015), 7450-7464.
doi: 10.1080/00207543.2015.1082041.
|