On the capacity provisioning on dynamic networks
Loading...
Date
2022
Authors
Lijoka, Oluwaseun Francis
University of Lethbridge. Faculty of Arts and Science
Journal Title
Journal ISSN
Volume Title
Publisher
Lethbridge, Alta. : Dept. of Mathematics and Computer Science
Abstract
In this thesis, we consider the development of algorithms suitable for designing evacuation
procedures in sparse or remote communities. The works are extensions of sink location
problems on dynamic networks, which are motivated by real-life disaster events such as
the Tohoku Japanese Tsunami, the Australian wildfire and many more. The available algorithms in this context consider the location of the sinks (safe-havens) with the assumptions
that the evacuation by foot is possible, which is reasonable when immediate evacuation
is needed in urban settings. However, for remote communities, emergency vehicles may
need to be dispatched or situated strategically for an efficient evacuation process. With
the assumption removed, our problems transform to the task of allocating capacities on
the edges of dynamic networks given a budget capacity c. We first of all consider this
problem on a dynamic path network of n vertices with the objective of minimizing the
completion time (minmax criterion) given that the position of the sink is known. This leads
to an O(nlogn + nlog(c/ξ)) time, where ξ is a refinement or precision parameter for an
additional binary search in the worst case scenario. Next, we extend the problem to star
topologies. The case where the sink is located at the middle of the star network follows
the same approach for the path network. However, when the sink is located on a leaf node,
the problem becomes more complicated when the number of links (edges) exceeds three.
The second phase of this thesis focuses on allocating capacities on the edges of dynamic
path networks with the objective of minimizing the total evacuation time (minsum criterion)
given the position of the sink and the budget (fixed) capacity. In general, minsum problems
are more difficult than minmax problems in the context of sink location problems. Due to
few combinatorial properties discovered together with the possibility of changing objective.
function configuration in the course of the optimization process, we consider the development of numerical procedure which involves the use of sequential quadratic programming
(SQP). The sequential quadratic programming employed allows the specification of an arbitrary initial capacities and also helps in monitoring the changing configuration of the
objective function. We propose to consider these problems on more complex topolgies
such as trees and general graph in future.
Description
Keywords
facility location , capacity scheduling , sink location problem , capacity allocation problem , evacuation problem , dynamic flow in networks , Location problems (Programming) , Transportation problems (Programming) , Evacuation of civilians--Mathematical models , Emergency management--Mathematical models , Algorithms , Sparsely populated areas , Mathematical optimization , Dissertations, Academic