EDP Sciences logo
Subscriber Authentication Point
Sciengine logo
Search
Menu
All issues Volume 60 / No 2 (March-April 2026) RAIRO-Oper. Res., 60 2 (2026) 625-642 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 60, Number 2, March-April 2026
Page(s) 625 - 642
DOI https://doi.org/10.1051/ro/2025160
Published online 27 March 2026
  • A.A. Aazami and M. Saidi-Mehrabad, Benders decomposition algorithm for robust aggregate production planning considering pricing decisions in competitive environment: a case study. Sci. Iranica 26 (2019) 3007–3031. [Google Scholar]
  • A. Aazami and M. Saidi-Mehrabad, A production and distribution planning of perishable products with a fixed lifetime under vertical competition in the seller-buyer systems: a real-world application. J. Manuf. Syst. 58 (2021) 223–247. [CrossRef] [Google Scholar]
  • R.M. Apap and I.E. Grossmann, Models and computational strategies for multistage stochastic programming under endogenous and exogenous uncertainties. Comput. Chem. Eng. 103 (2017) 233–274. [Google Scholar]
  • A.M. Campbell, M. Gendreau and B.W. Thomas, The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186 (2011) 61–81. [Google Scholar]
  • I. Dolinskaya, Z.E. Shi and K. Smilowitz, Adaptive orienteering problem with stochastic travel times. Transp. Res. Part E-Logistics Transp. Rev. 109 (2018) 1–19. [Google Scholar]
  • L. Evers, T. Dollevoet, A.I. Barros and H. Monsuur, Robust UAV mission planning. Ann. Oper. Res. 222 (2014) 293–315. [Google Scholar]
  • L. Evers, K. Glorie, S. van der Ster, A.I. Barros and H. Monsuur, A two-stage approach to the orienteering problem with stochastic weights. Comput. Oper. Res. 43 (2014) 248–260. [CrossRef] [MathSciNet] [Google Scholar]
  • B.L. Golden, Q. Wang and L. Liu, A multifaceted heuristic for the orienteering problem. Nav. Res. Logistics (NRL) 35 (1988) 359–366. https://onlinelibrary.wiley.com/doi/abs/10.1002/1520-6750%28198806%2935%3A3%3C359%3A%3AAID-NAV3220350305%3E3.0.CO%3B2-H. [Google Scholar]
  • A. Goli, A. Aazami and A. Jabbarzadeh, Accelerated cuckoo optimization algorithm for capacitated vehicle routing problem in competitive conditions. Int. J. Artif. Intell. 16 (2018) 88–112. https://api.semanticscholar.org/CorpusID:64860002. [Google Scholar]
  • A. Gunawan, H.C. Lau and P. Vansteenwegen, Orienteering problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255 (2016) 315–332. [CrossRef] [Google Scholar]
  • M. Heydari and A. Aazami, Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times. J. Ind. Syst. Eng. 11 (2018) 134–150. [Google Scholar]
  • Y. Hua, T. Che, C. Yang and M. Hu, Customer no-show reduction in web-based appointment service: investigations of non-attendance behaviors. Serv. Ind. J. 44 (2024) 538–562. [Google Scholar]
  • T. Ilhan, S.M.R. Iravani and M.S. Daskin, The orienteering problem with stochastic profits. IIE Trans. 40 (2008) 406–421. [Google Scholar]
  • L. Ke, Z. Xu, Z. Feng, K. Shang and X. Qian, Proportion-based robust optimization and team orienteering problem with interval data. Eur. J. Oper. Res. 226 (2013) 19–31. [Google Scholar]
  • M.H. Kolaee and S.M.J.M. Al-e Hashem, Stochastic medical tourism problem with variable residence time considering gravity function. RAIRO-Oper. Res. 56 (2022) 1685–1716. [Google Scholar]
  • J. Li, Z. Zhang, D. Song, B. Yang and L. Zhou, Cruise onboard itinerary planning for multi passengers with service venue capacity and time-window constraints. Comput. Oper. Res. 176 (2025) 106944. [Google Scholar]
  • X.-G. Luo, X.-R. Liu, P.-L. Ji, X.-Z. Shang and Z.-L. Zhang, Trip planning for visitors in a service system with capacity constraints. Comput. Oper. Res. 148 (2022) 105974. [Google Scholar]
  • A. Makui, M. Heydari, A. Aazami and E. Dehghani, Accelerating benders decomposition approach for robust aggregate production planning of products with a very limited expiration date. Comput. Ind. Eng. 100 (2016) 34–51. [Google Scholar]
  • M.S. Mehrabad, A. Aazami and A. Goli, A location-allocation model in the multi-level supply chain with multi-objective evolutionary approach. J. Ind. Syst. Eng. 10 (2017) 140–160. [Google Scholar]
  • V. Norkin, G. Pflug and A. Ruszczyński, A branch and bound method for stochastic global optimization. Math. Program. Ser. B 83 (1998) 425–450. [Google Scholar]
  • A. Shapiro, Inference of statistical bounds for multistage stochastic programming problems. Mathematical Methods Of Oper. Res. 58 (2003) 57–68. [Google Scholar]
  • J. Slootweg, R. van der Mei, C.J. Jagtenberg and F. Ottenhof, Centralized multi-visitor trip planning with activity reservations in crowded destinations. Comput. Oper. Res. 167 (2024) 106633. [Google Scholar]
  • S. Solak, J.-P.B. Clarke, E.L. Johnson and E.R. Barnes, Optimization of R&D project portfolios under endogenous uncertainty. Eur. J. Oper. Res. 207 (2010) 420–433. [Google Scholar]
  • H. Tang and E. Miller-Hooks, Algorithms for a stochastic selective travelling salesperson problem. J. Oper. Res. Soc. 56 (2005) 439–452. [CrossRef] [Google Scholar]
  • S.Y. Teng, H.L. Ong and H.C. Huang, An integer I-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times. Asia-Pac. J. Oper. Res. 21 (2004) 241–257. [Google Scholar]
  • T. Tsiligiridis, Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35 (1984) 797–809. [Google Scholar]
  • N.S.S.S.N. Usha Devi and R. Mohan, VNSMAS: a constraint-based portfolio profit maximization. Comput. Oper. Res. 170 (2024) 106769. [Google Scholar]
  • P. Vansteenwegen, W. Souffriau and D. Van Oudheusden, The orienteering problem: a survey. Eur. J. Oper. Res. 209 (2011) 1–10. [CrossRef] [Google Scholar]
  • J. Wang, J. Guo, J. Chen, S. Tian and T. Gu, Uncertain team orienteering problem with time windows based on uncertainty theory. IEEE Access 7 (2019) 63403–63414. [Google Scholar]
  • W. Wang, H.C. Lau and S.-F. Cheng, Exact and heuristic approaches for the multi-agent orienteering prob-lem with capacity constraints, in 2017 IEEE Symposium Series on Computational Intelligence (SSCI) (2017). doi: 10.1109/SSCI.2017.8285329. [Google Scholar]
  • L. Xinrui, L. Xinggang, J. Pengli, Z. Zhongliang and Y. Hu, Java code for “a two-stage approach to the multiple-agent orienteering problem with stochastic weight and capacity constraints“ (2025). https://github.com/darkness399/A-TWO-STAGE-APPROACH-TO-THE-MAOPCCSW. [Google Scholar]
  • Q. Yu, C. Cheng and N. Zhu, Robust team orienteering problem with decreasing profits. INFORMS J. Comput. 34 (2022) 3215–3233. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.