IDEAS home Printed from https://ideas.repec.org/a/spr/trosos/v13y2019i2d10.1007_s12626-019-00047-z.html
   My bibliography  Save this article

A Survey on Facility Location Problems in Dynamic Flow Networks

Author

Listed:
  • Yuya Higashikawa

    (University of Hyogo)

  • Naoki Katoh

    (University of Hyogo)

Abstract

This paper surveys the facility location problems in dynamic flow networks that have been actively studied in recent years. These problems have been motivated by evacuation planning which has become increasingly important in Japan. The evacuation planning problem is formulated using a dynamic flow network consisting of a graph in which a capacity as well as a transit time is associated with each edge. The goal of the problem is to find a way to send evacuees originally existing at vertices to facilities (evacuation centers) as quickly as possible. The problem can be viewed as a generalization of the classical k-center and k-median problems. In this paper we show recent results about the difficulty and approximability of a single facility location for general networks and polynomial time algorithms for k-facility location problems in path and tree networks. We also mention the minimax regret version of these problems.

Suggested Citation

  • Yuya Higashikawa & Naoki Katoh, 2019. "A Survey on Facility Location Problems in Dynamic Flow Networks," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 163-208, October.
    • Handle: RePEc:spr:trosos:v:13:y:2019:i:2:d:10.1007_s12626-019-00047-z
    DOI: 10.1007/s12626-019-00047-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12626-019-00047-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/s12626-019-00047-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. Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
    2. Averbakh, Igor & Berman, Oded, 2000. "Algorithms for the robust 1-center problem on a tree," European Journal of Operational Research, Elsevier, vol. 123(2), pages 292-302, June.
    3. L. R. Ford & D. R. Fulkerson, 1958. "Constructing Maximal Dynamic Flows from Static Flows," Operations Research, INFORMS, vol. 6(3), pages 419-433, June.
    4. Wang, Haitao, 2014. "Minmax regret 1-facility location on uncertain path networks," European Journal of Operational Research, Elsevier, vol. 239(3), pages 636-643.
    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. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    2. Yosuke Hanawa & Yuya Higashikawa & Naoyuki Kamiyama & Naoki Katoh & Atsushi Takizawa, 2018. "The mixed evacuation problem," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1299-1314, November.
    3. Hong Zheng & Yi-Chang Chiu & Pitu B. Mirchandani, 2015. "On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems," Transportation Science, INFORMS, vol. 49(1), pages 13-27, February.
    4. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    5. Lim, Gino J. & Zangeneh, Shabnam & Reza Baharnemati, M. & Assavapokee, Tiravat, 2012. "A capacitated network flow optimization approach for short notice evacuation planning," European Journal of Operational Research, Elsevier, vol. 223(1), pages 234-245.
    6. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    7. Tanka Nath Dhamala & Urmila Pyakurel & Ram Chandra Dhungana, 2018. "Abstract Contraflow Models and Solution Procedures for Evacuation Planning," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 10(4), pages 89-100, August.
    8. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    9. Shahram Morowati-Shalilvand & Sedaghat Shahmorad & Kamal Mirnia & Javad Mehri-Tekmeh, 2021. "Quickest flow over time network interdiction: mathematical formulation and a solution method," Operational Research, Springer, vol. 21(2), pages 1179-1209, June.
    10. Elisabeth Lübbecke & Marco E. Lübbecke & Rolf H. Möhring, 2019. "Ship Traffic Optimization for the Kiel Canal," Operations Research, INFORMS, vol. 67(3), pages 791-812, May.
    11. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    12. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    13. S. Khodayifar & M. A. Raayatpanah & P. M. Pardalos, 2019. "A polynomial time algorithm for the minimum flow problem in time-varying networks," Annals of Operations Research, Springer, vol. 272(1), pages 29-39, January.
    14. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Dynamic Pricing and Pooling in Capacitated Networks," Papers 2307.03994, arXiv.org, revised Nov 2023.
    15. S Opasanon & E Miller-Hooks, 2009. "The Safest Escape problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1749-1758, December.
    16. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric, 2021. "A time-expanded network reduction matheuristic for the logistics service network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    17. Li, Hongmei & Xu, Yinfeng, 2016. "Minimax regret 1-sink location problem with accessibility in dynamic general networks," European Journal of Operational Research, Elsevier, vol. 250(2), pages 360-366.
    18. Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2017. "Efficient continuous contraflow algorithms for evacuation planning problems," Annals of Operations Research, Springer, vol. 254(1), pages 335-364, July.
    19. Wang, Haitao, 2014. "Minmax regret 1-facility location on uncertain path networks," European Journal of Operational Research, Elsevier, vol. 239(3), pages 636-643.
    20. Ronald Koch & Ebrahim Nasrabadi & Martin Skutella, 2011. "Continuous and discrete flows over time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(3), pages 301-337, June.

    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:trosos:v:13:y:2019:i:2:d:10.1007_s12626-019-00047-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.