TY - JOUR

T1 - Lexicographically optimal earliest arrival flows

AU - Kamiyama, Naoyuki

N1 - Funding Information:
information This research was supported by the Japan Science and Technology Agency, JST PRESTO Grant Number JPMJPR1753.The author would like to thank the anonymous referees for helpful comments. This research was supported by JST, PRESTO Grant Number JPMJPR1753, Japan.

PY - 2020/1/1

Y1 - 2020/1/1

N2 - A dynamic network introduced by Ford and Fulkerson is a directed graph in which each arc has a capacity and a transit time. The evacuation problem is one of the fundamental problems in a dynamic network. The goal of this problem is to find the minimum time limit Θ such that we can send all the supplies to the sinks within time Θ. An earliest arrival flow is an optimal flow for the evacuation problem such that the amount of supplies which have reached the sinks is maximized at every time step. It is known that in a dynamic network with multiple sinks, if the sinks have capacities, then an earliest arrival flow does not necessarily exist. In this paper, to cope with this issue, we first introduce a lexicographically optimal earliest arrival flow in a dynamic network with multiple sinks. Then we propose a pseudo-polynomial-time algorithm for finding a lexicographically optimal earliest arrival flow. Furthermore, we prove that if the transit time of every arc is zero, then we can find a lexicographically optimal earliest arrival flow in polynomial time.

AB - A dynamic network introduced by Ford and Fulkerson is a directed graph in which each arc has a capacity and a transit time. The evacuation problem is one of the fundamental problems in a dynamic network. The goal of this problem is to find the minimum time limit Θ such that we can send all the supplies to the sinks within time Θ. An earliest arrival flow is an optimal flow for the evacuation problem such that the amount of supplies which have reached the sinks is maximized at every time step. It is known that in a dynamic network with multiple sinks, if the sinks have capacities, then an earliest arrival flow does not necessarily exist. In this paper, to cope with this issue, we first introduce a lexicographically optimal earliest arrival flow in a dynamic network with multiple sinks. Then we propose a pseudo-polynomial-time algorithm for finding a lexicographically optimal earliest arrival flow. Furthermore, we prove that if the transit time of every arc is zero, then we can find a lexicographically optimal earliest arrival flow in polynomial time.

UR - http://www.scopus.com/inward/record.url?scp=85068181306&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068181306&partnerID=8YFLogxK

U2 - 10.1002/net.21902

DO - 10.1002/net.21902

M3 - Article

AN - SCOPUS:85068181306

VL - 75

SP - 18

EP - 33

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -