Pub Date : 2025-12-19DOI: 10.1016/j.trb.2025.103380
Jeppe Rich
{"title":"Beyond Box-Cox: A diffusion-inspired functional framework for nonlinear demand and discrete choice modeling","authors":"Jeppe Rich","doi":"10.1016/j.trb.2025.103380","DOIUrl":"https://doi.org/10.1016/j.trb.2025.103380","url":null,"abstract":"","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"248 1","pages":""},"PeriodicalIF":6.8,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145786101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1016/j.trb.2025.103379
Housheng Zhou, Hongyang Wang, Hai Wang, Jianguo Qi, Lixing Yang
{"title":"Seamless urban metro networks: A shared depot perspective on rolling stock scheduling","authors":"Housheng Zhou, Hongyang Wang, Hai Wang, Jianguo Qi, Lixing Yang","doi":"10.1016/j.trb.2025.103379","DOIUrl":"https://doi.org/10.1016/j.trb.2025.103379","url":null,"abstract":"","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"59 1","pages":""},"PeriodicalIF":6.8,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145785142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-17DOI: 10.1016/j.trb.2025.103378
Wenbo Sun, Lingxiao Wu, Fangni Zhang
{"title":"Robust optimization for truck-and-drone collaboration with travel time uncertainties","authors":"Wenbo Sun, Lingxiao Wu, Fangni Zhang","doi":"10.1016/j.trb.2025.103378","DOIUrl":"https://doi.org/10.1016/j.trb.2025.103378","url":null,"abstract":"","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"42 1","pages":""},"PeriodicalIF":6.8,"publicationDate":"2025-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145786103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-15DOI: 10.1016/j.trb.2025.103361
Tatsuhito Kono, Nozomu Takamura
This paper explores the efficient capacity of the bottleneck and road pricing in a city, subject to the fiscal constraint financing the whole urban road network including the bottleneck. To do this, considering that most cities collect their public fund from property tax, we set three regimes: Regime 1, where congestion pricing is imposed with property tax; Regime 2, where the flat per-kilometer charge is imposed with property tax; Regime 3, where floor area ratio (FAR) regulations and flat per-kilometer charge are imposed with property tax. We derive theoretical properties in each regime. First, in Regime 1, even subject to fiscal constraints, the congestion pricing formula is equal to that of Arnott et al. (1990, 1993), but the optimal capacity should be smaller than that in the presence of a lump-sum tax, reflecting the endogenous marginal cost of public funds. As a result, the congestion pricing revenue exceeds the cost of optimizing the bottleneck capacity. In addition, we show that, only in Regime 3, property tax does not generate deadweight losses owing to the imposition of FAR regulation. Finally, setting the regime of property tax only as the base, our quantitative simulations show that Regime 1 has about 90 % of the welfare increase of the first best, Regime 3 has about 50 % of the increase, and Regime 2 has about 15 % of the increase.
本文研究了在财政约束下包括瓶颈在内的整个城市路网的有效通行能力和道路收费问题。为了做到这一点，考虑到大多数城市从财产税中收取公共资金，我们设定了三种制度：制度一，在征收财产税的同时征收拥堵费；制度2，每公里统一收费与财产税一起征收；制度3，建筑面积比率（FAR）规定和每公里单位收费与财产税一起征收。我们推导出每一种状态的理论性质。首先，在制度1中，即使在财政约束下，拥堵定价公式与Arnott et al.（1990,1993）的公式是相等的，但最优容量应该小于一次性征税时的容量，这反映了公共资金的内生边际成本。因此，拥堵收费的收益超过了优化瓶颈容量的成本。此外，我们还表明，只有在制度3中，财产税才不会因为实施FAR监管而产生无谓损失。最后，仅以财产税制度为基础，我们的定量模拟表明，制度1的福利增幅约为前优的90%，制度3的福利增幅约为50%，制度2的福利增幅约为15%。
{"title":"Road price and capacity policies subject to a fiscal constraint in a city","authors":"Tatsuhito Kono, Nozomu Takamura","doi":"10.1016/j.trb.2025.103361","DOIUrl":"https://doi.org/10.1016/j.trb.2025.103361","url":null,"abstract":"This paper explores the efficient capacity of the bottleneck and road pricing in a city, subject to the fiscal constraint financing the whole urban road network including the bottleneck. To do this, considering that most cities collect their public fund from property tax, we set three regimes: Regime 1, where congestion pricing is imposed with property tax; Regime 2, where the flat per-kilometer charge is imposed with property tax; Regime 3, where floor area ratio (FAR) regulations and flat per-kilometer charge are imposed with property tax. We derive theoretical properties in each regime. First, in Regime 1, even subject to fiscal constraints, the congestion pricing formula is equal to that of Arnott et al. (1990, 1993), but the optimal capacity should be smaller than that in the presence of a lump-sum tax, reflecting the endogenous marginal cost of public funds. As a result, the congestion pricing revenue exceeds the cost of optimizing the bottleneck capacity. In addition, we show that, only in Regime 3, property tax does not generate deadweight losses owing to the imposition of FAR regulation. Finally, setting the regime of property tax only as the base, our quantitative simulations show that Regime 1 has about 90 % of the welfare increase of the first best, Regime 3 has about 50 % of the increase, and Regime 2 has about 15 % of the increase.","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"1 1","pages":""},"PeriodicalIF":6.8,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145759784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-12DOI: 10.1016/j.trb.2025.103376
Qingyun Tian , Yun Hui Lin , Kaidi Yang , David Z.W. Wang
This paper studies the optimal location and pricing scheme of Park-and-Ride (P&R) services specifically designed for Autonomous Vehicles (AVs). The unique features of self-cruising and autonomous parking allow AV users to drive directly to the transit stations to access transit service while letting AVs self-cruise and park at P&R stations. This will cause AV users to make different choices regarding P&R stations compared to those driving traditional human-driven vehicles (HVs). Consequently, the layout of P&R stations and service charges designed for AVs may deviate significantly from the existing P&R service design for HVs. Standing from the perspective of P&R service operators, we formulate a bilevel model that captures the intricate interplay between service design and travelers’ choices, which aims to maximize the derived profit for operating P&R services by optimizing the location and pricing scheme of P&R stations. To solve the proposed bilevel programming effectively, we present two exact solution approaches, i.e., the mixed-integer linear programming reformulation approach and value-function-based exact solution approach. Numerical experiments are conducted to evaluate the proposed model and solution methods. Based on the results, we find that the P&R service designs for HVs and AVs are considerably different, and the P&R service will be more advantageous in the era of AVs. Through sensitivity analysis, we analyze the impacts of multiple parameters on the model solutions. The results of this study will provide guidance and insights for the deployment of P&R service in the future mobility system with AVs.
{"title":"Locating and pricing park-and-ride service in the era of autonomous vehicles","authors":"Qingyun Tian , Yun Hui Lin , Kaidi Yang , David Z.W. Wang","doi":"10.1016/j.trb.2025.103376","DOIUrl":"10.1016/j.trb.2025.103376","url":null,"abstract":"<div><div>This paper studies the optimal location and pricing scheme of Park-and-Ride (P&R) services specifically designed for Autonomous Vehicles (AVs). The unique features of self-cruising and autonomous parking allow AV users to drive directly to the transit stations to access transit service while letting AVs self-cruise and park at P&R stations. This will cause AV users to make different choices regarding P&R stations compared to those driving traditional human-driven vehicles (HVs). Consequently, the layout of P&R stations and service charges designed for AVs may deviate significantly from the existing P&R service design for HVs. Standing from the perspective of P&R service operators, we formulate a bilevel model that captures the intricate interplay between service design and travelers’ choices, which aims to maximize the derived profit for operating P&R services by optimizing the location and pricing scheme of P&R stations. To solve the proposed bilevel programming effectively, we present two exact solution approaches, i.e., the mixed-integer linear programming reformulation approach and value-function-based exact solution approach. Numerical experiments are conducted to evaluate the proposed model and solution methods. Based on the results, we find that the P&R service designs for HVs and AVs are considerably different, and the P&R service will be more advantageous in the era of AVs. Through sensitivity analysis, we analyze the impacts of multiple parameters on the model solutions. The results of this study will provide guidance and insights for the deployment of P&R service in the future mobility system with AVs.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103376"},"PeriodicalIF":6.3,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145732477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-12DOI: 10.1016/j.trb.2025.103371
Dan Zhu , Tingting Xie , Yang Liu , Napat Rujeerapaiboon
<div><div>Intersections often become bottlenecks, leading to delays due to stop-and-go operations for navigating conflicting traffic movements. Connected and autonomous vehicles (CAVs) are expected to alleviate this issue by coordinating their movement to navigate intersections smoothly without traffic signals. However, it may take time for human-driven vehicles (HVs) to be replaced by CAVs. During this transition period, we aim to develop a hybrid intersection design (HID) that strategically integrates signal-free smart intersections with traditional signal-based ones by optimizing the locations of smart intersections and setting appropriate signal timings for conventional intersections. This HID approach may result in distributional welfare effects across different road users, with HV users potentially facing disadvantages because they have no access to smart intersections and their connecting links. To facilitate equitable HIDs, we develop four bi-level programming models that address the inequity issue by incorporating considerations of ethical principles, including utilitarian, sufficient, difference, and maximax principles. For each bi-level program, the transportation planner determines HID decisions, incorporating equity into the objectives and/or constraints as guided by the underlying ethical principle, at the upper level, whereas travelers make their user optimal routing choices with the given equitable HID at the lower level. We formulate the lower-level problem as signal-free smart intersections embedded network equilibrium with mixed traffic and derive its equivalent variational inequality (VI) problem, and prove the existence of VI solutions. Besides, we prove that no traveler will be worse off for HID under the difference principle compared to the signal-based control, and establish the relationship of total travel times for HIDs under four ethical principles. To solve these bi-level programs, we first reformulate them into single-level mathematical programs with equilibrium constraints (MPECs). These MPECs are approximated by the corresponding mixed-integer linear programs (MILPs), which enables existing algorithms for their approximated global optimum. We further generalize a non-uniform breakpoint selection technique with a proven minimal number of breakpoints to significantly reduce the problem size without compromising its computation accuracy. Besides, we develop a domain resizing technique to further reduce the problem size and enhance computational efficiency. Furthermore, since solving MILPs provides a lower bound for the original MPECs, we propose a modified augmented Lagrangian multiplier (MALM) approach to evaluate MILPs’ solution quality, which generates feasible solutions that serve as upper bounds for the MPECs. The consistently small gap ratios (<em>i.e.,</em> 1 %) across all tested cases strongly validate that the developed MILPs are highly effective in finding solutions close to the global optimum for the MPECs.
{"title":"Equitable transportation network design for signal-free smart intersections","authors":"Dan Zhu , Tingting Xie , Yang Liu , Napat Rujeerapaiboon","doi":"10.1016/j.trb.2025.103371","DOIUrl":"10.1016/j.trb.2025.103371","url":null,"abstract":"<div><div>Intersections often become bottlenecks, leading to delays due to stop-and-go operations for navigating conflicting traffic movements. Connected and autonomous vehicles (CAVs) are expected to alleviate this issue by coordinating their movement to navigate intersections smoothly without traffic signals. However, it may take time for human-driven vehicles (HVs) to be replaced by CAVs. During this transition period, we aim to develop a hybrid intersection design (HID) that strategically integrates signal-free smart intersections with traditional signal-based ones by optimizing the locations of smart intersections and setting appropriate signal timings for conventional intersections. This HID approach may result in distributional welfare effects across different road users, with HV users potentially facing disadvantages because they have no access to smart intersections and their connecting links. To facilitate equitable HIDs, we develop four bi-level programming models that address the inequity issue by incorporating considerations of ethical principles, including utilitarian, sufficient, difference, and maximax principles. For each bi-level program, the transportation planner determines HID decisions, incorporating equity into the objectives and/or constraints as guided by the underlying ethical principle, at the upper level, whereas travelers make their user optimal routing choices with the given equitable HID at the lower level. We formulate the lower-level problem as signal-free smart intersections embedded network equilibrium with mixed traffic and derive its equivalent variational inequality (VI) problem, and prove the existence of VI solutions. Besides, we prove that no traveler will be worse off for HID under the difference principle compared to the signal-based control, and establish the relationship of total travel times for HIDs under four ethical principles. To solve these bi-level programs, we first reformulate them into single-level mathematical programs with equilibrium constraints (MPECs). These MPECs are approximated by the corresponding mixed-integer linear programs (MILPs), which enables existing algorithms for their approximated global optimum. We further generalize a non-uniform breakpoint selection technique with a proven minimal number of breakpoints to significantly reduce the problem size without compromising its computation accuracy. Besides, we develop a domain resizing technique to further reduce the problem size and enhance computational efficiency. Furthermore, since solving MILPs provides a lower bound for the original MPECs, we propose a modified augmented Lagrangian multiplier (MALM) approach to evaluate MILPs’ solution quality, which generates feasible solutions that serve as upper bounds for the MPECs. The consistently small gap ratios (<em>i.e.,</em> 1 %) across all tested cases strongly validate that the developed MILPs are highly effective in finding solutions close to the global optimum for the MPECs. ","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103371"},"PeriodicalIF":6.3,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145732476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-10DOI: 10.1016/j.trb.2025.103377
Siqiao Li , Xiaoning Zhu , Pan Shang , Tom Van Woensel , Yu Yao
This study investigates a shared-use metro network in which passengers and freight are transported on different trains, enhancing resource utilization and promoting the sustainable growth of urban areas. From the perspective of public authorities seeking to balance the interests of all stakeholders, we address the tactical problem of determining the optimal number, stop pattern, and schedule of freight train services needed for freight delivery, while maintaining high passenger service quality by minor timetable adjustments. A non-convex mixed-integer quadratic programming model is developed to minimize freight transportation, train operational costs, and deviations in passenger train schedules. A Frank-Wolfe-based heuristic is developed with a novel gradient approximation that accounts for the hierarchy between binary and continuous decisions. The step size is defined as a discrete gap between disjoint subspaces determined by train operations, reflecting that partially shifting flow does not effectively impact the objective due to the indivisibility of train activation. Experiments are conducted based on instances generated from the Beijing Metro network. The results show that under high freight demand, dedicated freight trains cause less passenger delay than utilizing existing passenger trains. Prioritizing passenger schedules shifts freight to lower-priority lines, while incorporating a quadratic consolidation cost helps reduce fragmentation and excessive transhipments.
{"title":"Joint optimization of train services and freight delivery in a metro-based underground logistics system","authors":"Siqiao Li , Xiaoning Zhu , Pan Shang , Tom Van Woensel , Yu Yao","doi":"10.1016/j.trb.2025.103377","DOIUrl":"10.1016/j.trb.2025.103377","url":null,"abstract":"<div><div>This study investigates a shared-use metro network in which passengers and freight are transported on different trains, enhancing resource utilization and promoting the sustainable growth of urban areas. From the perspective of public authorities seeking to balance the interests of all stakeholders, we address the tactical problem of determining the optimal number, stop pattern, and schedule of freight train services needed for freight delivery, while maintaining high passenger service quality by minor timetable adjustments. A non-convex mixed-integer quadratic programming model is developed to minimize freight transportation, train operational costs, and deviations in passenger train schedules. A Frank-Wolfe-based heuristic is developed with a novel gradient approximation that accounts for the hierarchy between binary and continuous decisions. The step size is defined as a discrete gap between disjoint subspaces determined by train operations, reflecting that partially shifting flow does not effectively impact the objective due to the indivisibility of train activation. Experiments are conducted based on instances generated from the Beijing Metro network. The results show that under high freight demand, dedicated freight trains cause less passenger delay than utilizing existing passenger trains. Prioritizing passenger schedules shifts freight to lower-priority lines, while incorporating a quadratic consolidation cost helps reduce fragmentation and excessive transhipments.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103377"},"PeriodicalIF":6.3,"publicationDate":"2025-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145732490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-06DOI: 10.1016/j.trb.2025.103364
Chandra R. Bhat
This paper introduces a proper multivariate flexible continuous parametric distribution, a first to our knowledge, that allows for asymmetric bimodality in each univariate dimension. The distribution is developed through a combination of an approach to generate bimodality and a Yeo-Johnson (YJ)-based transformation. A number of properties of the proposed distribution are stated and proved, including a computationally easy way to generate random variates from the proposed multivariate density. An application of the proposed distribution is demonstrated to analyze injury severity using data drawn from the Texas Department of Transportation (TxDOT) crash database of two-vehicle crashes at intersections. The proposed distribution may be applied to a number of different econometric modeling contexts in both a univariate and multivariate context, and in a whole variety of fields to consider bimodal asymmetry in stochastic distributions.
{"title":"A new flexible skewed bimodal distribution with multivariate extensions: Theory and application to traffic crash injury severity analysis","authors":"Chandra R. Bhat","doi":"10.1016/j.trb.2025.103364","DOIUrl":"10.1016/j.trb.2025.103364","url":null,"abstract":"<div><div>This paper introduces a proper multivariate flexible continuous parametric distribution, a first to our knowledge, that allows for asymmetric bimodality in each univariate dimension. The distribution is developed through a combination of an approach to generate bimodality and a Yeo-Johnson (YJ)-based transformation. A number of properties of the proposed distribution are stated and proved, including a computationally easy way to generate random variates from the proposed multivariate density. An application of the proposed distribution is demonstrated to analyze injury severity using data drawn from the Texas Department of Transportation (TxDOT) crash database of two-vehicle crashes at intersections. The proposed distribution may be applied to a number of different econometric modeling contexts in both a univariate and multivariate context, and in a whole variety of fields to consider bimodal asymmetry in stochastic distributions.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103364"},"PeriodicalIF":6.3,"publicationDate":"2025-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145689758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-03DOI: 10.1016/j.trb.2025.103375
Jie Lin , Fangni Zhang , Yafeng Yin
With a substantial increase in public charging facilities globally, the world has witnessed a significant surge in support for electric vehicles (EVs), making them more accessible and sustainable. However, EV drivers still struggle to find available charging spaces, which are often occupied by non-charging vehicles. While prohibiting parking in charging spaces can mitigate this issue, it can lead to underutilization of charging spaces when charging demand is low but parking demand is high. Existing studies often treat parking and charging management as separate issues, overlooking the fact that most charging spaces are located in parking facilities and jointly operated with parking spaces to serve both parking and charging needs. In this context, coordinated management of parking and charging spaces is essential for improving operational efficiency. This paper proposes an integrated Parking-and-Charging-as-a-Service (PCaaS) reservation system that jointly manages parking and charging demand through admission and allocation controls. Specifically, users submit parking and charging requests in advance, and the system dynamically determines whether to accept each request and, if accepted, allocates a parking or charging space accordingly. We model this sequential decision-making problem as a Markov decision process. Since deriving the optimal policy is computationally intractable, we introduce a bid price control policy to guide request admission and space allocation. Two decomposition methods are developed to compute bid prices efficiently. Using real-world parking facility data, we evaluate the performance of the proposed policies across varying problem scales, levels of dynamism, demand scenarios, and parking facility configurations. The results demonstrate that the proposed policies substantially enhance overall revenue and capacity utilization compared to current practices. The insights gained provide guidance for the planning and operation of public parking facilities.
{"title":"Parking-and-Charging-as-a-Service: Online admission and allocation policies for an integrated parking and charging reservation system","authors":"Jie Lin , Fangni Zhang , Yafeng Yin","doi":"10.1016/j.trb.2025.103375","DOIUrl":"10.1016/j.trb.2025.103375","url":null,"abstract":"<div><div>With a substantial increase in public charging facilities globally, the world has witnessed a significant surge in support for electric vehicles (EVs), making them more accessible and sustainable. However, EV drivers still struggle to find available charging spaces, which are often occupied by non-charging vehicles. While prohibiting parking in charging spaces can mitigate this issue, it can lead to underutilization of charging spaces when charging demand is low but parking demand is high. Existing studies often treat parking and charging management as separate issues, overlooking the fact that most charging spaces are located in parking facilities and jointly operated with parking spaces to serve both parking and charging needs. In this context, coordinated management of parking and charging spaces is essential for improving operational efficiency. This paper proposes an integrated Parking-and-Charging-as-a-Service (PCaaS) reservation system that jointly manages parking and charging demand through admission and allocation controls. Specifically, users submit parking and charging requests in advance, and the system dynamically determines whether to accept each request and, if accepted, allocates a parking or charging space accordingly. We model this sequential decision-making problem as a Markov decision process. Since deriving the optimal policy is computationally intractable, we introduce a bid price control policy to guide request admission and space allocation. Two decomposition methods are developed to compute bid prices efficiently. Using real-world parking facility data, we evaluate the performance of the proposed policies across varying problem scales, levels of dynamism, demand scenarios, and parking facility configurations. The results demonstrate that the proposed policies substantially enhance overall revenue and capacity utilization compared to current practices. The insights gained provide guidance for the planning and operation of public parking facilities.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103375"},"PeriodicalIF":6.3,"publicationDate":"2025-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145657760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-26DOI: 10.1016/j.trb.2025.103363
Andréas Guitart, Clara Buire
This paper addresses the air-rail schedule synchronisation problem by proposing a novel approach that designs integrated flight and train schedules from scratch. A passenger-centric approach is employed, considering a set of travel preference criteria: door-to-door travel time, price, and transportation mode. The problem is formulated as an adapted version of a Multi-Commodity Flow (MCF) problem on a time-expanded network, and solved through a branch-and-price procedure. To speed-up the solution process, we propose to couple the resolution of the column-generation sub-problem with a pattern search, performed in a preprocessing phase. The proposed methodology is tested on the French transportation network over a five-month period, considering 1500 commodities. The complete schedule is generated in twelve hours, including the preprocessing time. The final schedule satisfies over 95 % of passenger travel preferences, demonstrating the effectiveness of the approach in optimising multimodal connectivity.
{"title":"Integrated air-rail scheduling: A branch-and-price approach for adaptive passenger-centric planning","authors":"Andréas Guitart, Clara Buire","doi":"10.1016/j.trb.2025.103363","DOIUrl":"10.1016/j.trb.2025.103363","url":null,"abstract":"<div><div>This paper addresses the air-rail schedule synchronisation problem by proposing a novel approach that designs integrated flight and train schedules from scratch. A passenger-centric approach is employed, considering a set of travel preference criteria: door-to-door travel time, price, and transportation mode. The problem is formulated as an adapted version of a Multi-Commodity Flow (MCF) problem on a time-expanded network, and solved through a branch-and-price procedure. To speed-up the solution process, we propose to couple the resolution of the column-generation sub-problem with a pattern search, performed in a preprocessing phase. The proposed methodology is tested on the French transportation network over a five-month period, considering 1500 commodities. The complete schedule is generated in twelve hours, including the preprocessing time. The final schedule satisfies over 95 % of passenger travel preferences, demonstrating the effectiveness of the approach in optimising multimodal connectivity.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"204 ","pages":"Article 103363"},"PeriodicalIF":6.3,"publicationDate":"2025-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145598638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：