Mixed-integer second-order cone programming model for bus route clustering problem

•Propose a practical bus route clustering problem (BRCP).•Formulate a mixed-integer second-order cone programming (MISOCP) model.•Prove the problem is NP-hard.•Conduct extensive numerical experiments. Bus route clustering problem (BRCP) concerns the assignment of bus routes to different boarding loc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Transportation research. Part C, Emerging technologies Ročník 102; s. 351 - 369
Hlavní autoři: Wang, Shuaian, Zhang, Wei, Bie, Yiming, Wang, Kai, Diabat, Ali
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.05.2019
Témata:
Bus passenger
Bus route cluster
Mixed-integer second-order cone program
Bus passenger
Mixed-integer second-order cone program
Bus route cluster
ISSN:0968-090X, 1879-2359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Propose a practical bus route clustering problem (BRCP).•Formulate a mixed-integer second-order cone programming (MISOCP) model.•Prove the problem is NP-hard.•Conduct extensive numerical experiments. 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.
ISSN:0968-090X
1879-2359
DOI:10.1016/j.trc.2019.03.019