A Brief Note on Bus Based Evacuation Planning

Evacuation route planning is essential for emergency preparedness, especially in regions threatened by hurricanes, earthquake etc. The evacuees who do not travel on their own are gathered at few collection points, where they are brought on buses to take them to safe region in bus based evacuation. Bus based evacuation planning is more essential for developing country like Nepal. It is necessary to reach the destination as early as possible for bus based evacuation. The bus based evacuation planning (BEP) problem is a variant of vehicle routing problem that arises in emergency planning. The problem in this variant is that not all the evacuees can gather at the same time, elderly and handicaps may need special help like wheelchair and may need more pickup time. Another problem is that at the shelter, some people may need special care like medicine, oxygen etc. In this paper we review a mathematical model to minimize the duration of evacuation together with the dynamic programming and the branch and bound as solution procedures. Moreover, a brief report of a case study for Kathmandu has also been given.Journal of Institute of Science and TechnologyVolume 21, Issue 1, August 2016, page: 28-34

Download Full-text

A survey on network contraflow evacuation planningproblems

Journal of Science and Engineering ◽

10.3126/jsce.v3i0.22387 ◽

2015 ◽

Vol 3 ◽

pp. 44-53

Author(s):

Phanindra Prasad Bhandari ◽

Shree Ram Khadka

Keyword(s):

Network Flow ◽

Dynamic Network ◽

Route Planning ◽

Evacuation Planning ◽

Solution Strategies ◽

General Network ◽

Evacuation Route Planning ◽

Network Flow Optimization ◽

Evacuation Route ◽

Potential Remedy

Evacuation planning is becoming crucial due to an increasing number of natural and human-created disasters over last few decades. One of the efficient ways to model the evacuation situation is a network flow optimization model. This model captures most of the necessities of the evacuation planning. Moreover, dynamic network contraflow modeling is considered a potential remedy to decrease the congestion due to its direction reversal property and it addresses the challenges of evacuation route planning. However, there do not exist satisfactory analytical results to this model for general network. In this paper, it is tried to provide an annotated overview on dynamic network contraflow problems related to evacuation planning and to incorporate models and solution strategies to them developed in this field to date.

Download Full-text

Improvement of Evacuation Modeling by Considering Road Blockade in the Case of an Earthquake: A Case Study of Daitoku School District, Kanazawa City, Japan

Sustainability ◽

10.3390/su13052637 ◽

2021 ◽

Vol 13 (5) ◽

pp. 2637

Author(s):

Dinh-Thanh Nguyen ◽

Zhen-jiang Shen ◽

Minh-Hoang Truong ◽

Kenichi Sugihara

Keyword(s):

School District ◽

Urban Areas ◽

Route Planning ◽

Earthquake Occurrence ◽

Evacuation Modeling ◽

Visual Tool ◽

Earthquake Research ◽

Evacuation Route Planning ◽

Evacuation Route

In disaster management, evacuation modeling is considered a useful visual tool to disaster managers for reviewing current evacuation strategies, estimating the ability of shelters to accommodate all evacuees, and developing evacuation route planning. Though there are several existing studies on evacuation modeling in the case of an earthquake, research that integrates road blockades into evacuation simulations is quite limited. From that viewpoint, this research aims to develop evacuation modeling with consideration of road blockades to simulate how residents move to evacuation centers (hereafter, shelters) through urban areas following an earthquake occurrence. The research also determines difficulties that residents may encounter under earthquake conditions, compared with normal conditions, corresponding to considering or not considering road blockades, respectively, such as having no access to shelters, taking longer routes instead of shortest routes, and so on. Debris from damaged buildings in an urban area is assumed as the main source of debris that would cause a road blockade. The model is applied to a case study of the Daitoku school district in Kanazawa city. According to simulated results, due to road blockades, occupants of many damaged buildings did not have access to shelters, and a lot of evacuees needed to move to shelters with longer routes instead of taking the shortest routes. Furthermore, the research results show the possibility of considering road blockades for improving current evacuation modeling and making evacuation simulations more realistic.

Download Full-text

Integrating Human Behavior and Safety Measure into Evacuation Route Planning in a Volcanic Crisis

Jurnal Teknik Industri ◽

10.9744/jti.22.2.103-110 ◽

2020 ◽

Vol 22 (2) ◽

pp. 103-110

Author(s):

Budhi Wibowo ◽

Budi Hartono

Keyword(s):

Human Behavior ◽

Large Scale ◽

Route Planning ◽

Management Plan ◽

Human Cognition ◽

Merapi Volcano ◽

Cost Parameter ◽

Evacuation Route Planning ◽

Evacuation Route

Many traditional methods in evacuation route planning are motivated by the operational objective, such as total travel/clearance time. Little attention has been given to the human factor and the safety aspect of the evacuees during the planning phase. Our study aims to propose a simple yet practical route planning method that simultaneously considers human behavior, safety factor, and the travel time in a volcanic crisis context. The planning model is developed based on the shortest-path problem with a joint-cost parameter representing the three aspects. We present a large-scale street network in Merapi volcano as a case study. The result implies that employing a joint-cost parameter is effective for creating an evacuation route that is reasonably safe and in line with human cognition in navigation. The finding offers practical insights for the stakeholders as part of the greater effort to develop a systematic disaster management plan.

Download Full-text

Improving Transportation Services for the University of the Thai Chamber of Commerce: A Case Study on Solving the Mixed-Fleet Vehicle Routing Problem with Split Deliveries

10.1063/1.3078127 ◽

2009 ◽

Author(s):

N. Suthikarnnarunai ◽

E. Olinick ◽

Sio-Iong Ao ◽

Alan Hoi-Shou Chan ◽

Hideki Katagiri ◽

...

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Routing Problem ◽

Transportation Services ◽

Chamber Of Commerce ◽

Split Deliveries ◽

The University

Download Full-text

Capacitated vehicle routing problem model for carriers

Journal of Transport and Supply Chain Management ◽

10.4102/jtscm.v12i0.345 ◽

2018 ◽

Vol 12 ◽

Cited By ~ 3

Author(s):

Irma-Delia Rojas-Cuevas ◽

Santiago-Omar Caballero-Morales ◽

Jose-Luis Martinez-Flores ◽

Jose-Rafael Mendoza-Vazquez

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Network Flow ◽

Route Planning ◽

Test Problems ◽

Optimal Route ◽

Routing Problem ◽

Problem Model ◽

Capacitated Vehicle Routing Problem ◽

Capacitated Vehicle

Background: The Capacitated Vehicle Routing Problem (CVRP) is one of the most important transportation problems in logistics and supply chain management. The standard CVRP considers a fleet of vehicles with homogeneous capacity that depart from a warehouse, collect products from (or deliver products to) a set of customer locations (points) and return to the same warehouse. However, the operation of carrier companies and third-party transportation providers may follow a different network flow for collection and delivery. This may lead to non-optimal route planning through the use of the standard CVRP.Objective: To propose a model for carrier companies to obtain optimal route planning.Method: A Capacitated Vehicle Routing Problem for Carriers (CVRPfC) model is used to consider the distribution scenario where a fleet of vehicles depart from a vehicle storage depot, collect products from a set of customer points and deliver them to a specific warehouse before returning to the vehicle storage depot. Validation of the model’s functionality was performed with adapted CVRP test problems from the Vehicle Routing Problem LIBrary. Following this, an assessment of the model’s economic impact was performed and validated with data from a real carrier (real instance) with the previously described distribution scenario.Results: The route planning obtained through the CVRPfC model accurately described the network flow of the real instance and significantly reduced its distribution costs.Conclusion: The CVRPfC model can thus improve the competitiveness of the carriers by providing better fares to their customers, reducing their distribution costs in the process.

Download Full-text