Skip to main content
SpringerLink
Log in

Minimax regret vertex 2-sink location problem in dynamic path networks

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This paper considers the minimax regret vertex 2-sink location problem in a dynamic path network with positive edge lengths and uniform edge capacity. Let \(P\) be an undirected path graph of \(n\) vertices, and the weight (initial supply) of every vertex is known as an interval. The problem is to find two vertices \(x\) and \(y\) as two sinks on the path such that all the weights can evacuate to \(x\) and \(y\) with minimum regret of evacuation time in case of an emergency for any possible weight distribution. We present an \(O(n^3\log n)\) time algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Augustine J, Cheng SW, Golin MJ et al (2013) Minimax regret 1-sink location problem in dynamic path networks. Theor Comput Sci

  • Cheng SW, Higashikawa Y, Katoh N et al (2013) Minimax regret 1-sink location problems in dynamic path networks. In: Theory and applications of models of computation. Springer, Berlin

  • Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper Res 6(3):419–433

    Article  MathSciNet  Google Scholar 

  • Kamiyama N, Katoh N, Takizawa A (2006) An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity. IEICE Trans Inf Syst 89(8):2372–2379

    Article  Google Scholar 

  • Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Springer, Berlin

    Book  MATH  Google Scholar 

  • Løvs GG (1998) Models of wayfinding in emergency evacuations. Eur J Oper Res 105(3):371–389

    Article  Google Scholar 

  • Mamada S, Makino K, Fujishige S (2002) Optimal sink location problem for dynamic flows in a tree network. IEICE Trans Fundam Electron Commun Comput Sci 85(5):1020–1025

    Google Scholar 

  • Mamada S, Uno T, Makino K et al (2006) An \(O(n\log ^{2}n)\) algorithm for the optimal sink location problem in dynamic tree networks. Discret Appl Math 154(16):2387–2401

    Article  MathSciNet  MATH  Google Scholar 

  • Wang H (2013) Minmax regret 1-facity location on uncertain path networks. In: Algorithms and computation. Springer, Berlin, pp 733–743

Download references

Acknowledgments

This work is supported by National Natural Science Foundation of China under Grants 71071123, 61221063, 71371129 and Program for Changjiang Scholars and Innovative Research Team in University under Grant IRT1173.

Author information

Authors and Affiliations

  1. Business School, Sichuan University, Chengdu , 610065, China

    Hongmei Li, Yinfeng Xu & Guanqun Ni

  2. State Key Lab for Manufacturing Systems Engineering, Xi’an , 710049, China

    Yinfeng Xu

Authors
  1. Hongmei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinfeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guanqun Ni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yinfeng Xu.

Appendix

Appendix

figure a
figure b

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, H., Xu, Y. & Ni, G. Minimax regret vertex 2-sink location problem in dynamic path networks. J Comb Optim 31, 79–94 (2016). https://doi.org/10.1007/s10878-014-9716-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9716-2

Keywords

Search

Navigation