Multiple sink location problem in path networks with a combinational objective

In this paper, we consider the k -sink location problem in a path network with the goal of optimizing a combinational function of the maximum completion time and the total completion time. Let $$P=\left( V,E\right) $$ P = V , E be an undirected path network with n vertices. Each vertex has a positive weight, indicating the initial amount of supplies, and each edge has a positive length and a uniform capacity, which is the maximum amount of supplies that can enter the edge per unit time. Our goal is to identify k sink locations on the path P so that all supplies will be successfully evacuated and the given objective function is optimized. This paper presents two efficient polynomial time algorithms, which achieve $$O\left( n \right) $$ O n for $$k=1$$ k = 1 and $$O\left( n^6 \right) $$ O n 6 for general k , respectively.

[1]  Haitao Wang.  Minmax regret 1-facility location on uncertain path networks , 2014, Eur. J. Oper. Res..

[2]  John N. Hooker,et al.  Finite Dominating Sets for Network Location Problems , 1991, Oper. Res..

[3]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[4]  Kazuhisa Makino,et al.  An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks , 2006, Discret. Appl. Math..

[5]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[6]  Yin-Feng Xu,et al.  Minimax Regret k-sink Location Problem in Dynamic Path Networks , 2014, AAIM.

[7]  Kazuhisa Makino,et al.  Optimal Sink Location Problem for Dynamic Flows in a Tree Network , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[8]  J. Halpern.  Finding Minimal Center-Median Convex Combination Cent-Dian of a Graph , 1978 .

[9]  Oded Berman,et al.  Medi-centre Location Problems , 1991 .

[10]  Yin-Feng Xu,et al.  Minimax regret 1-sink location problem with accessibility in dynamic general networks , 2016, Eur. J. Oper. Res..

[11]  Yin-Feng Xu,et al.  Minimax regret vertex 2-sink location problem in dynamic path networks , 2016, J. Comb. Optim..

[12]  Mordecai J. Golin,et al.  Multiple Sink Location Problems in Dynamic Path Networks , 2014, AAIM.

[13]  Binay K. Bhattacharya,et al.  Improved algorithms for computing minmax regret sinks on dynamic path and tree networks , 2015, Theor. Comput. Sci..

[14]  Binay K. Bhattacharya,et al.  Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks , 2017, WADS.

[15]  Siu-Wing Cheng,et al.  Minimax Regret 1-Median Problem in Dynamic Path Networks , 2017, Theory of Computing Systems.

[16]  Mordecai J. Golin,et al.  Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity , 2014, WALCOM.

[17]  Yin-Feng Xu,et al.  Minimax regret 1-sink location problem in dynamic cycle networks , 2015, Inf. Process. Lett..

[18]  Yin-Feng Xu,et al.  Minimax Regret 1-Sink Location Problems in Dynamic Path Networks , 2013, TAMC.

[19]  Yin-Feng Xu,et al.  Minimax regret 1-sink location problem in dynamic path networks , 2015, Theor. Comput. Sci..

[20]  Robert Benkoczi,et al.  Minsum k-Sink Problem on Path Networks , 2020, Theor. Comput. Sci..

[21]  Binay K. Bhattacharya,et al.  Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks , 2018, ArXiv.

[22]  John Augustine,et al.  Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities , 2019, Algorithmica.

[23]  Jonathan Halpern,et al.  THE LOCATION OF A CENTER-MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE* , 1976 .