scholarly journals On the Transit-Based Evacuation Strategies in an Integrated Network Topology

2020 ◽  
Vol 37 (1-2) ◽  
pp. 1-13
Author(s):  
Iswar Mani Adhikari ◽  
Tanka Nath Dhamala
Keyword(s):  
Network Topology ◽  
Network Flow ◽  
Dynamic Network ◽  
Evacuation Planning ◽  
Planning Problem ◽  
Integrated Network ◽  
Routing Problem ◽  
Flow Models ◽  
Dynamic Network Flow ◽  
Important Variant

Evacuation planning problem deals with sending the maximum number of evacuees from the danger zone to the safe zone in minimum time as eciently as possible. The dynamic network flow models for various evacuation network topology have been found suitable for the solution of such a problem. Bus based evacuation planning problem (BEPP), as an important variant of the vehicle routing problem (VRP), is one of the emerging evacuation planning problems. In this work, an organized overview of this problem with a focus on their solution status is compactly presented. Arrival patterns of the evacuees including their transshipments at different pickup locations and their assignments are presented. Finally, a BEPP model and a solution for a special network are also proposed.

scholarly journals Optimum Flows in Directed Bipartite Dynamic Network. The Static Approach

2020 ◽  
Vol 14 ◽  
Keyword(s):  
Combinatorial Optimization ◽  
Network Flow ◽  
Dynamic Network ◽  
Time Varying ◽  
Flow Models ◽  
Dynamic Network Flow ◽  
Static Approach ◽  
Network Flow Models ◽  
Discrete Values ◽  
Time Expanded Network

The theory of flows is one of the most important parts of Combinatorial Optimization and it has various applications. In this paper we study optimum (maximum or minimum) flows in directed bipartite dynamic network and is an extension of article [9]. In practical situations, it is easy to see many time-varying optimum problems. In these instances, to account properly for the evolution of the underlying system overtime, we need to use dynamic network flow models. When the time is considered as a variable discrete values, these problems can be solved by constructing an equivalent, static time expanded network. This is a static approach.

scholarly journals Non-conserving Flow Aspect of Maximum Dynamic Flow Problem

2018 ◽  
Vol 14 (1) ◽  
pp. 107-114
Author(s):  
Phanindra Prasad Bhandari ◽  
Shree Ram Khadka
Keyword(s):  
Network Flow ◽  
Efficient Solution ◽  
Flow Problem ◽  
Dynamic Network ◽  
Maximum Flow ◽  
Solution Procedure ◽  
Evacuation Planning ◽  
Planning Problem ◽  
Intermediate Node ◽  
Flow Conservation

Shifting as many people as possible from disastrous area to safer area in a minimum time period in an efficient way is an evacuation planning problem (EPP). Modeling the evacuation scenarios reflecting the real world characteristics and investigation of an efficient solution to them have become a crucial due to rapidly increasing number of natural as well as human created disasters. EPPs modeled on network have been extensively studied and the various efficient solution procedures have been established where the flow function satisfies the flow conservation at each intermediate node. Besides this, the network flow problem in which flow may not be conserved at nodes necessarily could also be useful to model the evacuation planning problem. This paper proposes an efficient solution procedure for maximum flow evacuation planning problem of later kind on a single-source-single-sink dynamic network with integral arc capacities with holding capability of flow (evacuees) in the temporary shelter at intermediate nodes. Journal of the Institute of Engineering, 2018, 14(1): 107-114

scholarly journals Dynamic network flow location models and algorithms for quickest evacuation planning

2017 ◽  
Vol 13 (5) ◽  
pp. 0-0 ◽  
Author(s):  
Hari Nandan Nath ◽  
◽  
Urmila Pyakurel ◽  
Tanka Nath Dhamala ◽  
Stephan Dempe ◽  
...  
Keyword(s):  
Network Flow ◽  
Dynamic Network ◽  
Evacuation Planning ◽  
Location Models ◽  
Dynamic Network Flow

scholarly journals A survey on network contraflow evacuation planningproblems

2015 ◽  
Vol 3 ◽  
pp. 44-53
Author(s):  
Phanindra Prasad Bhandari ◽  
Shree Ram Khadka
Keyword(s):  
Network Flow ◽  
Dynamic Network ◽  
Route Planning ◽  
Evacuation Planning ◽  
Solution Strategies ◽  
General Network ◽  
Evacuation Route Planning ◽  
Network Flow Optimization ◽  
Evacuation Route ◽  
Potential Remedy

Evacuation planning is becoming crucial due to an increasing number of natural and human-created disasters over last few decades. One of the efficient ways to model the evacuation situation is a network flow optimization model. This model captures most of the necessities of the evacuation planning. Moreover, dynamic network contraflow modeling is considered a potential remedy to decrease the congestion due to its direction reversal property and it addresses the challenges of evacuation route planning. However, there do not exist satisfactory analytical results to this model for general network. In this paper, it is tried to provide an annotated overview on dynamic network contraflow problems related to evacuation planning and to incorporate models and solution strategies to them developed in this field to date.

scholarly journals Efficient Solution Approach to Maximum Flow Evacuation Planning Problem without Flow Conservation Aspect

2018 ◽  
Vol 13 (1) ◽  
pp. 108-116
Author(s):  
Phanindra Prasad Bhandari ◽  
Shree Ram Khadka
Keyword(s):  
Network Flow ◽  
Efficient Solution ◽  
Maximum Flow ◽  
Evacuation Planning ◽  
Planning Problem ◽  
Intermediate Node ◽  
Solution Approach ◽  
Solution Strategies ◽  
Source Sink ◽  
Flow Conservation

 An attempt of shifting as more people as possible and/or their logistics from a dangerous place to a safer place is an evacuation planning problem. Such problems modeled on network have been extensively studied and the various efficient solution procedures have been established. The solution strategies for these problems are based on source-sink path augmentation and the flow function satisfies the flow conservation at each intermediate node. Besides this, the network flow problem in which flow may not be conserved at node necessarily could also be used to model the evacuation planning problem. This paper proposes a model for maximum flow evacuation planning problem on a single-source-single-sink static network with integral arc capacities with holding capability of evacuees in the temporary shelter at intermediate nodes and extends the model into the dynamic case. Journal of the Institute of Engineering, 2017, 13(1): 108-116

scholarly journals Flow Improvement in Evacuation Planning with Budget Constrained Switching Costs

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
Ram Chandra Dhungana ◽  
Tanka Nath Dhamala
Keyword(s):  
Network Flow ◽  
Large Scale ◽  
Maximum Flow ◽  
Evacuation Planning ◽  
Solution Technique ◽  
Planning Problem ◽  
Constrained Problems ◽  
Full Capacity ◽  
Evacuation Plan ◽  
Flow Improvement

Many large-scale natural and human-created disasters have drawn the attention of researchers towards the solutions of evacuation planning problems and their applications. The main focus of these solution strategies is to protect the life, property, and their surroundings during the disasters. With limited resources, it is not an easy task to develop a universally accepted model to handle such issues. Among them, the budget-constrained network flow improvement approach plays significant role to evacuate the maximum number of people within the given time horizon. In this paper, we consider an evacuation planning problem that aims to shift a maximum number of evacuees from a danger area to a safe zone in limited time under the budget constraints for network modification. Different flow improvement strategies with respect to fixed switching cost will be investigated, namely, integral, rational, and either to increase the full capacity of an arc or not at all. A solution technique on static network is extended to the dynamic one. Moreover, we introduce the static and dynamic maximum flow problems with lane reversal strategy and also propose efficient algorithms for their solutions. Here, the contraflow approach reverses the direction of arcs with respect to the lane reversal costs to increase the flow value. As an implementation of an evacuation plan may demand a large cost, the solutions proposed here with budget constrained problems play important role in practice.

scholarly journals On self-tuning networks-on-chip for dynamic network-flow dominance adaptation

2014 ◽  
Vol 13 (2s) ◽  
pp. 1-21 ◽  
Author(s):  
Xiaohang Wang ◽  
Mei Yang ◽  
Yingtao Jiang ◽  
Peng Liu ◽  
Masoud Daneshtalab ◽  
...  
Keyword(s):  
Network Flow ◽  
Dynamic Network ◽  
Networks On Chip ◽  
Dynamic Network Flow ◽  
Self Tuning ◽  
On Chip
Sign in / Sign up

Export Citation Format

Share Document