ABSTRACT This paper develops an efficient heuristic for the transit network design problem, formulated as an integer programming problem. The model includes a preliminary step of route set generation, followed by an iterative procedure that simultaneously selects the best routes and corresponding headways. The iterative procedure is performed by an infeasible start algorithm that first assigns all candidate routes with the maximal frequency, and then iteratively eliminates routes and decreases frequencies of the less attractive ones. Routes are evaluated through a frequency-based transit assignment model that considers online information. The proposed model is applied to the Winnipeg transit network. The transit network found by the suggested model comprised fewer, faster and more frequent lines that serve high volume of passengers, compared to the given transit network. The running time of the algorithm is very short compared to existing methods, and its simplicity enables high level and detailed calibration.

中文翻译：

---

公交线路网络设计问题的不可行启动启发式算法

摘要 本文为交通网络设计问题开发了一种有效的启发式方法，将其表述为整数规划问题。该模型包括路线集生成的初步步骤，随后是同时选择最佳路线和相应车头时距的迭代过程。迭代过程由不可行的开始算法执行，该算法首先为所有候选路线分配最大频率，然后迭代地消除路线并减少不太有吸引力的路线的频率。通过考虑在线信息的基于频率的交通分配模型来评估路线。所提出的模型应用于温尼伯公交网络。建议模型发现的公交网络包括更少、更快和更频繁的线路，为大量乘客提供服务，与给定的交通网络相比。与现有方法相比，该算法的运行时间非常短，并且其简单性可以实现高水平和详细的校准。