IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v264y2018i3p837-846.html
   My bibliography  Save this article

Ranking robustness and its application to evacuation planning

Author

Listed:
  • Goerigk, Marc
  • Hamacher, Horst W.
  • Kinscherff, Anika

Abstract

We present a new approach to handle uncertain combinatorial optimization problems that uses solution ranking procedures to determine the degree of robustness of a solution. Unlike classic concepts for robust optimization, our approach is not purely based on absolute quantitative performance, but also includes qualitative aspects that are of major importance for the decision maker.

Suggested Citation

  • Goerigk, Marc & Hamacher, Horst W. & Kinscherff, Anika, 2018. "Ranking robustness and its application to evacuation planning," European Journal of Operational Research, Elsevier, vol. 264(3), pages 837-846.
    • Handle: RePEc:eee:ejores:v:264:y:2018:i:3:p:837-846
    DOI: 10.1016/j.ejor.2016.05.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716303745
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.05.037?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. André Chassein & Marc Goerigk, 2016. "Performance Analysis in Robust Optimization," International Series in Operations Research & Management Science, in: Michael Doumpos & Constantin Zopounidis & Evangelos Grigoroudis (ed.), Robustness Analysis in Decision Aiding, Optimization, and Analytics, chapter 0, pages 145-170, Springer.
    2. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    3. Dan A. Iancu & Nikolaos Trichakis, 2014. "Pareto Efficiency in Robust Optimization," Management Science, INFORMS, vol. 60(1), pages 130-147, January.
    4. Gorissen, Bram L. & Yanıkoğlu, İhsan & den Hertog, Dick, 2015. "A practical guide to robust optimization," Omega, Elsevier, vol. 53(C), pages 124-137.
    5. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    6. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    Full references (including those not matched with items on IDEAS)

    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. Chassein, André & Goerigk, Marc, 2018. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty," European Journal of Operational Research, Elsevier, vol. 269(2), pages 544-555.
    2. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
    3. Annette M. C. Ficker & Frits C. R. Spieksma & Gerhard J. Woeginger, 2018. "Robust balanced optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(3), pages 239-266, September.
    4. Chassein, André & Goerigk, Marc, 2017. "Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets," European Journal of Operational Research, Elsevier, vol. 258(1), pages 58-69.
    5. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    6. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    7. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    8. Viktoryia Buhayenko & Dick den Hertog, 2017. "Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6801-6823, November.
    9. Shin, Youngchul & Moon, Ilkyeong, 2023. "Robust building evacuation planning in a dynamic network flow model under collapsible nodes and arcs," Socio-Economic Planning Sciences, Elsevier, vol. 86(C).
    10. Areesh Mittal & Can Gokalp & Grani A. Hanasusanto, 2020. "Robust Quadratic Programming with Mixed-Integer Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 201-218, April.
    11. Guo, Xiaotong & Caros, Nicholas S. & Zhao, Jinhua, 2021. "Robust matching-integrated vehicle rebalancing in ride-hailing system with uncertain demand," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 161-189.
    12. Botte, Marco & Schöbel, Anita, 2019. "Dominance for multi-objective robust optimization concepts," European Journal of Operational Research, Elsevier, vol. 273(2), pages 430-440.
    13. Marc Goerigk, 2014. "A note on upper bounds to the robust knapsack problem with discrete scenarios," Annals of Operations Research, Springer, vol. 223(1), pages 461-469, December.
    14. Jannis Kurtz, 2018. "Robust combinatorial optimization under budgeted–ellipsoidal uncertainty," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 315-337, December.
    15. Artur Alves Pessoa & Michael Poss & Ruslan Sadykov & François Vanderbeck, 2021. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty," Operations Research, INFORMS, vol. 69(3), pages 739-754, May.
    16. Pätzold, Julius & Schöbel, Anita, 2020. "Approximate cutting plane approaches for exact solutions to robust optimization problems," European Journal of Operational Research, Elsevier, vol. 284(1), pages 20-30.
    17. Ehrgott, Matthias & Ide, Jonas & Schöbel, Anita, 2014. "Minmax robustness for multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 239(1), pages 17-31.
    18. Panos Xidonas & Ralph Steuer & Christis Hassapis, 2020. "Robust portfolio optimization: a categorized bibliographic review," Annals of Operations Research, Springer, vol. 292(1), pages 533-552, September.
    19. Caserta, Marco & Voß, Stefan, 2019. "The robust multiple-choice multidimensional knapsack problem," Omega, Elsevier, vol. 86(C), pages 16-27.
    20. Chassein, André & Goerigk, Marc & Kurtz, Jannis & Poss, Michael, 2019. "Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 279(2), pages 308-319.

    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:ejores:v:264:y:2018:i:3:p:837-846. 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.elsevier.com/locate/eor .

    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.