摘要：Line planning is an important step in the strategic planning process of a public transportation system. In this paper, we discuss an optimization model for this problem in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the problem for path and tree network topologies as well as several categories of line operation that are important for the Quito TrolebÃfºs system. It turns out that, from a computational complexity worst case point of view, the problem is hard in all but the most simple variants. In practice, however, instances based on real data from the TrolebÃfºs System in Quito can be solved quite well, and significant optimization potentials can be demonstrated.
关键词：Line planning; computational complexity; public transport; combinatorial optimization
Loading...
