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

Incremental network design with maximum flows

Author

Listed:
  • Kalinowski, Thomas
  • Matsypura, Dmytro
  • Savelsbergh, Martin W.P.

Abstract

We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics.

Suggested Citation

  • Kalinowski, Thomas & Matsypura, Dmytro & Savelsbergh, Martin W.P., 2015. "Incremental network design with maximum flows," European Journal of Operational Research, Elsevier, vol. 242(1), pages 51-62.
  • Handle: RePEc:eee:ejores:v:242:y:2015:i:1:p:51-62
    DOI: 10.1016/j.ejor.2014.10.003
    as

    Download full text from publisher

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

    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. Baxter, Matthew & Elgindy, Tarek & Ernst, Andreas T. & Kalinowski, Thomas & Savelsbergh, Martin W.P., 2014. "Incremental network design with shortest paths," European Journal of Operational Research, Elsevier, vol. 238(3), pages 675-684.
    2. Nurre, Sarah G. & Cavdaroglu, Burak & Mitchell, John E. & Sharkey, Thomas C. & Wallace, William A., 2012. "Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 794-806.
    3. Ukkusuri, Satish V. & Patil, Gopal, 2009. "Multi-period transportation network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 625-642, July.
    4. Burak Cavdaroglu & Erik Hammel & John Mitchell & Thomas Sharkey & William Wallace, 2013. "Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems," Annals of Operations Research, Springer, vol. 203(1), pages 279-294, March.
    5. Byung Kim & Wonkyu Kim & Byung Song, 2008. "Sequencing and scheduling highway network expansion using a discrete network design model," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 621-642, September.
    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. Ni, Ni & Howell, Brendan J. & Sharkey, Thomas C., 2018. "Modeling the impact of unmet demand in supply chain resiliency planning," Omega, Elsevier, vol. 81(C), pages 1-16.
    2. Averbakh, Igor & Pereira, Jordi, 2015. "Network construction problems with due dates," European Journal of Operational Research, Elsevier, vol. 244(3), pages 715-729.
    3. Chagas, Rosklin Juliano & Valle, Cristiano Arbex & da Cunha, Alexandre Salles, 2018. "Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 57-71.
    4. Garrett, Richard A. & Sharkey, Thomas C. & Grabowski, Martha & Wallace, William A., 2017. "Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic," European Journal of Operational Research, Elsevier, vol. 257(1), pages 272-286.
    5. Sharkey, Thomas C. & Cavdaroglu, Burak & Nguyen, Huy & Holman, Jonathan & Mitchell, John E. & Wallace, William A., 2015. "Interdependent network restoration: On the value of information-sharing," European Journal of Operational Research, Elsevier, vol. 244(1), pages 309-321.

    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:242:y:2015:i:1:p:51-62. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.