Continuous Time Dynamic Contraflow Models and Algorithms

Pyakurel, Urmila; Dhamala, Tanka Nath

doi:10.1155/2016/7902460

Cited by 38 publications

(46 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous works [24][25][26][27] have considered the benefits of contraflow-based methods on evacuation planning. In addition, in the literatures, the optimality of evacuation planning by integrating contraflow-based methods has been validated.…”

Section: Prescriptive Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Capacity-Constrained Contraflow Adaption for Lane Reconfiguration in Evacuation Planning

Wang

et al. 2018

Journal of Advanced Transportation

View full text Add to dashboard Cite

This paper presents a heuristic contraflow-based reconfiguration evacuation algorithm, which is named Capacity-Constrained Contraflow Adaption (CC-Adap). First, it effectively calculates optimal candidate routes for evacuation. Second, an evaluation method is proposed for estimating these candidate routes. Third, CC-Adap utilizes a contraflow-based method to reconfigure the evacuation routes to improve capacity constraints. Fourth, traffic conditions are updated in real time. Fifth, CC-Adap reuses historical evacuation routes to reduce the computational cost and accelerate the evacuation process. Experimental results show that CC-Adap generates high-performing evacuation strategies and can be used to tackle large-scale evacuation planning.

show abstract

Section: Prescriptive Methodsmentioning

confidence: 99%

“…Above-mentioned contraflow-based methods are selected to generate contraflow strategy that can tackle capacity constraints effectively [2,3,[24][25][26][27][28][29]. However, there are two difficulties in calculating the appropriate contraflow strategy for the complex traffic system.…”

Section: Prescriptive Methodsmentioning

confidence: 99%

Capacity-Constrained Contraflow Adaption for Lane Reconfiguration in Evacuation Planning

Wang

et al. 2018

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…Algorithm 1. (Rebennack et al, 2010) With natural transformation, we solve the maximum continuous dynamic flow (MCDCF) problem on two terminal network , see (Pyakurel and Dhamala, 2015b). The problem seeks to find a maximum flow that can be sent from the source to the sink within time interval .…”

Section: Methodsmentioning

confidence: 99%

“…This problem can be solved in the same complexity as in the EACF problem on TTSP networks. For continuous contraflow model we refer to (Pyakurel and Dhamala, 2015b).…”

Section: Obtain the Eacf Solution On Ttsp Networkmentioning

confidence: 99%

Significance of Transportation Network Models in Emergency Planning of Cities

Dhamala

Pyakurel

2016

CPP

Self Cite

View full text Add to dashboard Cite

Transportation network models within the framework of operations research have been established as one of the emerging field of research frontiers in today's very disastrous life and dense traffic system. The discrete as well as continuous flow over time models have been widely considered by social, engineering and applied scientists with wide varieties of real-life problems, like rush hour traffic and traffic management at the time of any disaster. Among the PPRR classification issues, the concentration will be given within the planning approach with transportation networks for urban cities.We present the models and solution strategies of the transportation networks that are dynamic in nature and directly apply in rush hour traffic or human-made or natural disasters in the urban cities. The difficulty levels of the varieties of algorithms, efficiencies of their solution software and the significance of the obtained solutions for the betterment of modern city plan are discussed with wide spectrum of model diversity. Among many others, we illustrate, also supporting with a case study, the impact of recent Nepal Earthquake 2015 and the meaningfulness of effective evacuation planning for saving the property and people in urban city like, Kathmandu, valley.The high performance of the technique of lane reversals in transportation or evacuation networks which has already been adopted a lot in practice, but has been analytically studied only recently are focused in this paper. Adopted this dynamic transportation strategy, the flow in the transportation can be doubled, the time can be saved significantly and many transportation arcs can be utilized for logistic supports or for emergency vehicles whenever necessary. Improved results are presented and the importance of integrated models dependent on time and vehicles is explored. The optimal solution thus obtained with contraflow, logistic supports and facility location at appropriate positions of transportation network proves the significance of these models in emergency planning.

show abstract

“…Rebennack et al [21] studied the maximum static contraflow problem for general network, the maximum dynamic contraflow problem and the quickest contraflow problem for two terminal networks and presented the polynomial time algorithms but the quickest transshipment contraflow problem and fixed switching cost contraflow problems are shown NP-hard. Extensive studies with contraflow approach have been made by the authors Dhamala and Pyakurel [4], Pyakurel et al [20], Pyakurel and Dhamala [18], Khadka and Bhandari [15] and Pyakurel and Dhamala [19].…”

mentioning

confidence: 99%

Non-conserving Flow Aspect of Maximum Dynamic Flow Problem

Bhandari

Khadka

2018

J. Inst. Engineering

View full text Add to dashboard Cite

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.

show abstract

Continuous Time Dynamic Contraflow Models and Algorithms

Cited by 38 publications

References 10 publications

Capacity-Constrained Contraflow Adaption for Lane Reconfiguration in Evacuation Planning

Capacity-Constrained Contraflow Adaption for Lane Reconfiguration in Evacuation Planning

Significance of Transportation Network Models in Emergency Planning of Cities

Non-conserving Flow Aspect of Maximum Dynamic Flow Problem

Contact Info

Product

Resources

About