IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v69y2018i3d10.1007_s10589-017-9956-z.html
   My bibliography  Save this article

A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation

Author

Listed:
  • Sara Mattia

    (Consiglio Nazionale delle Ricerche)

  • Michael Poss

    (Université de Montpellier)

Abstract

We consider the capacity formulation of the Robust Network Loading Problem. The aim of the paper is to study what happens from the theoretical and from the computational point of view when the routing policy (or scheme) changes. The theoretical results consider static, volume, affine and dynamic routing, along with splittable and unsplittable flows. Our polyhedral study provides evidence that some well-known valid inequalities (the robust cutset inequalities) are facets for all the considered routing/flows policies under the same assumptions. We also introduce a new class of valid inequalities, the robust 3-partition inequalities, showing that, instead, they are facets in some settings, but not in others. A branch-and-cut algorithm is also proposed and tested. The computational experiments refer to the problem with splittable flows and the budgeted uncertainty set. We report results on several instances coming from real-life networks, also including historical traffic data, as well as on randomly generated instances. Our results show that the problem with static and volume routing can be solved quite efficiently in practice and that, in many cases, volume routing is cheaper than static routing, thus possibly representing the best compromise between cost and computing time. Moreover, unlikely from what one may expect, the problem with dynamic routing is easier to solve than the one with affine routing, which is hardly tractable, even using decomposition methods.

Suggested Citation

  • Sara Mattia & Michael Poss, 2018. "A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation," Computational Optimization and Applications, Springer, vol. 69(3), pages 753-800, April.
    • Handle: RePEc:spr:coopap:v:69:y:2018:i:3:d:10.1007_s10589-017-9956-z
    DOI: 10.1007/s10589-017-9956-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-017-9956-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-017-9956-z?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. Sara Mattia, 2013. "The robust network loading problem with dynamic routing," Computational Optimization and Applications, Springer, vol. 54(3), pages 619-643, April.
    2. Lemaréchal, Claude & Ouorou, Adam & Petrou, Georgios, 2010. "Robust network design in telecommunications under polytope demand uncertainty," European Journal of Operational Research, Elsevier, vol. 206(3), pages 634-641, November.
    3. Josette Ayoub & Michael Poss, 2016. "Decomposition for adjustable robust linear optimization subject to uncertainty polytope," Computational Management Science, Springer, vol. 13(2), pages 219-239, April.
    4. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    5. Sara Mattia, 2012. "Solving survivable two-layer network design problems by metric inequalities," Computational Optimization and Applications, Springer, vol. 51(2), pages 809-834, March.
    6. Ayşegül Altın & Hande Yaman & Mustafa Ç. Pınar, 2011. "The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 75-89, February.
    7. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    8. Michał Pióro & Yoann Fouquet & Dritan Nace & Michael Poss, 2016. "Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity," Operations Research, INFORMS, vol. 64(2), pages 273-289, April.
    9. S Mudchanatongsuk & F Ordóñez & J Liu, 2008. "Robust solutions for network design under transportation cost and demand uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 652-662, May.
    10. Rafael Andrade & Abdel Lisser & Nelson Maculan, 2012. "Multi-service multi-facility network design under uncertainty," Annals of Operations Research, Springer, vol. 199(1), pages 157-178, October.
    11. Mattia, Sara & Rossi, Fabrizio & Servilio, Mara & Smriglio, Stefano, 2017. "Staffing and scheduling flexible call centers by two-stage robust optimization," Omega, Elsevier, vol. 72(C), pages 25-37.
    12. BIENSTOCK, Daniel & CHOPRA, Sunil & GÜNLÜK, Oktay & TSAI, Chih-Yang, 1998. "Minimum cost capacity installation for multicommodity network flows," LIDAM Reprints CORE 1391, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Siqian Shen & Mingdi You & Yintai Ma, 2017. "Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(2), pages 154-173, March.
    2. Artur Alves Pessoa & Michael Poss, 2015. "Robust Network Design with Uncertain Outsourcing Cost," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 507-524, August.
    3. Roos, Ernst & den Hertog, Dick, 2019. "Reducing conservatism in robust optimization," Other publications TiSEM ad0238cd-de7a-4366-b487-b, Tilburg University, School of Economics and Management.
    4. 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.
    5. Ayşegül Altın & Hande Yaman & Mustafa Ç. Pınar, 2011. "The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 75-89, February.
    6. Chungmok Lee & Kyungsik Lee & Kyungchul Park & Sungsoo Park, 2012. "Technical Note---Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations," Operations Research, INFORMS, vol. 60(3), pages 604-610, June.
    7. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.
    8. Ernst Roos & Dick den Hertog, 2020. "Reducing Conservatism in Robust Optimization," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1109-1127, October.
    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. Zhang, Hanxiao & Li, Yan-Fu, 2022. "Robust optimization on redundancy allocation problems in multi-state and continuous-state series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    11. Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
    12. Sun, Hao & Yang, Jun & Yang, Chao, 2019. "A robust optimization approach to multi-interval location-inventory and recharging planning for electric vehicles," Omega, Elsevier, vol. 86(C), pages 59-75.
    13. Taozeng Zhu & Jingui Xie & Melvyn Sim, 2022. "Joint Estimation and Robustness Optimization," Management Science, INFORMS, vol. 68(3), pages 1659-1677, March.
    14. 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.
    15. Bendotti, Pascale & Chrétienne, Philippe & Fouilhoux, Pierre & Pass-Lanneau, Adèle, 2021. "Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 22-33.
    16. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    17. 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.
    18. 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.
    19. Pengyu Qian & Zizhuo Wang & Zaiwen Wen, 2015. "A Composite Risk Measure Framework for Decision Making under Uncertainty," Papers 1501.01126, arXiv.org.
    20. Longsheng Sun & Mark H. Karwan & Changhyun Kwon, 2018. "Generalized Bounded Rationality and Robust Multicommodity Network Design," Operations Research, INFORMS, vol. 66(1), pages 42-57, 1-2.

    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:spr:coopap:v:69:y:2018:i:3:d:10.1007_s10589-017-9956-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.