Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Tanka Nath Dhamala"'
Publikováno v:
International Journal of Operations Research, Vol 17, Iss 1, Pp 27-39 (2020)
Traffic route guidance, destination optimization, and optimal route choice are some of the approaches to accelerate the evacuation planning process. Their effectiveness depends upon the evacuee arrival patterns at the pickup locations and their appro
Externí odkaz:
https://doaj.org/article/973c5878d2fb44229df9c2da7b3c6aab
Publikováno v:
Journal of Applied Mathematics, Vol 2022 (2022)
A maximum dynamic multicommodity flow problem concerns with the transportation of several different commodities through the specific source-sink path of an underlying capacity network with the objective of maximizing the sum of commodity flows within
Externí odkaz:
https://doaj.org/article/aa481864a6c64863bcc7ecca8596229f
Publikováno v:
International Journal of Operations Research, Vol 16, Iss 1, Pp 13-26 (2019)
The large scale calamities caused by natural or human-created disasters are the challenging issues to protect the life and their surroundings. It is a complex task to develop the significant and universally accepted solution strategy for handling t
Externí odkaz:
https://doaj.org/article/d1f5b27d0be54a09b39b9196e38cb840
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:
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
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2020 (2020)
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, a
Externí odkaz:
https://doaj.org/article/d34a474cbdb2419c8bc7b197b10e8cb4
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2020 (2020)
The multicommodity flow problem arises when several different commodities are transshipped from specific supply nodes to the corresponding demand nodes through the arcs of an underlying capacity network. The maximum flow over time problem concerns to
Externí odkaz:
https://doaj.org/article/9d60daf0a5154f79b0a40c1ffee845a5
Publikováno v:
International Journal of Operations Research, Vol 15, Iss 3, Pp 101-133 (2018)
In the last decades, research on emergency traffic management has received high attention from the operations research community and many pioneer researchers have established it as one of the most fertile research areas. We consider the computationa
Externí odkaz:
https://doaj.org/article/fc8f5a7d5fd74095b4d1d0ca4ac04a6b
Publikováno v:
International Journal of Operations Research, Vol 15, Iss 1, Pp 29-47 (2018)
Increasing number of complex traffic networks and disasters today has brought difficulty in managing the rush hours traffic as well as the large events in urban areas. The optimal use of the vehicles and their assignments to the appropriate shelter
Externí odkaz:
https://doaj.org/article/8e0b9c4109ad4b6ba73b60810796d17a
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