IDEAS home Printed from https://ideas.repec.org/r/wly/navres/v34y1987i3p307-318.html
   My bibliography  Save this item

The orienteering problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Larco Martinelli, J.A. & Dekker, R. & Kaymak, U., 2007. "Distributed Services with Foreseen and Unforeseen Tasks: The Mobile Re-allocation Problem," ERIM Report Series Research in Management ERS-2007-087-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  2. Erin Mullin & Ashlea Bennett Milburn, 2021. "Game— Logistics to the Rescue : An Elementary Introduction to Planning in Disaster Response Decision Environments," INFORMS Transactions on Education, INFORMS, vol. 21(3), pages 152-159, May.
  3. Javier Panadero & Eva Barrena & Angel A. Juan & David Canca, 2022. "The Stochastic Team Orienteering Problem with Position-Dependent Rewards," Mathematics, MDPI, vol. 10(16), pages 1-25, August.
  4. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
  5. Jasmin Grabenschweiger & Fabien Tricoire & Karl F. Doerner, 2018. "Finding the trade-off between emissions and disturbance in an urban context," Flexible Services and Manufacturing Journal, Springer, vol. 30(3), pages 554-591, September.
  6. Miguel Andres Figliozzi & Hani S. Mahmassani & Patrick Jaillet, 2007. "Pricing in Dynamic Vehicle Routing Problems," Transportation Science, INFORMS, vol. 41(3), pages 302-318, August.
  7. Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
  8. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
  9. Letchford, Adam N. & Nasiri, Saeideh D. & Theis, Dirk Oliver, 2013. "Compact formulations of the Steiner Traveling Salesman Problem and related problems," European Journal of Operational Research, Elsevier, vol. 228(1), pages 83-92.
  10. Pamela J. Palomo-Martínez & M. Angélica Salazar-Aguilar & Víctor M. Albornoz, 2017. "Formulations for the orienteering problem with additional constraints," Annals of Operations Research, Springer, vol. 258(2), pages 503-545, November.
  11. Pablo A. Miranda-Gonzalez & Javier Maturana-Ross & Carola A. Blazquez & Guillermo Cabrera-Guerrero, 2021. "Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem," Mathematics, MDPI, vol. 9(21), pages 1-33, October.
  12. Dang, Duc-Cuong & Guibadj, Rym Nesrine & Moukrim, Aziz, 2013. "An effective PSO-inspired algorithm for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 332-344.
  13. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 475-489, February.
  14. Marianna Fornasiero & Federico Malucelli & Rodolfo Pazzi & Tommaso Schettini, 2021. "Empowering Optimization Skills Through an Orienteering Competition," INFORMS Transactions on Education, INFORMS, vol. 22(1), pages 1-8, September.
  15. Aldy Gunawan & Hoong Chuin Lau & Pieter Vansteenwegen & Kun Lu, 2017. "Well-tuned algorithms for the Team Orienteering Problem with Time Windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 861-876, August.
  16. Krzysztof Ostrowski & Joanna Karbowska-Chilinska & Jolanta Koszelew & Pawel Zabielski, 2017. "Evolution-inspired local improvement algorithm solving orienteering problem," Annals of Operations Research, Springer, vol. 253(1), pages 519-543, June.
  17. Cédric Verbeeck & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "The time-dependent orienteering problem with time windows: a fast ant colony system," Annals of Operations Research, Springer, vol. 254(1), pages 481-505, July.
  18. Wu, Lunwen & Wang, Zhouyiying & Liao, Zhixue & Xiao, Di & Han, Peng & Li, Wenyong & Chen, Qin, 2024. "Multi-day tourism recommendations for urban tourists considering hotel selection: A heuristic optimization approach," Omega, Elsevier, vol. 126(C).
  19. Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
  20. Labadie, Nacima & Mansini, Renata & Melechovský, Jan & Wolfler Calvo, Roberto, 2012. "The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search," European Journal of Operational Research, Elsevier, vol. 220(1), pages 15-27.
  21. Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
  22. Jonathan F. Bard & Siwate Rojanasoonthon, 2006. "A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(1), pages 24-44, February.
  23. Orlis, Christos & Laganá, Demetrio & Dullaert, Wout & Vigo, Daniele, 2020. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements," Omega, Elsevier, vol. 93(C).
  24. Shahin Gelareh & Bernard Gendron & Saïd Hanafi & Rahimeh Neamatian Monemi & Raca Todosijević, 2020. "The selective traveling salesman problem with draft limits," Journal of Heuristics, Springer, vol. 26(3), pages 339-352, June.
  25. Siwate Rojanasoonthon & Jonathan Bard, 2005. "A GRASP for Parallel Machine Scheduling with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 32-51, February.
  26. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
  27. Freeman, Nickolas K. & Keskin, Burcu B. & Çapar, İbrahim, 2018. "Attractive orienteering problem with proximity and timing interactions," European Journal of Operational Research, Elsevier, vol. 266(1), pages 354-370.
  28. Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet, 2017. "A unified matheuristic for solving multi-constrained traveling salesman problems with profits," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 393-422, September.
  29. Bijun Wang & Zheyong Bian & Mo Mansouri, 2023. "Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system," Journal of Heuristics, Springer, vol. 29(1), pages 77-137, February.
  30. Lin, Shih-Wei & Yu, Vincent F., 2012. "A simulated annealing heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 217(1), pages 94-107.
  31. Verbeeck, C. & Sörensen, K. & Aghezzaf, E.-H. & Vansteenwegen, P., 2014. "A fast solution method for the time-dependent orienteering problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 419-432.
  32. Damianos Gavalas & Charalampos Konstantopoulos & Konstantinos Mastakas & Grammati Pantziou, 2019. "Efficient Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(01), pages 1-44, February.
  33. Jesse Pietz & Johannes O. Royset, 2013. "Generalized orienteering problem with resource dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 294-312, June.
  34. Gambardella, L.M. & Montemanni, R. & Weyland, D., 2012. "Coupling ant colony systems with strong local searches," European Journal of Operational Research, Elsevier, vol. 220(3), pages 831-843.
  35. Souffriau, Wouter & Vansteenwegen, Pieter & Vanden Berghe, Greet & Van Oudheusden, Dirk, 2011. "The planning of cycle trips in the province of East Flanders," Omega, Elsevier, vol. 39(2), pages 209-213, April.
  36. Afsar, Hasan Murat & Afsar, Sezin & Palacios, Juan José, 2021. "Vehicle routing problem with zone-based pricing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  37. B. L. Golden & Qiwen Wang & Li Liu, 1988. "A multifaceted heuristic for the orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(3), pages 359-366, June.
  38. E. Erkut & J. Zhang, 1996. "The maximum collection problem with time‐dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(5), pages 749-763, August.
  39. Keskin, Burcu B. & Li, Shirley (Rong) & Steil, Dana & Spiller, Sarah, 2012. "Analysis of an integrated maximum covering and patrol routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 215-232.
  40. Paul, J. & Agatz, N.A.H. & Spliet, R. & de Koster, M.B.M., 2017. "Shared Capacity Routing Problem – An Omni-channel Retail Study," ERIM Report Series Research in Management ERS-2017-012-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  41. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
  42. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.
  43. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
  44. Alejandro Estrada-Moreno & Albert Ferrer & Angel A. Juan & Javier Panadero & Adil Bagirov, 2020. "The Non-Smooth and Bi-Objective Team Orienteering Problem with Soft Constraints," Mathematics, MDPI, vol. 8(9), pages 1-16, September.
  45. Erika M. Herrera & Javier Panadero & Patricia Carracedo & Angel A. Juan & Elena Perez-Bernabeu, 2022. "Determining Reliable Solutions for the Team Orienteering Problem with Probabilistic Delays," Mathematics, MDPI, vol. 10(20), pages 1-15, October.
  46. Markus Sinnl, 2021. "Mixed-integer programming approaches for the time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 497-542, June.
  47. Mei, Yi & Salim, Flora D. & Li, Xiaodong, 2016. "Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 443-457.
  48. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
  49. Deitch, Ray & Ladany, Shaul P., 2000. "The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm," European Journal of Operational Research, Elsevier, vol. 127(1), pages 69-77, November.
  50. He, Mu & Wu, Qinghua & Benlic, Una & Lu, Yongliang & Chen, Yuning, 2024. "An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem," European Journal of Operational Research, Elsevier, vol. 318(3), pages 778-801.
  51. Evers, L. & Glorie, K.M. & van der Ster, S. & Barros, A.I. & Monsuur, H., 2012. "The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared," Econometric Institute Research Papers EI 2012-21, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  52. Álvarez-Miranda, Eduardo & Luipersbeck, Martin & Sinnl, Markus, 2018. "Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems," European Journal of Operational Research, Elsevier, vol. 265(2), pages 779-794.
  53. Angelelli, E. & Archetti, C. & Vindigni, M., 2014. "The Clustered Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 404-414.
  54. Florio, Alexandre M. & Feillet, Dominique & Hartl, Richard F., 2018. "The delivery problem: Optimizing hit rates in e-commerce deliveries," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 455-472.
  55. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
  56. Qinxiao Yu & Yossiri Adulyasak & Louis-Martin Rousseau & Ning Zhu & Shoufeng Ma, 2022. "Team Orienteering with Time-Varying Profit," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 262-280, January.
  57. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
  58. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
  59. Vansteenwegen, Pieter & Souffriau, Wouter & Berghe, Greet Vanden & Oudheusden, Dirk Van, 2009. "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 118-127, July.
  60. Divsalar, A. & Vansteenwegen, P. & Sörensen, K. & Cattrysse, D., 2014. "A memetic algorithm for the orienteering problem with hotel selection," European Journal of Operational Research, Elsevier, vol. 237(1), pages 29-49.
  61. R Baldacci & E Bartolini & G Laporte, 2010. "Some applications of the generalized vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1072-1077, July.
  62. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
  63. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
  64. Michael D. Moskal & Erdi Dasdemir & Rajan Batta, 2023. "Unmanned Aerial Vehicle Information Collection Missions with Uncertain Characteristics," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 120-137, January.
  65. S Rojanasoonthon & J F Bard & S D Reddy, 2003. "Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 806-821, August.
  66. Johannes Schmidt & Armin Fügenschuh, 2023. "A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles," Computational Optimization and Applications, Springer, vol. 85(1), pages 293-335, May.
  67. Rodríguez, Beatriz & Molina, Julián & Pérez, Fátima & Caballero, Rafael, 2012. "Interactive design of personalised tourism routes," Tourism Management, Elsevier, vol. 33(4), pages 926-940.
  68. Lu, Yongliang & Benlic, Una & Wu, Qinghua, 2018. "A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints," European Journal of Operational Research, Elsevier, vol. 268(1), pages 54-69.
  69. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
  70. Shih-Wei Lin & Sirui Guo & Wen-Jie Wu, 2024. "Applying the Simulated Annealing Algorithm to the Set Orienteering Problem with Mandatory Visits," Mathematics, MDPI, vol. 12(19), pages 1-24, October.
  71. Eva Barrena & David Canca & Leandro C. Coelho & Gilbert Laporte, 2023. "Analysis of the selective traveling salesman problem with time-dependent profits," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 165-193, April.
  72. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
  73. Amiri, Mosleh & Farvaresh, Hamid, 2023. "Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities," European Journal of Operational Research, Elsevier, vol. 304(2), pages 596-617.
  74. Euler, Ricardo & Maristany de las Casas, Pedro, 2024. "Labeling methods for partially ordered paths," European Journal of Operational Research, Elsevier, vol. 318(1), pages 19-30.
  75. Hu, Qian & Lim, Andrew, 2014. "An iterative three-component heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 232(2), pages 276-286.
  76. Wei Zhang & Kai Wang & Shuaian Wang & Gilbert Laporte, 2020. "Clustered coverage orienteering problem of unmanned surface vehicles for water sampling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(5), pages 353-367, August.
  77. Labeat Arbneshi & Kadri Sylejmani & Ndriçim Halili & Erzen Krasniqi, 2023. "Automated Slideshow Design from a Set of Photos Based on a Hybrid Metaheuristic Approach," SN Operations Research Forum, Springer, vol. 4(4), pages 1-28, December.
  78. Yücel, E. & Salman, F.S. & Gel, E.S. & Örmeci, E.L. & Gel, A., 2013. "Optimizing specimen collection for processing in clinical testing laboratories," European Journal of Operational Research, Elsevier, vol. 227(3), pages 503-514.
  79. Kataoka, Seiji & Yamada, Takeo & Morito, Susumu, 1998. "Minimum directed 1-subtree relaxation for score orienteering problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 139-153, January.
  80. Zheng, Weimin & Liao, Zhixue & Qin, Jing, 2017. "Using a four-step heuristic algorithm to design personalized day tour route within a tourist attraction," Tourism Management, Elsevier, vol. 62(C), pages 335-349.
  81. Li, Ming & Shao, Saijun & Li, Yang & Zhang, Hua & Zhang, Nianwu & He, Yandong, 2022. "A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests," International Journal of Production Economics, Elsevier, vol. 245(C).
  82. Oleg Shcherbina & Elena Shembeleva, 2014. "Modeling recreational systems using optimization techniques and information technologies," Annals of Operations Research, Springer, vol. 221(1), pages 309-329, October.
  83. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
  84. Paul, Joydeep & Agatz, Niels & Spliet, Remy & Koster, René De, 2019. "Shared Capacity Routing Problem − An omni-channel retail study," European Journal of Operational Research, Elsevier, vol. 273(2), pages 731-739.
  85. Bian, Zheyong & Liu, Xiang, 2018. "A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 246-266.
  86. Erdogan, Günes & Cordeau, Jean-François & Laporte, Gilbert, 2010. "The Attractive Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 59-69, May.
  87. Maya Duque, Pablo A. & Dolinskaya, Irina S. & Sörensen, Kenneth, 2016. "Network repair crew scheduling and routing for emergency relief distribution problem," European Journal of Operational Research, Elsevier, vol. 248(1), pages 272-285.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.