{"title":"一项促进社区拼车的旅行者奖励计划","authors":"Amirmahdi Tafreshian, Neda Masoud","doi":"10.1287/trsc.2021.1121","DOIUrl":null,"url":null,"abstract":"Traffic congestion has become a serious issue around the globe, partly owing to single-occupancy commuter trips. Ridesharing can present a suitable alternative for serving commuter trips. However, there are several important obstacles that impede ridesharing systems from becoming a viable mode of transportation, including the lack of a guarantee for a ride back home as well as the difficulty of obtaining a critical mass of participants. This paper addresses these obstacles by introducing a traveler incentive program (TIP) to promote community-based ridesharing with a ride back home guarantee among commuters. The TIP program allocates incentives to (1) directly subsidize a select set of ridesharing rides and (2) encourage a small, carefully selected set of travelers to change their travel behavior (i.e., departure or arrival times). We formulate the underlying ride-matching problem as a budget-constrained min-cost flow problem and present a Lagrangian relaxation-based algorithm with a worst-case optimality bound to solve large-scale instances of this problem in polynomial time. We further propose a polynomial-time, budget-balanced version of the problem. Numerical experiments suggest that allocating subsidies to change travel behavior is significantly more beneficial than directly subsidizing rides. Furthermore, using a flat tax rate as low as 1% can double the system’s social welfare in the budget-balanced variant of the incentive program.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"25 1","pages":"827-847"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Traveler Incentive Program for Promoting Community-Based Ridesharing\",\"authors\":\"Amirmahdi Tafreshian, Neda Masoud\",\"doi\":\"10.1287/trsc.2021.1121\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traffic congestion has become a serious issue around the globe, partly owing to single-occupancy commuter trips. Ridesharing can present a suitable alternative for serving commuter trips. However, there are several important obstacles that impede ridesharing systems from becoming a viable mode of transportation, including the lack of a guarantee for a ride back home as well as the difficulty of obtaining a critical mass of participants. This paper addresses these obstacles by introducing a traveler incentive program (TIP) to promote community-based ridesharing with a ride back home guarantee among commuters. The TIP program allocates incentives to (1) directly subsidize a select set of ridesharing rides and (2) encourage a small, carefully selected set of travelers to change their travel behavior (i.e., departure or arrival times). We formulate the underlying ride-matching problem as a budget-constrained min-cost flow problem and present a Lagrangian relaxation-based algorithm with a worst-case optimality bound to solve large-scale instances of this problem in polynomial time. We further propose a polynomial-time, budget-balanced version of the problem. Numerical experiments suggest that allocating subsidies to change travel behavior is significantly more beneficial than directly subsidizing rides. Furthermore, using a flat tax rate as low as 1% can double the system’s social welfare in the budget-balanced variant of the incentive program.\",\"PeriodicalId\":23247,\"journal\":{\"name\":\"Transp. Sci.\",\"volume\":\"25 1\",\"pages\":\"827-847\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transp. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/trsc.2021.1121\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transp. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/trsc.2021.1121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Traveler Incentive Program for Promoting Community-Based Ridesharing
Traffic congestion has become a serious issue around the globe, partly owing to single-occupancy commuter trips. Ridesharing can present a suitable alternative for serving commuter trips. However, there are several important obstacles that impede ridesharing systems from becoming a viable mode of transportation, including the lack of a guarantee for a ride back home as well as the difficulty of obtaining a critical mass of participants. This paper addresses these obstacles by introducing a traveler incentive program (TIP) to promote community-based ridesharing with a ride back home guarantee among commuters. The TIP program allocates incentives to (1) directly subsidize a select set of ridesharing rides and (2) encourage a small, carefully selected set of travelers to change their travel behavior (i.e., departure or arrival times). We formulate the underlying ride-matching problem as a budget-constrained min-cost flow problem and present a Lagrangian relaxation-based algorithm with a worst-case optimality bound to solve large-scale instances of this problem in polynomial time. We further propose a polynomial-time, budget-balanced version of the problem. Numerical experiments suggest that allocating subsidies to change travel behavior is significantly more beneficial than directly subsidizing rides. Furthermore, using a flat tax rate as low as 1% can double the system’s social welfare in the budget-balanced variant of the incentive program.