Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Hari Nandan Nath"'
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2021 (2021)
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 i
Externí odkaz:
https://doaj.org/article/10769a2186084e9ea3a064b0fd585565
Autor:
Hari Nandan Nath, Tanka Nath Dhamala
Publikováno v:
International Journal of Operations Research, Vol 15, Iss 4, Pp 175-185 (2018)
Network flow models have been widely applied for evacuation planning, which involves moving people from risk areas (sources) to safe places (sinks) using some means of transportation, to optimize traffic flow in urban road networks. The decisions r
Externí odkaz:
https://doaj.org/article/31713defca064b18b638303d01194f0d
Publikováno v:
Mathematics, Vol 7, Iss 10, p 993 (2019)
Contraflow technique has gained a considerable focus in evacuation planning research over the past several years. In this work, we design efficient algorithms to solve the maximum, lex-maximum, earliest arrival, and quickest dynamic flow problems hav
Externí odkaz:
https://doaj.org/article/8e47b6e993764bafb27a6a08f8a61ff2
Autor:
Hari Nandan Nath
Publikováno v:
Journal of Institute of Science and Technology. 27:77-83
In a network with capacitated arcs, the maximum capacity path problem is to find the bottleneck path between two nodes that has the maximum capacity among all the paths between the nodes. In this work, a problem of identification of such a path is co
Publikováno v:
GANIT: Journal of Bangladesh Mathematical Society. 42:010-024
An important aspect of evacuation planning is to save human population by sending the people in dangerous areas (sources) to the safe places (sinks). Optimization models for evacuation planning focus on regulating the tra_c ow in urban road networks
Autor:
Hari Nandan Nath
Publikováno v:
The Nepali Mathematical Sciences Report. 39:14-21
The Maximum static flow problem, in a single-source-single-sink network, deals with finding the maximum amount of flow from a source to a sink. Given a set of possible sinks, identification of the sink that maximizes the amount of the maximum flow is
Publikováno v:
IOCA 2021.
Publikováno v:
Asia-Pacific Journal of Operational Research. 39
The maximum dynamic contraflow problem in transportation networks seeks to maximize the flow from a source to a sink within a given time horizon with a possibility of arc reversals. This may result into blockage of paths of desired length from some n
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2021 (2021)
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 i
Publikováno v:
Annals of Operations Research. 283:591-612
The challenges in evacuation planning have been vital because of rapid disasters and limited road capacity. Contraflow strategy is very effective and widely accepted approach for the optimal use of available road network in evacuation management that