scholarly journals RnR-SMART: Resilient smart city evacuation plan based on road network reconfiguration in outbreak response

2021 ◽  
Vol 75 ◽  
pp. 103386
Author(s):  
Jiho Kim ◽  
Junwoo Park ◽  
Kwangyoung Kim ◽  
Mucheol Kim
Author(s):  
A. S. Homainejad

With growth of urbanisation, there is a requirement for using the leverage of smart city in city management. The core of smart city is Information and Communication Technologies (ICT), and one of its elements is smart transport which includes sustainable transport and Intelligent Transport Systems (ITS). Cities and especially megacities are facing urgent transport challenge in traffic management. Geospatial can provide reliable tools for monitoring and coordinating traffic. In this paper a method for monitoring and managing the ongoing traffic in roads using aerial images and CCTV will be addressed. In this method, the road network was initially extracted and geo-referenced and captured in a 3D model. The aim is to detect and geo-referenced any vehicles on the road from images in order to assess the density and the volume of vehicles on the roads. If a traffic jam was recognised from the images, an alternative route would be suggested for easing the traffic jam. In a separate test, a road network was replicated in the computer and a simulated traffic was implemented in order to assess the traffic management during a pick time using this method.


Author(s):  
Hari Nandan Nath ◽  
Urmila Pyakurel ◽  
Tanka Nath Dhamala

Motivated by applications in evacuation planning, we consider a problem of optimizing flow with arc reversals in which the transit time depends on the orientation of the arc. In the considered problems, the transit time on an arc may change when it is reversed, contrary to the problems considered in the existing literature. Extending the existing idea of auxiliary network construction to allow asymmetric transit time on arcs, we present strongly polynomial time algorithms for solving single-source-single-sink maximum dynamic contraflow problem and quickest contraflow problem. The results are substantiated by a computational experiment in a Kathmandu road network. An algorithm to solve the corresponding earliest arrival contraflow problem with a pseudo-polynomial-time complexity is also presented. The partial contraflow approach for the corresponding problems has also been discussed.


Sign in / Sign up

Export Citation Format

Share Document