IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v7y2020ics2214716020300403.html
   My bibliography  Save this article

Robust modeling and planning: Insights from three industrial applications

Author

Listed:
  • Marla, Lavanya
  • Rikun, Alexander
  • Stauffer, Gautier
  • Pratsini, Eleni

Abstract

Optimization under uncertainty has been a well-studied field, with significant interest generated in this field in the past four decades. This paper is both practical and expository -- its purpose is to: discuss the process of generating robust solutions, highlight issues that arise in practice, and discuss ways to address such issues. For illustrative purposes, we study three different, commonly adopted, approaches for optimization under uncertainty (chance-constrained programming, robust optimization and conditional value at risk); and apply these approaches to three real-world application-based case studies. Our case studies are chosen to span a variety of problem characteristics. For each case study, we discuss the applicability of each of the three approaches, practical issues that arose during application, and robustness and further characteristics of the subsequent solutions. We point out associated advantages and limitations, and illustrate the gap between the theoretical and actual performance of these approaches for each case study. We also discuss how some of the discovered limitations can be overcome using extensions of the approaches or through a better understanding of the data. We conclude by summarizing common and generalizable insights obtained across the three case studies. Our findings suggest the effectiveness of solutions is dependent on: the methods, the size of the problem, the underlying pattern of uncertainty in data, and the metrics of interest. While we provide some guidelines to identify the most suitable approach to a given problem, our experience matches theory to suggest that under carefully tuned parameters accompanied by simulation, the different approaches can generate results that are similar and provide comparable tradeoffs between the mean and robustness metric. However, this could also require considerable tuning requiring experience, and we provide some guidelines to achieve such results. This illustrates that generating high quality robust solutions is both an art and a science.

Suggested Citation

  • Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
  • Handle: RePEc:eee:oprepe:v:7:y:2020:i:c:s2214716020300403
    DOI: 10.1016/j.orp.2020.100150
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716020300403
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.orp.2020.100150?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bruce L. Miller & Harvey M. Wagner, 1965. "Chance Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 13(6), pages 930-945, December.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Trindade, A. Alexandre & Uryasev, Stan & Shapiro, Alexander & Zrazhevsky, Grigory, 2007. "Financial prediction with constrained tail risk," Journal of Banking & Finance, Elsevier, vol. 31(11), pages 3524-3538, November.
    4. Chiwei Yan & Jerry Kung, 2018. "Robust Aircraft Routing," Transportation Science, INFORMS, vol. 52(1), pages 118-133, January.
    5. Gerald G. Brown & Richard E. Rosenthal, 2010. "Optimization Tradecraft: Hard-Won Insights from Real-World Decision Support," International Series in Operations Research & Management Science, in: ManMohan S. Sodhi & Christopher S. Tang (ed.), A Long View of Research and Practice in Operations Research and Management Science, chapter 0, pages 99-114, Springer.
    6. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    7. Yingjie Lan & Huina Gao & Michael O. Ball & Itir Karaesmen, 2008. "Revenue Management with Limited Demand Information," Management Science, INFORMS, vol. 54(9), pages 1594-1609, September.
    8. Chaithanya Bandi & Dimitris Bertsimas & Nataly Youssef, 2015. "Robust Queueing Theory," Operations Research, INFORMS, vol. 63(3), pages 676-700, June.
    9. Koenig, Matthias & Meissner, Joern, 2010. "List pricing versus dynamic pricing: Impact on the revenue risk," European Journal of Operational Research, Elsevier, vol. 204(3), pages 505-512, August.
    10. R. Jagannathan, 1974. "Chance-Constrained Programming with Joint Constraints," Operations Research, INFORMS, vol. 22(2), pages 358-372, April.
    11. Peter Kall & János Mayer, 2005. "Stochastic Linear Programming," International Series in Operations Research and Management Science, Springer, number 978-0-387-24440-2, December.
    12. Lloyd Clarke & Ellis Johnson & George Nemhauser & Zhongxi Zhu, 1997. "The aircraft rotation problem," Annals of Operations Research, Springer, vol. 69(0), pages 33-46, January.
    13. Youhua (Frank) Chen & Minghui Xu & Zhe George Zhang, 2009. "Technical Note---A Risk-Averse Newsvendor Model Under the CVaR Criterion," Operations Research, INFORMS, vol. 57(4), pages 1040-1044, August.
    14. Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2009. "Robust Optimization for Empty Repositioning Problems," Operations Research, INFORMS, vol. 57(2), pages 468-483, April.
    15. Dimitris Bertsimas & Aurélie Thiele, 2006. "A Robust Optimization Approach to Inventory Theory," Operations Research, INFORMS, vol. 54(1), pages 150-168, February.
    16. Paat Rusmevichientong & Huseyin Topaloglu, 2012. "Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model," Operations Research, INFORMS, vol. 60(4), pages 865-882, August.
    17. A. Charnes & W. W. Cooper & G. H. Symonds, 1958. "Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil," Management Science, INFORMS, vol. 4(3), pages 235-263, April.
    18. Shan Lan & John-Paul Clarke & Cynthia Barnhart, 2006. "Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions," Transportation Science, INFORMS, vol. 40(1), pages 15-28, February.
    19. Siqian Shen & Murat Kurt & Jue Wang, 2015. "Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 301-316, May.
    20. Mulvey, John M. & Erkan, Hafize G., 2006. "Applying CVaR for decentralized risk management of financial companies," Journal of Banking & Finance, Elsevier, vol. 30(2), pages 627-644, February.
    21. Lejeune, Miguel A. & Shen, Siqian, 2016. "Multi-objective probabilistically constrained programs with variable risk: Models for multi-portfolio financial optimization," European Journal of Operational Research, Elsevier, vol. 252(2), pages 522-539.
    22. Panda, D. & Kar, S. & Maity, K. & Maiti, M., 2008. "A single period inventory model with imperfect production and stochastic demand under chance and imprecise constraints," European Journal of Operational Research, Elsevier, vol. 188(1), pages 121-139, July.
    23. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    24. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    25. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    26. Milind Sohoni & Yu-Ching Lee & Diego Klabjan, 2011. "Robust Airline Scheduling Under Block-Time Uncertainty," Transportation Science, INFORMS, vol. 45(4), pages 451-464, November.
    27. Dimitris Bertsimas & David B. Brown, 2009. "Constructing Uncertainty Sets for Robust Linear Optimization," Operations Research, INFORMS, vol. 57(6), pages 1483-1495, December.
    28. Yongjia Song & James R. Luedtke & Simge Küçükyavuz, 2014. "Chance-Constrained Binary Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 735-747, November.
    29. Dan A. Iancu & Nikolaos Trichakis, 2014. "Pareto Efficiency in Robust Optimization," Management Science, INFORMS, vol. 60(1), pages 130-147, January.
    30. A. Charnes & W. W. Cooper, 1959. "Chance-Constrained Programming," Management Science, INFORMS, vol. 6(1), pages 73-79, October.
    31. Philippe Artzner & Freddy Delbaen & Jean‐Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228, July.
    32. Georgia Perakis & Guillaume Roels, 2010. "Robust Controls for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 56-76, November.
    33. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    34. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    35. Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
    36. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    37. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    38. Stavros Lopatatzidis & Jasper Bock & Gert Cooman & Stijn Vuyst & Joris Walraevens, 2016. "Robust queueing theory: an initial study using imprecise probabilities," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 75-101, February.
    39. M. C. Campi & S. Garatti, 2011. "A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 257-280, February.
    40. Vijay S. Bawa, 1973. "On Chance Constrained Programming Problems with Joint Constraints," Management Science, INFORMS, vol. 19(11), pages 1326-1331, July.
    41. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    42. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    43. D. Goldfarb & G. Iyengar, 2003. "Robust Portfolio Selection Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 1-38, February.
    44. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. George Mavrotas & Evangelos Makryvelios, 2023. "R&D project portfolio selection using the Iterative Trichotomic Approach in order to study how subjectivity of the weights is reflected in the selected projects of the final portfolio," Operational Research, Springer, vol. 23(3), pages 1-18, September.
    2. Zhao, Ai & Bard, Jonathan F. & Bickel, J. Eric, 2023. "A two-stage approach to aircraft recovery under uncertainty," Journal of Air Transport Management, Elsevier, vol. 111(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    2. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    3. Shao-Wei Lam & Tsan Sheng Ng & Melvyn Sim & Jin-Hwa Song, 2013. "Multiple Objectives Satisficing Under Uncertainty," Operations Research, INFORMS, vol. 61(1), pages 214-227, February.
    4. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    5. Liu, Kanglin & Li, Qiaofeng & Zhang, Zhi-Hai, 2019. "Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 79-101.
    6. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    7. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    8. Hua Sun & Ziyou Gao & W. Szeto & Jiancheng Long & Fangxia Zhao, 2014. "A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem under Demand Uncertainty," Networks and Spatial Economics, Springer, vol. 14(3), pages 409-433, December.
    9. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    10. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    11. Andrew J. Keith & Darryl K. Ahner, 2021. "A survey of decision making and optimization under uncertainty," Annals of Operations Research, Springer, vol. 300(2), pages 319-353, May.
    12. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).
    13. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    14. Alireza Ghahtarani & Ahmed Saif & Alireza Ghasemi, 2022. "Robust portfolio selection problems: a comprehensive review," Operational Research, Springer, vol. 22(4), pages 3203-3264, September.
    15. Huan Xu & Constantine Caramanis & Shie Mannor, 2012. "Optimization Under Probabilistic Envelope Constraints," Operations Research, INFORMS, vol. 60(3), pages 682-699, June.
    16. Wei Liu & Li Yang & Bo Yu, 2021. "KDE distributionally robust portfolio optimization with higher moment coherent risk," Annals of Operations Research, Springer, vol. 307(1), pages 363-397, December.
    17. Alireza Ghahtarani & Ahmed Saif & Alireza Ghasemi, 2021. "Robust Portfolio Selection Problems: A Comprehensive Review," Papers 2103.13806, arXiv.org, revised Jan 2022.
    18. Fernandes, Betina & Street, Alexandre & Valladão, Davi & Fernandes, Cristiano, 2016. "An adaptive robust portfolio optimization model with loss constraints based on data-driven polyhedral uncertainty sets," European Journal of Operational Research, Elsevier, vol. 255(3), pages 961-970.
    19. Lotfi, Somayyeh & Zenios, Stavros A., 2018. "Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances," European Journal of Operational Research, Elsevier, vol. 269(2), pages 556-576.
    20. Han, Biao & Shang, Chao & Huang, Dexian, 2021. "Multiple kernel learning-aided robust optimization: Learning algorithm, computational tractability, and usage in multi-stage decision-making," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1004-1018.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:oprepe:v:7:y:2020:i:c:s2214716020300403. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.