Urban rapid transit network design: accelerated Benders decomposition
Urban rapid transit network design: accelerated Benders decomposition
复制标题
城市快速交通网络设计：加速本德斯分解
DOI：
--
复制
发表时间：
2009
影响因子：
4.8
通讯作者：
Patricia Jaramillo
中科院分区：
文献类型：
--
作者：
Á. Marín;Patricia Jaramillo
本文提出了一个城市快速交通网络设计模型，其中包括在城市交通背景下的列车路线和车站的位置。该设计试图在有限的预算和公交线路数量的情况下，利用新的基础设施最大限度地满足公共交通需求。定位问题还包括用户可以选择他们的交通方式和行程的事实。在真实的情况下，该问题的求解是复杂的，因为它有成千上万的二进制变量和约束，并且不能有效地解决分支和界限。为此，人们定义了一些基于Benders分解的算法来求解该问题，并在测试网络中对这些算法进行了比较。
This paper presents an urban rapid transit network design model, which consists of the location of train alignments and stations in an urban traffic context. The design attempts to maximize the public transportation demand using the new infrastructure, considering a limited budget and number of transit lines. The location problem also incorporates the fact that users can choose their transportation mode and trips. In real cases, this problem is complex to solve because it has thousands of binary variables and constraints, and cannot be solved efficiently by Branch and Bound. For this reason, some algorithms based on Benders decomposition have been defined in order to solve it. These algorithms have been compared in test networks.