Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks

06/03/2018
by   Binay Bhattacharya, et al.
0

Evacuation in emergency situations can be modeled by a dynamic flow network. Two criteria have been used before: one is the evacuation completion time and the other is the aggregate evacuation time of individual evacuees. The aim of this paper is to optimize the aggregate evacuation time in the simplest case, where the network is a path and only one evacuation center (called a sink) is to be introduced. The evacuees are initially located at the vertices, but their precise numbers are unknown, and are given by upper and lower bounds. Under this assumption, we compute the sink location that minimizes the maximum "regret." We present an O(n^2 n) time algorithm to solve this problem, improving upon the previously fastest O(n^3) time algorithm, where n is the number of vertices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2020

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights

This paper addresses the minmax regret 1-sink location problem on dynami...
research
10/24/2018

Minsum k-Sink Problem on Path Networks

We consider the problem of locating a set of k sinks on a path network w...
research
10/12/2020

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks

We address the facility location problems on dynamic flow path networks....
research
12/25/2018

Evacuating Equilateral Triangles and Squares in the Face-to-Face Model

Consider k robots initially located at a point inside a region T. Each r...
research
06/11/2018

Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities

A dynamic flow network G with uniform capacity c is a graph in which at ...
research
01/08/2023

Maximum overlap area of a convex polyhedron and a convex polygon under translation

Let P be a convex polyhedron and Q be a convex polygon with n vertices i...
research
02/13/2023

General Position Problem of Butterfly Networks

A general position set S is a set S of vertices in G(V,E) such that no t...

Please sign up or login with your details

Forgot password? Click here to reset