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

A biobjective approach to recoverable robustness based on location planning

Author

Listed:
  • Carrizosa, Emilio
  • Goerigk, Marc
  • Schöbel, Anita

Abstract

Finding robust solutions of an optimization problem is an important issue in practice, and various concepts on how to define the robustness of a solution have been suggested. The idea of recoverable robustness requires that a solution can be recovered to a feasible one as soon as the realized scenario becomes known. The usual approach in the literature is to minimize the objective function value of the recovered solution in the nominal or in the worst case.

Suggested Citation

  • Carrizosa, Emilio & Goerigk, Marc & Schöbel, Anita, 2017. "A biobjective approach to recoverable robustness based on location planning," European Journal of Operational Research, Elsevier, vol. 261(2), pages 421-435.
    • Handle: RePEc:eee:ejores:v:261:y:2017:i:2:p:421-435
    DOI: 10.1016/j.ejor.2017.02.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717301200
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.02.014?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

    for a different version of it.

    References listed on IDEAS

    as
    1. F. Plastria & E. Carrizosa, 2001. "Gauge Distances and Median Hyperplanes," Journal of Optimization Theory and Applications, Springer, vol. 110(1), pages 173-182, July.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Guastaroba, Gianfranco & Mansini, Renata & Speranza, M. Grazia, 2009. "On the effectiveness of scenario generation techniques in single-period portfolio optimization," European Journal of Operational Research, Elsevier, vol. 192(2), pages 500-511, January.
    4. Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
    5. Constantine Toregas & Ralph Swain & Charles ReVelle & Lawrence Bergman, 1971. "The Location of Emergency Service Facilities," Operations Research, INFORMS, vol. 19(6), pages 1363-1373, October.
    6. James E. Ward & Richard E. Wendell, 1985. "Using Block Norms for Location Modeling," Operations Research, INFORMS, vol. 33(5), pages 1074-1090, October.
    7. 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.
    8. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    9. Valentina Cacchiani & Alberto Caprara & Laura Galli & Leo Kroon & Gábor Maróti & Paolo Toth, 2012. "Railway Rolling Stock Planning: Robustness Against Large Disruptions," Transportation Science, INFORMS, vol. 46(2), pages 217-232, May.
    10. J. Brimberg & G.O. Wesolowsky, 2002. "Minisum Location with Closest Euclidean Distances," Annals of Operations Research, Springer, vol. 111(1), pages 151-165, March.
    11. 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.
    12. Goerigk, Marc & Deghdak, Kaouthar & T’Kindt, Vincent, 2015. "A two-stage robustness approach to evacuation planning with buses," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 66-82.
    13. Aharon Ben-Tal & Dick den Hertog & Anja De Waegenaere & Bertrand Melenberg & Gijs Rennen, 2013. "Robust Solutions of Optimization Problems Affected by Uncertain Probabilities," Management Science, INFORMS, vol. 59(2), pages 341-357, April.
    14. R. Horst & N. V. Thoai, 1999. "DC Programming: Overview," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 1-43, October.
    15. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    16. Alberto Caprara & Laura Galli & Sebastian Stiller & Paolo Toth, 2014. "Delay-Robust Event Scheduling," Operations Research, INFORMS, vol. 62(2), pages 274-283, April.
    17. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    18. Rafael Blanquero & Emilio Carrizosa & Pierre Hansen, 2009. "Locating Objects in the Plane Using Global Optimization Techniques," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 837-858, November.
    19. 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.
    20. Serafino Cicerone & Gianlorenzo D’Angelo & Gabriele Stefano & Daniele Frigioni & Alfredo Navarra, 2009. "Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases," Journal of Combinatorial Optimization, Springer, vol. 18(3), pages 229-257, October.
    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. 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.
    2. 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).

    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. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    2. Jonas Ide & Anita Schöbel, 2016. "Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 235-271, January.
    3. 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).
    4. Raith, Andrea & Schmidt, Marie & Schöbel, Anita & Thom, Lisa, 2018. "Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty," European Journal of Operational Research, Elsevier, vol. 267(2), pages 628-642.
    5. Alberto Pajares & Xavier Blasco & Juan Manuel Herrero & Javier Sanchis & Raúl Simarro, 2024. "Designing Decentralized Multi-Variable Robust Controllers: A Multi-Objective Approach Considering Nearly Optimal Solutions," Mathematics, MDPI, vol. 12(13), pages 1-21, July.
    6. 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.
    7. Soudabeh Seyyedi Ghomi & Fahimeh Baroughi, 2024. "Robust vertex centdian facility location problem on tree networks," Annals of Operations Research, Springer, vol. 341(2), pages 1135-1149, October.
    8. Alberto Caprara & Laura Galli & Sebastian Stiller & Paolo Toth, 2014. "Delay-Robust Event Scheduling," Operations Research, INFORMS, vol. 62(2), pages 274-283, April.
    9. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    10. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    11. Detienne, Boris & Lefebvre, Henri & Malaguti, Enrico & Monaci, Michele, 2024. "Adjustable robust optimization with objective uncertainty," European Journal of Operational Research, Elsevier, vol. 312(1), pages 373-384.
    12. Fang Xu & Mengfan Yan & Lun Wang & Shaojian Qu, 2022. "The Robust Emergency Medical Facilities Location-Allocation Models under Uncertain Environment: A Hybrid Approach," Sustainability, MDPI, vol. 15(1), pages 1-23, December.
    13. Gianfranco Guastaroba & Gautam Mitra & M Grazia Speranza, 2011. "Investigating the effectiveness of robust portfolio optimization techniques," Journal of Asset Management, Palgrave Macmillan, vol. 12(4), pages 260-280, September.
    14. Klamroth, Kathrin & Köbis, Elisabeth & Schöbel, Anita & Tammer, Christiane, 2017. "A unified approach to uncertain optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 403-420.
    15. Guevara, Esnil & Babonneau, Fréderic & Homem-de-Mello, Tito & Moret, Stefano, 2020. "A machine learning and distributionally robust optimization framework for strategic energy planning under uncertainty," Applied Energy, Elsevier, vol. 271(C).
    16. 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.
    17. Erin K. Doolittle & Hervé L. M. Kerivin & Margaret M. Wiecek, 2018. "Robust multiobjective optimization with application to Internet routing," Annals of Operations Research, Springer, vol. 271(2), pages 487-525, December.
    18. Joel Goh & Melvyn Sim, 2011. "Robust Optimization Made Easy with ROME," Operations Research, INFORMS, vol. 59(4), pages 973-985, August.
    19. 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.
    20. 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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:ejores:v:261:y:2017:i:2:p:421-435. 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.