Robust Team Orienteering Problem with Decreasing Profits

References

• Afsar H, Labadie N (2013) Team orienteering problem with decreasing profits. Electronic Notes Discrete Math. 41(5):285–293.Crossref, Google Scholar
• Agra A, Christiansen M, Figueiredo R, Hvattum LM, Poss M, Requejo C (2013) The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3):856–866.Crossref, Google Scholar
• Alvarez A, Munari P (2017) An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen. Comput. Oper. Res. 83(1):1–12.Crossref, Google Scholar
• Angelelli E, Archetti C, Filippi C, Vindigni M (2017) The probabilistic orienteering problem. Comput. Oper. Res. 81:269–281.Crossref, Google Scholar
• Balcik B, Yanikoğlu İ (2020) A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty. Eur. J. Oper. Res. 282(1):40–57.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bian Z, Liu X (2018) A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach. Transportation Res. Part E: Logist. Trans. Rev. 115:246–266.Crossref, Google Scholar
• Boussier S, Feillet D, Gendreau M (2007) An exact algorithm for team orienteering problems. 4OR 5(3):211–230.Crossref, Google Scholar
• Campbell A, Gendreau M, Thomas B (2011) The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186(1):61–81.Crossref, Google Scholar
• Chao I, Golden B, Wasil E (1996) The team orienteering problem. Eur. J. Oper. Res. 88(3):464–474.Crossref, Google Scholar
• Chen Z, Sim M, Xiong P (2020) Robust stochastic optimization made easy with RSOME. Management Sci. 66(8):3329–3339.Link, Google Scholar
• Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transportation Sci. 53(4):946–985.Link, Google Scholar
• Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342–354.Link, Google Scholar
• Dewilde T, Cattrysse D, Coene S, Spieksma FCR, Vansteenwegen P (2013) Heuristics for the traveling repairman problem with profits. Comput. Oper. Res. 40(7):1700–1707.Crossref, Google Scholar
• Dolinskaya I, Shi ZE, Smilowitz K (2018) Adaptive orienteering problem with stochastic travel times. Transportation Res. Part E: Logist. Trans. Rev. 109(3):1–19.Google Scholar
• Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. 42(5):977–978.Link, Google Scholar
• Ekici A, Retharekar A (2013) Multiple agents maximum collection problem with time dependent rewards. Comput. Indust. Engrg. 64(4):1009–1018.Crossref, Google Scholar
• Evers L, Barros AI, Monsuur H, Wagelmans A (2014a) Online stochastic UAV mission planning with time windows and time-sensitive targets. Eur. J. Oper. Res. 238(1):348–362.Crossref, Google Scholar
• Evers L, Dollevoet T, Barros AI, Monsuur H (2014b) Robust UAV mission planning. Ann. Oper. Res. 222(1):293–315.Crossref, Google Scholar
• Evers L, Glorie K, van der Ster S, Barros AI, Monsuur H (2014c) A two-stage approach to the orienteering problem with stochastic weights. Comput. Oper. Res. 43:248–260.Crossref, Google Scholar
• Feillet D (2010) A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR 8(4):407–424.Crossref, Google Scholar
• Houck D, Picard J, Queyranne M, Vemuganti R (1980) The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. Opsearch 17:93–109.Google Scholar
• İlhan T, Iravani SMR, Daskin MS (2008) The orienteering problem with stochastic profits. IIE Trans. 40(4):406–421.Crossref, Google Scholar
• INSARAG (2020) INSARAG Guidelines 2020–vol. II: Preparedness and Response (The International Search and Rescue Advisory Group, Geneva).Google Scholar
• Irnich S, Villeneuve D (2006) The shortest-path problem with resource constraints and k–cycle elimination for k≥3. INFORMS J. Comput. 18(3):391–406.Link, Google Scholar
• Jesper L (1999) Parallelization of the vehicle routing problem with time windows. Unpublished doctoral thesis, IMM-DTU Technical University of Denmark, Lyngby, Denmark.Google Scholar
• Jin H, Thomas BW (2019) Team orienteering with uncertain rewards and service times with an application to phlebotomist intrahospital routing. Networks 73(4):453–465.Crossref, Google Scholar
• Kohl N (1995) Exact methods for time constrained routing and related scheduling problems. Unpublished doctoral thesis, Technical University of Denmark, Lyngby, Denmark.Google Scholar
• Liao Z, Zheng W (2018) Using a heuristic algorithm to design a personalized day tour route in a time-dependent stochastic environment. Tourism Management 68:284–300.Crossref, Google Scholar
• Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. ACM 7(4):326–329.Crossref, Google Scholar
• Moreno A, Munari P, Alem D (2020) Decomposition-based algorithms for the crew scheduling and routing problem in road restoration. Comput. Oper. Res. 119:104935.Crossref, Google Scholar
• Munari P, Moreno A, De La Vega J, Alem D, Gondzio J, Morabito R (2019) The robust vehicle routing problem with time windows: Compact formulation and branch-price-and-cut method. Transportation Sci. 53(4):1043–1066.Link, Google Scholar
• Papapanagiotou V, Montemanni R, Gambardella LM (2016) A sampling-based metaheuristic for the orienteering problem with stochastic travel times. Martin-Vide C, Mizuki T, Vega-Rodriguez M, eds. Theory and Practice of Natural Computing, Lecture Notes in Computer Science, vol. 10071 (Springer, Cham), 97–109.Crossref, Google Scholar
• Saif A, Delage E (2021) Data-driven distributionally robust capacitated facility location problem. Eur. J. Oper. Res. 291(3):995–1007.Crossref, Google Scholar
• Santini A, Plum CEM, Ropke S (2018) A branch-and-price approach to the feeder network design problem. Eur. J. Oper. Res. 264(2):607–622.Crossref, Google Scholar
• Smith JE, Winkler RL (2006) The optimizer’s curse: Skepticism and postdecision surprise in decision analysis. Management Sci. 52(3):311–322.Link, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Song Y, Ulmer MW, Thomas BW, Wallace SW (2020) Building trust in home services–stochastic team-orienteering with consistency constraints. Transportation Sci. 54(3):823–838.Link, Google Scholar
• Tang H, Miller-Hooks E (2005) Algorithms for a stochastic selective travelling salesperson problem. J. Oper. Res. Soc. 56(4):439–452.Crossref, Google Scholar
• Tang H, Miller-Hooks E, Tomastik R (2007) Scheduling technicians for planned maintenance of geographically distributed equipment. Transp. Res. Part E Logist. Trans. Rev. 43(5):591–609.Crossref, Google Scholar
• Varakantham P, Kumar A, Lau HC, Yeoh W (2018) Risk-sensitive stochastic orienteering problems for trip optimization in urban environments. ACM Trans. Intelligent Systems Tech. 9(3):1–25.Crossref, Google Scholar
• Verbeeck C, Vansteenwegen P, Aghezzaf EH (2016) Solving the stochastic time-dependent orienteering problem with time windows. Eur. J. Oper. Res. 255(3):699–718.Crossref, Google Scholar
• Yu Q, Adulyasak Y, Rousseau LM, Zhu N, Ma S (2022) Team orienteering with time-varying profit. INFORMS J. Comput. 34(1):262–280.Link, Google Scholar
• Zhang S, Ohlmann JW, Thomas BW (2014) A priori orienteering with time windows and stochastic wait times at customers. Eur. J. Oper. Res. 239(1):70–79.Crossref, Google Scholar
• Zhang S, Ohlmann JW, Thomas BW (2018) Dynamic orienteering on a network of queues. Transportation Sci. 52(3):691–706.Link, Google Scholar
• Zhang S, Ohlmann JW, Thomas BW (2020) Multi-period orienteering with uncertain adoption likelihood and waiting at customers. Eur. J. Oper. Res. 282(1):288–303.Crossref, Google Scholar