Mixed-integer second-order cone programming model for bus route clustering problem
place - asia, mode - bus, planning - methods
Bus route cluster, Mixed-integer second-order cone program, Bus passenger
Bus route clustering problem (BRCP) concerns the assignment of bus routes to different boarding locations of a bus station with the objective of minimizing passenger waiting time. In this study, we formulate the BRCP as a mixed-integer second-order cone program (MISOCP). Simulations are conducted, in which the MISOCP model is applied to a major bus station in Hong Kong based on the network of actual bus routes. Experiments are tested for large size instances under different scenarios. Results show that the complexity of the BRCP is highly dependent on the overlapping degree of bus networks, while other factors, including the number of bus routes, destinations, and boarding locations have a joint effect; the influence is instance-specific based on different overlapping topologies of bus route networks.
Permission to publish the abstract has been given by Elsevier, copyright remains with them.
Wang, S., Zhang, W., Bie, Y., Wang, K., & Diabat, A. (2018). Mixed-integer second-order cone programming model for bus route clustering problem. Transportation Research Part C: Emerging Technologies, Vol. 102, pp.351-369.