References
- Ben-Tal A, Nemirovski A. 1999. Robust solutions to uncertain programs. Oper Res Lett. 25(1):1–13.
- Bertsimas D, Brown DB, Caramanis C. 2011. Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.
- Bertsimas D, Sim M. 2004. The price of robustness. Oper Res. 52(1):35–53.
- Bian Z, Liu X. 2018. A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach. Transport Res Part E: Logist Transport Rev. 115:246–266.
- Birge JR, Louveaux FV. 1997. Introduction to Stochastic Programming. New York: Springer.
- Borthen T, Loennechen H, Wang X, Fagerholt K, Vidal T. 2017. A genetic search-based heuristic for a fleet size and periodic routing problem with application to offshore supply planning. Eur J Transport Logist. 50(4):195–204.
- Broughton A, Bryan K. 2008. Discrete Fourier analysis and wavelets: applications to signal and image processing. Oxford: WileyBlackwell.
- Calafiore G, Campi MC. 2005. Uncertain convex programs: randomized solutions and confidence levels. Math Program. 102(1):25–46.
- Francis P, Smilowitz K, Tzur M. 2008. The period vehicle routing problem and its extensions: latest advances and new challenges. In Golden BL, Raghavan S, Wasil EA, eds. The vehicle routing problem: latest advances and new challenges. vol. 43, Operations Research/Computer Science Interfaces. New York: Springer, p. 73–102.
- Geletu A, Kloppel M, Hoffmann A, Li P. 2015. A tractable approximation of nonconvex chance-constrained optimization with non-Gaussian uncertainties. Eng Optim. 47(4):495–520.
- Gendreau M, Jabali O, Rei W. 2016. 50th Anniversary invited article - Future research directions in stochastic programming. Transport Sci. 50(4):1163–1173.
- Halvorsen-Weare EE, Fagerholt K. 2011. Robust supply vessel planning. In Pahl J, Reiners T, Voß S, eds. Network Optimization: 5th International Conference, INOC 2011, Hamburg, Germany, June 13–16, 2011. Berlin, Heidelberg: Springer, p. 559–573.
- Hosseini S, Ivanov D, Dolgui A. 2019. Review of quantitative methods for supply chain resilience analysis. Transport Res Part E: Logist Transport Rev. 125:285–307.
- Kenyon AS, Morton DP. 2003. Stochastic vehicle routing with random travel times. Transport Sci. 37(1):69–82.
- Kisialiou Y, Gribkovskaia I, Laporte G. 2018a. The periodic supply vessel planning problem with flexible departure times and coupled vessels. Comput Oper Res. 94:52–64.
- Kisialiou Y, Gribkovskaia I, Laporte G. 2018b. Robust supply vessel routing and scheduling. Transport Res Part C: Emerging Technol. 90:366–378.
- Kisialiou Y, Gribkovskaia I, Laporte G. 2019. Supply vessel routing and scheduling under uncertain demand. Transport Res Part C: Emerging Technol. 104:305–316.
- Kleywegt AJ, Shapiro A, Homem-de-Mello T. 2002. The sample average approximation method for stochastic discrete optimization. SIAM J Optim. 12(2):479–502.
- Laporte G, Louveaux FV, Van Hamme L. 2002. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper Res. 50(3):415–423.
- Linderoth J, Shapiro A, Wright S. 2006. The empirical behavior of sampling methods for stochastic programming. Ann Oper Res. 142(1):215–241.
- Maisiuk Y, Gribkovskaia I. 2014. Fleet sizing for offshore supply vessels with stochastic sailing and service times. Procedia Comput Sci. 31:939–948.
- Nemirovski A, Shapiro A. 2007. Convex approximations of chance constrained programs. SIAM J Optim. 17(4):969–996.
- Norlund EK, Gribkovskaia I, Laporte G. 2015. Supply vessel planning under cost, environment and robustness considerations. Omega. 57:271–281.
- Norlund EK, Gribkovskaia I. 2017. Environmental performance of speed optimization strategies in offshore supply vessel planning under weather uncertainty. Transport Res Part D. 57:10–22.
- Rei W, Gendreau M, Soriano P. 2010. A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transport Sci. 44(1):136–146.
- Ropke S, Pisinger D. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport Sci. 40(4):455–472.
- Shaw P. 1997. A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report, APES Group, Department of Computer Science, University of Strathclyde, Glasgow, United Kingdom.
- Shyshou A, Gribkovskaia I, Laporte G, Fagerholt K. 2012. A large neighbourhood search heuristic for a periodic supply vessel planning problem arising in offshore oil and gas operations. INFOR. 50 (4):195–204.
- Sörensen K, Sevaux M. 2009. A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling. J Math Model Algor. 8(4):387–407.