An iterated local search algorithm for the team orienteering problem with variable profits

References

• Archetti, C., N. Bianchessi, M. G. Speranza, and A. Hertz. 2014. “The Split Delivery Capacitated Team Orienteering Problem.” Networks 63 (1): 16–33. doi: 10.1002/net.21519
   Web of Science ®Google Scholar
• Archetti, C., A. Hertz, and M. G. Speranza. 2007. “Metaheuristics for the Team Orienteering Problem.” Journal of Heuristics 13 (1): 49–76. doi: 10.1007/s10732-006-9004-0
   Web of Science ®Google Scholar
• Boussier, S., D. Feillet, and M. L. Gendreau. 2007. “An Exact Algorithm for Team Orienteering Problems.” 4OR 5 (3): 211–230. doi: 10.1007/s10288-006-0009-1
   Web of Science ®Google Scholar
• Chao, I., B. Golden, and E. Wasil. 1996a. “A Fast and Effective Heuristic for the Orienteering Problem.” European Journal of Operational Research 88 (3): 475–489. doi: 10.1016/0377-2217(95)00035-6
   Web of Science ®Google Scholar
• Chao, I., B. Golden, and E. Wasil. 1996b. “The Team Orienteering Problem.” European Journal of Operational Research 88 (3): 464–474. doi: 10.1016/0377-2217(94)00289-4
   Web of Science ®Google Scholar
• Dang, D.-C., R. N. Guibadj, and A. Moukrim. 2013. “An Effective PSO-Inspired Algorithm for the Team Orienteering Problem.” European Journal of Operational Research 229 (2): 332–344. doi: 10.1016/j.ejor.2013.02.049
   Web of Science ®Google Scholar
• Divsalar, A., P. Vansteenwegen, and D. Cattrysse. 2013. “A Variable Neighborhood Search Method for the Orienteering Problem with Hotel Selection.” International Journal of Production Economics 145 (1): 150–160. doi: 10.1016/j.ijpe.2013.01.010
   Web of Science ®Google Scholar
• Dueck, G. 1993. “New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel.” Journal of Computational Physics 104 (1): 86–92. doi: 10.1006/jcph.1993.1010
   Web of Science ®Google Scholar
• El-Hajj, R., D.-C. Dang, and A. Moukrim. 2016. “Solving the Team Orienteering Problem with Cutting Planes.” Computers & Operations Research 74: 21–30. doi: 10.1016/j.cor.2016.04.008
   Web of Science ®Google Scholar
• Erdoğan, G., and G. Laporte. 2013. “The Orienteering Problem with Variable Profits.” Networks 61 (2): 104–116. doi: 10.1002/net.21496
   Web of Science ®Google Scholar
• Ferreira, J., A. Quintas, and J. A. Oliveira. 2014. “Solving the Team Orienteering Problem: Developing a Solution Tool Using a Genetic Algorithm Approach.” In Soft Computing in Industrial Applications. edited by V. Snášel, P. Krömer, M. Köppen and G. Schaefer, Vol. 223, 365–375. Cham: Springer.
   Google Scholar
• Gendreau, M., G. Laporte, and F. Semet. 1997. “The Covering Tour Problem.” Operations Research 45 (4): 568–576. doi: 10.1287/opre.45.4.568
   Web of Science ®Google Scholar
• Golden, B. L., Q. Wang, and L. Liu. 1987. “The Orienteering Problem.” Naval Research Logistics 34 (3): 307–318. doi: 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D
   Web of Science ®Google Scholar
• Gunawan, A., H. C. Lau, and P. Vansteenwegen. 2016. “Orienteering Problem: A Survey of Recent Variants, Solution Approaches and Applications.” European Journal of Operational Research 255 (2): 315–332. doi: 10.1016/j.ejor.2016.04.059
   Web of Science ®Google Scholar
• Ke, L., L. Zhai, J. Li, and F. T. S. Chan. 2015. “Pareto Mimic Algorithm: an Approach to the Team Orienteering Problem.” Omega 61: 155–166. doi: 10.1016/j.omega.2015.08.003
   Web of Science ®Google Scholar
• Keshtkaran, M., K. Ziarati, A. Bettinelli, and D. Vigo. 2016. “Enhanced Exact Solution Methods for the Team Orienteering Problem.” International Journal of Production Research 54 (2): 591–601. doi: 10.1080/00207543.2015.1058982
   Web of Science ®Google Scholar
• Laporte, G., and S. Martello. 1990. “The Selective Travelling Salesman Problem.” Discrete Applied Mathematics 26 (2–3): 193–207. doi: 10.1016/0166-218X(90)90100-Q
   Web of Science ®Google Scholar
• Lourenço, H. R., O. C. Martin, and T. Stützle. 2003. “Iterated Local Search.” In Handbook of Metaheuristics, edited by F. Glover, and G. A. Kochenberger, 320–353. New York: Springer.
   Google Scholar
• Palomo-Martinez, P. J., M. A. Salazar-Aquilar, G. Laporte, and A. Langevin. 2017. “A Hybrid Variable Neighborhood Search for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints.” Computers & Operations Research 78: 408–419. doi: 10.1016/j.cor.2015.11.007
   Web of Science ®Google Scholar
• Souffriau, W., P. Vansteenwegen, J. Vertommen, G. Vanden Berghe, and D. Van Oudheusden. 2008. “A Personalized Tourist Trip Design Algorithm for Mobile Tourist Guides.” Applied Artificial Intelligence 22 (10): 964–985. doi: 10.1080/08839510802379626
   Web of Science ®Google Scholar
• Tsiligirides, T. 1984. “Heuristic Methods Applied to Orienteering.” Journal of the Operational Research Society 35 (9): 797–809. doi: 10.1057/jors.1984.162
   Web of Science ®Google Scholar
• Vansteenwegen, P., W. Souffriau, and D. Van Oudheusden. 2011. “The Orienteering Problem: A Survey.” European Journal of Operational Research 209 (1): 1–10. doi: 10.1016/j.ejor.2010.03.045
   Web of Science ®Google Scholar
• Vansteenwegen, P., W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden. 2009. “A Guided Local Search Metaheuristic for the Team Orienteering Problem.” European Journal of Operational Research 196 (1): 118–127. doi: 10.1016/j.ejor.2008.02.037
   Web of Science ®Google Scholar
• Yu, J., M. Schwager, and D. Rus. 2014. “Correlated Orienteering Problem and its Application to Informative Path Planning for Persistent Monitoring Tasks.” In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014), 342–349. Piscataway, NJ: IEEE.
   Google Scholar