Lane-based evacuation network optimization: An integrated Lagrangian relaxation and tabu search approach
Lane-based evacuation network optimization: An integrated Lagrangian relaxation and tabu search approach
复制标题
DOI：
10.1016/j.trc.2010.03.007
复制
发表时间：
2011-02
影响因子：
8.3
通讯作者：
C. Xie;M. Turnquist
中科院分区：
文献类型：
--
作者：
C. Xie;M. Turnquist
本文提出并解决了一个基于车道的疏散网络优化问题，该问题集成了车道反转和交叉口消除策略。为了解决组合的复杂性所产生的离散网络容量和连接设置的组合治疗，一个集成的拉格朗日松弛和禁忌搜索解决方案的方法。该方法利用拉格朗日松弛法对问题进行分解，降低了问题的复杂度，同时基于禁忌搜索原理设计了算法逻辑。通过对某核电站区域疏散网络的优化计算，验证了该模型和求解方法的有效性和实用性。
This paper formulates and solves a lane-based evacuation network optimization problem that integrates lane reversal and crossing elimination strategies. To tackle the combinatorial complexity arising from this combined treatment of discrete network capacity and connectivity settings, an integrated Lagrangian relaxation and tabu search solution method is developed. The method takes advantage of Lagrangian relaxation for problem decomposition and complexity reduction while its algorithmic logic is designed based on the principles of tabu search. Numerical results from optimizing a regional evacuation network for a nuclear power plant illustrate the validness and usefulness of the modeling and solution methodology in evacuation planning practice.