An extension of the schedule optimization problem at a public transit terminal to the multiple destinations case

摘要

We present a mathematical model to optimize the number of output lines leaving from a transit terminal (in which passengers are supposed to split among different lines, or even change mode of transportation) and their departure times in the aperiodic case. The model is an extension to the multiple destination case of the Schedule Optimization Problem described in (Bruno et al. in OR Spectr. 31(3):465–481, 2009). The proposed model is shown to be NP-hard due to its similarities to the Multi-Item Capacitated Lot Sizing Problem. We provide computational results in order to show that the model can be used to solve instances of significant size.