Quickest Transshipment in an Evacuation Network Topology

Adhikari, Iswar Mani; Dhamala, Tanka Nath

doi:10.3390/ioca2021-10879

Cited by 3 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…− 𝛼𝛼 : (𝑦𝑦 ! ) (14) With the constraints (5)(6)(7)(8)(9)(10)(11)(12), the integrated problem can be reformulated to minimize 𝑇𝑇 HIJ such that:…”

Section: An Integrated Evacuation Planning Approachmentioning

confidence: 99%

“…It demands a minimum time limit such that all supplies can be sent to the sinks (safe places) from the sources (disastrous zones). There has been a fair amount of work regarding its different aspects, including the quickest transshipment, as referred by [3][4][5][6][7][8][9]. These problems are handled from different perspectives: transit-based, car-based, and pedestrian movements.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Quickest Transshipment in the Prioritized Evacuation Network

Adhikari

2023

Kaumodaki J.

View full text Add to dashboard Cite

Flow maximization, time minimization, and cost minimization are three main aspects of mathematical optimization problems. The evacuation planning problems are about flow maximization and/or time minimization problems in different dynamic evacuation networks. The quickest transshipment problem in such a network is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. In evacuation planning problems, the term flow stands for either the evacuees or the evacuees carrying vehicles. Here, we use the quickest transshipment strategy in a prioritized evacuation network. It consists of a collection and an assignment sub-network as the primary and secondary sub-networks, respectively. Pick-up locations are prioritized in the collection network. By treating such pick-up locations as sources, the available set of transit buses is assigned in the assignment sub-network to shift the evacuees to the sinks to achieve the quickest transshipment. Such an evacuation planning strategy is better suited for the simultaneous collection, assignment, and evacuation process in the prioritized evacuation network.

show abstract

“…− 𝛼𝛼 : (𝑦𝑦 ! ) (14) With the constraints (5)(6)(7)(8)(9)(10)(11)(12), the integrated problem can be reformulated to minimize 𝑇𝑇 HIJ such that:…”

Section: An Integrated Evacuation Planning Approachmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Quickest Transshipment in the Prioritized Evacuation Network

Adhikari

2023

Kaumodaki J.

View full text Add to dashboard Cite

show abstract

“…Such VRPs are for the efficient distribution of goods from different depots to the customers to design the least cost delivery whereas, in the TEP problems, the objectives are to minimize the duration of evacuation by routing and scheduling a fleet of homogeneous and capacitated vehicles like the buses, which were initially located at one or more depots. For more details about such problems and their variants, we refer to Adhikari & Dhamala (2020a), Adhikari & Dhamala (2020b), Dhamala & Adhikari (2018), Adhikari et al (2020), Adhikari & Dhamala (2022), Adhikari (2023), and the references therein.…”

Section: Literature Reviewmentioning

confidence: 99%

Route Dominance on Symmetric Type Transit-based Evacuation Network

Adhikari¹

2023

Kanya J.

View full text Add to dashboard Cite

The selection of dominant routes for transit-based evacuation planning problems mainly depends upon the structure and nature of the available network. To achieve efficient evacuation planning, the problem is not only on the selection of a route and a shelter for each route on the available network topology but also on the route-to-vehicle assignment and vice versa, which is more complex and challenging in real practice. The evacuation network adds complexity to the solution and impacts the problem. In this paper, the transit-based evacuation network has been revised from different perspectives focusing on the symmetric type networks with their dominant evacuation planning routes to have the minimum evacuation cost.

show abstract

“…The flow of evacuees from the source to the sink over time is a non-negative function f on 𝐴𝐴 × ℝ #$ for given time T= {0, 1, 2, …, T-1} satisfying the flow conservation and the capacity constraints, (1)(2)(3). The inequality flow conservation constraints allow waiting for flow at intermediate nodes.…”

Section: Introductionmentioning

confidence: 99%

Role of Earliest Arrival Flow in an Evacuation Network

Adhikari

2024

Kaumodaki J.

View full text Add to dashboard Cite

Traffic route guidance, destination optimization, and optimal route choice are some of the approaches to accelerate the evacuation process of transit-based evacuation problems. Their effectiveness depends upon the evacuee arrival patterns at the pickup locations and their assignment in an appropriate way to the resources in the network. The arrival patterns of the evacuees at different pickup locations might be a constant or random variable, deterministic or stochastic, time-dependent, or flow-dependent, or can be categorized either way. In this work, we are focused on the collections of evacuees at the pickup locations from the danger zone in the earliest arrival flow patterns, which can be further assigned to the transit vehicles in the integrated evacuation network by treating such pickup locations as the sources for the subsequent process to minimize the overall network clearance time from the danger zone to the safety.

show abstract

Quickest Transshipment in an Evacuation Network Topology

Cited by 3 publications

References 11 publications

Quickest Transshipment in the Prioritized Evacuation Network

Quickest Transshipment in the Prioritized Evacuation Network

Route Dominance on Symmetric Type Transit-based Evacuation Network

Role of Earliest Arrival Flow in an Evacuation Network

Contact Info

Product

Resources

About