首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到4条相似文献,搜索用时 0 毫秒
1.
Evacuation planning is a fundamental requirement to ensure that most people can be evacuated to a safe area when a natural accident or an intentional act happens in a stadium environment. The central challenge in evacuation planning is to determine the optimum evacuation routing to safe areas. We describe the evacuation network within a stadium as a hierarchical directed network. We propose a multi-objective optimization approach to solve the evacuation routing problem on the basis of this hierarchical directed network. This problem involves three objectives that need to be achieved simultaneously, such as minimization of total evacuation time, minimization of total evacuation distance and minimal cumulative congestion degrees in an evacuation process. To solve this problem, we designed a modified ant colony optimization (ACO) algorithm, implemented it in the MATLAB software environment, and tested it using a stadium at the Wuhan Sports Center in China. We demonstrate that the algorithm can solve the problem, and has a better evacuation performance in terms of organizing evacuees’ space-time paths than the ACO algorithm, the kth shortest path algorithm and the second generation of non-dominated sorting genetic algorithm were used to improve the results from the kth shortest path algorithm.  相似文献   

2.
We propose a multi-depot location-routing model considering network failure, multiple uses of vehicles, and standard relief time. The model determines the locations of local depots and routing for last mile distribution after an earthquake. The model is extended to a two-stage stochastic program with random travel time to ascertain the locations of distribution centers. Small instances have been solved to optimality in GAMS. A variable neighborhood search algorithm is devised to solve the deterministic model. Computational results of our case study show that the unsatisfied demands can be significantly reduced at the cost of higher number of local depots and vehicles.  相似文献   

3.
We describe a hierarchical cluster and route procedure (HOGCR) for coordinating vehicle routing in large-scale post-disaster distribution and evacuation activities. The HOGCR is a multi-level clustering algorithm that groups demand nodes into smaller clusters at each planning level, enabling the optimal solution of cluster routing problems. The routing problems are represented as capacitated network flow models that are solved optimally and independently by CPLEX on a parallel computing platform. The HOGCR preserves the consistency among parent and child cluster solutions obtained at consecutive levels. We assess the performance of the algorithm by using large scale scenarios and find satisfactory results.  相似文献   

4.
Quick response to the urgent relief needs right after natural disasters through efficient emergency logistics distribution is vital to the alleviation of disaster impact in the affected areas, which remains challenging in the field of logistics and related study areas. This paper presents a hybrid fuzzy clustering-optimization approach to the operation of emergency logistics co-distribution responding to the urgent relief demands in the crucial rescue period. Based on a proposed three-layer emergency logistics co-distribution conceptual framework, the proposed methodology involves two recursive mechanisms: (1) disaster-affected area grouping, and (2) relief co-distribution. Numerical studies with a real large-scale earthquake disaster occurring in Taiwan are conducted, and the corresponding results indicate the applicability of the proposed method and its potential advantages. We hope that this study can not only make the proposed emergency logistics system available with more benefits to the development of emergency logistics systems for the urgent needs of disaster areas around the world but also stimulate more excellent researches concerning emergency logistics management.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号