We face the problem of designing a bus transit network, locating the most convenient bus stops and defining the set of bus lines without considering an a priori set of candidate lines. In order to model the problem, we consider a bimodal network composed of two layers, each one corresponding to a different transportation mode: pedestrian and bus. We propose two exact formulations and compare them by means of the $ϵ$-constraint method, thus obtaining a set of efficient solutions that simultaneously consider the total user travel time (composed of in-bus travel time, waiting time, walking time and transfer time) and service operator objectives. Finally, the best formulation is tested in a real case scenario.

我们面临着设计公交运输网络，找到最方便的公交车站并定义公交线路集合而没有考虑先验候选线路的问题。为了对问题进行建模，我们考虑了一个由两层组成的双峰网络，每一层都对应于一种不同的运输方式：行人和公共汽车。我们提出两个确切的公式，并通过$ϵ$-约束方法，从而获得一组有效的解决方案，同时考虑总的用户出行时间（由公交车出行时间，等待时间，步行时间和中转时间组成）和服务运营商的目标。最后，在实际情况下测试最佳配方。