Xinyi Zhang , Ada Che , Peng Wu , Andrea D’ Ariano
{"title":"在出行时间不确定的情况下,通过预留车道设计可靠的公交服务,保证准时到达","authors":"Xinyi Zhang , Ada Che , Peng Wu , Andrea D’ Ariano","doi":"10.1016/j.trb.2025.103322","DOIUrl":null,"url":null,"abstract":"<div><div>The deployment of dedicated bus lanes is a crucial strategy to improve the appeal of bus transit and is significantly affected by a variety of unpredictable events. This study proposes and investigates a novel optimization problem that jointly considers bus lane deployment and bus routing under uncertain travel times, with the objective of achieving reliable bus services with on-time arrivals. We first formulate it as a stochastic programming model. By leveraging prior data, we then construct a flexible moment information-based ambiguity set to capture uncertain link travel times and incorporate it into a distributionally robust optimization (DRO) model with a probabilistic objective function. The DRO model maximizes the reliability of bus services, defined as the probability of ensuring that a bus arrives on time at each stop in the worst-case scenario while simultaneously limiting passenger waiting times. Furthermore, we introduce a convex decision measure called <em>Probability of Violation Risk</em> to evaluate the risk of any stop not being arrived at within the predetermined expected time window. The designed model is then reformulated as a more tractable mixed-integer second-order cone program, upon which a two-stage matheuristic algorithm (TSMA) is developed specifically to solve large-scale realistic networks. Extensive computational tests are performed to verify the effectiveness and efficiency of the TSMA. The results demonstrate that the DRO model can generate robust dedicated lane deployment and bus routing schemes, with worst-case performance that surpasses those achieved using the widely adopted sample average approximation-based approach, an adapted Monte Carlo simulation-based metaheuristic algorithm, and the conventional Bonferroni correction-based method. Moreover, we compare the obtained solutions with those derived from deterministic and robust optimization models, as well as the DRO model based on the traditional moment ambiguity set. Additionally, we conduct numerical experiments to draw meaningful conclusions regarding the budget, maximum negative impact, tightness of expected arrival time windows, and on-time stop arrival rates.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"201 ","pages":"Article 103322"},"PeriodicalIF":6.3000,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Designing reliable bus services with on-time arrival via lane reservation under uncertain travel times\",\"authors\":\"Xinyi Zhang , Ada Che , Peng Wu , Andrea D’ Ariano\",\"doi\":\"10.1016/j.trb.2025.103322\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The deployment of dedicated bus lanes is a crucial strategy to improve the appeal of bus transit and is significantly affected by a variety of unpredictable events. This study proposes and investigates a novel optimization problem that jointly considers bus lane deployment and bus routing under uncertain travel times, with the objective of achieving reliable bus services with on-time arrivals. We first formulate it as a stochastic programming model. By leveraging prior data, we then construct a flexible moment information-based ambiguity set to capture uncertain link travel times and incorporate it into a distributionally robust optimization (DRO) model with a probabilistic objective function. The DRO model maximizes the reliability of bus services, defined as the probability of ensuring that a bus arrives on time at each stop in the worst-case scenario while simultaneously limiting passenger waiting times. Furthermore, we introduce a convex decision measure called <em>Probability of Violation Risk</em> to evaluate the risk of any stop not being arrived at within the predetermined expected time window. The designed model is then reformulated as a more tractable mixed-integer second-order cone program, upon which a two-stage matheuristic algorithm (TSMA) is developed specifically to solve large-scale realistic networks. Extensive computational tests are performed to verify the effectiveness and efficiency of the TSMA. The results demonstrate that the DRO model can generate robust dedicated lane deployment and bus routing schemes, with worst-case performance that surpasses those achieved using the widely adopted sample average approximation-based approach, an adapted Monte Carlo simulation-based metaheuristic algorithm, and the conventional Bonferroni correction-based method. Moreover, we compare the obtained solutions with those derived from deterministic and robust optimization models, as well as the DRO model based on the traditional moment ambiguity set. Additionally, we conduct numerical experiments to draw meaningful conclusions regarding the budget, maximum negative impact, tightness of expected arrival time windows, and on-time stop arrival rates.</div></div>\",\"PeriodicalId\":54418,\"journal\":{\"name\":\"Transportation Research Part B-Methodological\",\"volume\":\"201 \",\"pages\":\"Article 103322\"},\"PeriodicalIF\":6.3000,\"publicationDate\":\"2025-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part B-Methodological\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0191261525001717\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0191261525001717","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
Designing reliable bus services with on-time arrival via lane reservation under uncertain travel times
The deployment of dedicated bus lanes is a crucial strategy to improve the appeal of bus transit and is significantly affected by a variety of unpredictable events. This study proposes and investigates a novel optimization problem that jointly considers bus lane deployment and bus routing under uncertain travel times, with the objective of achieving reliable bus services with on-time arrivals. We first formulate it as a stochastic programming model. By leveraging prior data, we then construct a flexible moment information-based ambiguity set to capture uncertain link travel times and incorporate it into a distributionally robust optimization (DRO) model with a probabilistic objective function. The DRO model maximizes the reliability of bus services, defined as the probability of ensuring that a bus arrives on time at each stop in the worst-case scenario while simultaneously limiting passenger waiting times. Furthermore, we introduce a convex decision measure called Probability of Violation Risk to evaluate the risk of any stop not being arrived at within the predetermined expected time window. The designed model is then reformulated as a more tractable mixed-integer second-order cone program, upon which a two-stage matheuristic algorithm (TSMA) is developed specifically to solve large-scale realistic networks. Extensive computational tests are performed to verify the effectiveness and efficiency of the TSMA. The results demonstrate that the DRO model can generate robust dedicated lane deployment and bus routing schemes, with worst-case performance that surpasses those achieved using the widely adopted sample average approximation-based approach, an adapted Monte Carlo simulation-based metaheuristic algorithm, and the conventional Bonferroni correction-based method. Moreover, we compare the obtained solutions with those derived from deterministic and robust optimization models, as well as the DRO model based on the traditional moment ambiguity set. Additionally, we conduct numerical experiments to draw meaningful conclusions regarding the budget, maximum negative impact, tightness of expected arrival time windows, and on-time stop arrival rates.
期刊介绍:
Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.