scholarly journals A Modified -Median Model for the Emergency Facilities Location Problem and Its Variable Neighbourhood Search-Based Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Menghao Xi ◽  
Feng Ye ◽  
Zhong Yao ◽  
Qiuhong Zhao

Emergency incidents, including natural disasters, terrorist attacks, public health outbreaks, and industrial and mining accidents, and so forth, result in severe human casualties and property losses. Emergency facilities, which provide relief materials and services, play an important role in rescue management. The decision of where to locate the emergency rescue facilities is very important, as it determines the efficiency and effectiveness of the emergency management process. This paper develops a modified -median problem model that accounts for rescue time limitations. A variable neighbourhood search- (VNS-) based algorithm is developed for the model considered. The modified VNS algorithm exhibits good performance on -median benchmark problems. A case from Western China is studied, and a reasonable location decision is then made for emergency rescue facilities using the modified VNS algorithm. The paper also compares the results with and without considering the rescue time limitation.

2019 ◽  
Vol 38 (1) ◽  
pp. 181-194 ◽  
Author(s):  
Jianliang Yang ◽  
Hanping Hou ◽  
Yong Chen ◽  
Lu Han

Purpose Based on the context of the Internet of Things (IoT), the territorial public emergency supplies will be networked, platform-based management, unified emergency dispatch. The problem of supplies dispatching in the “last kilometer” of emergency is solved, and the supplies needed in the disaster area are promptly delivered to the hands of the victims so that they can quickly be rescued after the disaster and to save valuable time for rapid rescue, which can greatly decrease casualties and property losses. This paper aims to discuss these issues. Design/methodology/approach By analyzing the shortage of existing emergency supplies dispatching research and taking all factors such as disaster area demand, social reserve, road conditions, mode of transport, loading limit, disaster area satisfaction rate and road capacity into consideration under the background of IoT, a variety of the territorial emergency supplies dispatching model with more rescue points, more affected areas are constructed. The objective function of the model is to aim in finding the shortest rescue time, giving the solution algorithm, and finally simulating the simulation case. Findings Based on the context of the IoT, the territorial public emergency supplies will be networked, platform-based management, unified emergency dispatch. Considering factors such as road conditions, modes of transport and road capacity, the authors construct a number of emergency rescue plans, multiple disaster scenarios and various emergency supplies dispatching models. The authors simulate the situation through simulation cases with the shortest time being the ultimate goal. The problem of supplies dispatching in the “last kilometer” of emergency is solved, and the supplies needed in the disaster area are promptly delivered to the hands of the victims so that they can quickly be rescued after the disaster and to save valuable time for rapid rescue, which can greatly decrease casualties and property losses. Originality/value This paper provides little research on the dispatch of emergency supplies. The problems of direct dispatch from the rescue point to the affected area and dispatch of supplies without relying on the arrival of emergency supplies at the rear are addressed. Therefore, this study does not focus on the arrival of emergency supplies at the rear but on direct dispatching issues during territorial public emergency supplies from the rescue point to the disaster point.


2003 ◽  
Vol 7 (19) ◽  
Author(s):  
P. Hansen ◽  
N. Mladenovic ◽  
J.A. Moreno

Author(s):  
D. Guimarans ◽  
R. Herrero ◽  
J. J. Ramos ◽  
S. Padrón

This paper presents a methodology based on the Variable Neighbourhood Search metaheuristic, applied to the Capacitated Vehicle Routing Problem. The presented approach uses Constraint Programming and Lagrangean Relaxation methods in order to improve algorithm’s efficiency. The complete problem is decomposed into two separated subproblems, to which the mentioned techniques are applied to obtain a complete solution. With this decomposition, the methodology provides a quick initial feasible solution which is rapidly improved by metaheuristics’ iterative process. Constraint Programming and Lagrangean Relaxation are also embedded within this structure to ensure constraints satisfaction and to reduce the calculation burden. By means of the proposed methodology, promising results have been obtained. Remarkable results presented in this paper include a new best-known solution for a rarely solved 200-customers test instance, as well as a better alternative solution for another benchmark problem.


Sign in / Sign up

Export Citation Format

Share Document