Pub Date : 2025-09-02DOI: 10.1080/23249935.2024.2304033
Shuhan Cao , William H. K. Lam , Keqin Liu , Hu Shao , Mei Lam Tam , Ting Wu
This paper presents a series of optimisation models to estimate network-wide travel times under equilibrium conditions. The proposed models estimate the upper and lower bounds (ULB) of the maximum total travel time (MTTT), path travel time (PTT), and link travel time (LTT). The uncertainty range of travel time is obtained by subtracting the upper bound of travel time from the corresponding lower bound. To minimise the uncertainty ranges of the estimated travel times, the relationship of PTTs is introduced as a generalised equilibrium condition. Numerical experiments show that adopting the equilibrium condition can minimise the uncertainty ranges of the travel time estimation. The proposed method can also more accurately estimate the travel times even when the observed data are limited in the entire network. These findings provide a basis for further research on the travel time observability problem of travel time estimation for the whole territory of the network.
{"title":"Equilibrium condition-based optimization models for network-wide travel time estimation using limited observed data","authors":"Shuhan Cao , William H. K. Lam , Keqin Liu , Hu Shao , Mei Lam Tam , Ting Wu","doi":"10.1080/23249935.2024.2304033","DOIUrl":"10.1080/23249935.2024.2304033","url":null,"abstract":"<div><div>This paper presents a series of optimisation models to estimate network-wide travel times under equilibrium conditions. The proposed models estimate the upper and lower bounds (ULB) of the maximum total travel time (MTTT), path travel time (PTT), and link travel time (LTT). The uncertainty range of travel time is obtained by subtracting the upper bound of travel time from the corresponding lower bound. To minimise the uncertainty ranges of the estimated travel times, the relationship of PTTs is introduced as a generalised equilibrium condition. Numerical experiments show that adopting the equilibrium condition can minimise the uncertainty ranges of the travel time estimation. The proposed method can also more accurately estimate the travel times even when the observed data are limited in the entire network. These findings provide a basis for further research on the travel time observability problem of travel time estimation for the whole territory of the network.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139648066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a novel framework for customised modular bus systems that leverages travel demand prediction and modular autonomous vehicles to optimise services proactively. The proposed framework addresses two prediction scenarios with different forward-looking operations: optimistic operation and pessimistic operation. A mixed integer programming model in a space-time-state network is developed for the optimistic operation to determine module routes, schedules, formations and passenger-to-module assignments. For the pessimistic case, a two-stage optimisation procedure is introduced. The first stage involves two formulations (i.e., deterministic and robust) to generate cost-saving plans, and the second stage adapts plans with control strategies periodically. A Lagrangian heuristic approach is proposed to solve formulations efficiently. The performance of the proposed framework is evaluated using smartcard data from Beijing and two state-of-the-art machine learning algorithms. Results indicate that the proposed framework outperforms the real-time approach in operating costs and highlights the role of module capacity and time dependency.
{"title":"Operationalizing modular autonomous customised buses based on different demand prediction scenarios","authors":"Rongge Guo , Saumya Bhatnagar , Wei Guan , Mauro Vallati , Shadi Sharif Azadeh","doi":"10.1080/23249935.2023.2296498","DOIUrl":"10.1080/23249935.2023.2296498","url":null,"abstract":"<div><div>This paper presents a novel framework for customised modular bus systems that leverages travel demand prediction and modular autonomous vehicles to optimise services proactively. The proposed framework addresses two prediction scenarios with different forward-looking operations: optimistic operation and pessimistic operation. A mixed integer programming model in a space-time-state network is developed for the optimistic operation to determine module routes, schedules, formations and passenger-to-module assignments. For the pessimistic case, a two-stage optimisation procedure is introduced. The first stage involves two formulations (i.e., deterministic and robust) to generate cost-saving plans, and the second stage adapts plans with control strategies periodically. A Lagrangian heuristic approach is proposed to solve formulations efficiently. The performance of the proposed framework is evaluated using smartcard data from Beijing and two state-of-the-art machine learning algorithms. Results indicate that the proposed framework outperforms the real-time approach in operating costs and highlights the role of module capacity and time dependency.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138824314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2023.2282963
Dongwook Kim , Chang Seong Ko , Ilkyeong Moon
Last-mile delivery, the final stage of the delivery process before a package arrives at a customer's address, has emerged as an important business opportunity for inland transportation. As people's perception of last-mile delivery has changed, more customers are using premium delivery services to get the delivery at a specific time rather than just pursuing free shipping. In order to satisfy the new trend of logistics, we propose a delivery system in which several drones and trucks work together to provide service to customers within given time windows. In addition, pair constraints, which considered a truck and a drone as a pair, are relaxed to determine more flexible delivery plans. A three-stage savings-based heuristic procedure was also developed based on the concept of savings to determine the operations of trucks and drones in real-world settings. We found that the drone efficiently responds to urgent delivery requests from customers and that a delivery system that utilises both trucks and drones provides substantial benefits.
{"title":"Coordinated logistics with trucks and drones for premium delivery","authors":"Dongwook Kim , Chang Seong Ko , Ilkyeong Moon","doi":"10.1080/23249935.2023.2282963","DOIUrl":"10.1080/23249935.2023.2282963","url":null,"abstract":"<div><div>Last-mile delivery, the final stage of the delivery process before a package arrives at a customer's address, has emerged as an important business opportunity for inland transportation. As people's perception of last-mile delivery has changed, more customers are using premium delivery services to get the delivery at a specific time rather than just pursuing free shipping. In order to satisfy the new trend of logistics, we propose a delivery system in which several drones and trucks work together to provide service to customers within given time windows. In addition, pair constraints, which considered a truck and a drone as a pair, are relaxed to determine more flexible delivery plans. A three-stage savings-based heuristic procedure was also developed based on the concept of savings to determine the operations of trucks and drones in real-world settings. We found that the drone efficiently responds to urgent delivery requests from customers and that a delivery system that utilises both trucks and drones provides substantial benefits.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138532530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2023.2298498
Tanmay Das , Ishtiak Ahmed , Billy M. Williams , Nagui M. Rouphail
This study investigates the response times of autonomous vehicles (AVs) equipped with adaptive cruise control (ACC) and traditional human-driven vehicles (TVs) in mixed traffic scenarios. The primary objective is to assess how these response times impact the stability and safety of mixed traffic flow, considering the growing prevalence of ACC technology in vehicles worldwide. Utilising a trajectory dataset from OpenACC totalling 3389.70 s, this research introduces a response time estimation framework that combines cross-correlation and partial autocorrelation techniques. The study calibrates Gazis, Herman, and Rothery's (GHR) car-following model to evaluate mixed traffic flow stability and employs a modified time-to-collision (MTTC) surrogate for safety analysis. The study also delves into the influence of vehicle manufacturer diversity on study outcomes. Key findings reveal that the AVs exhibit significantly longer response times, ranging from 1.10–3.20 s, compared to the 0.30–1.90-second range of traditional vehicles (p value < 0.005). These extended response times in AVs contribute to prolonged traffic flow instability and increased traffic conflicts. Moreover, the type of lead vehicle does not significantly affect the response times of either AVs or TVs (p value > 0.005). The study also highlights that vehicle manufacturer diversity does not substantially affect these response times. Additionally, the examination of fitted GHR parameters underscores AVs’ heightened sensitivity to spacing and relative speed, providing insights into AV dynamics in the presence of mixed traffic.
{"title":"Response time of mixed platoons with traditional and autonomous vehicles in field trials: impact assessment on flow stability and safety","authors":"Tanmay Das , Ishtiak Ahmed , Billy M. Williams , Nagui M. Rouphail","doi":"10.1080/23249935.2023.2298498","DOIUrl":"10.1080/23249935.2023.2298498","url":null,"abstract":"<div><div>This study investigates the response times of autonomous vehicles (AVs) equipped with adaptive cruise control (ACC) and traditional human-driven vehicles (TVs) in mixed traffic scenarios. The primary objective is to assess how these response times impact the stability and safety of mixed traffic flow, considering the growing prevalence of ACC technology in vehicles worldwide. Utilising a trajectory dataset from OpenACC totalling 3389.70 s, this research introduces a response time estimation framework that combines cross-correlation and partial autocorrelation techniques. The study calibrates Gazis, Herman, and Rothery's (GHR) car-following model to evaluate mixed traffic flow stability and employs a modified time-to-collision (MTTC) surrogate for safety analysis. The study also delves into the influence of vehicle manufacturer diversity on study outcomes. Key findings reveal that the AVs exhibit significantly longer response times, ranging from 1.10–3.20 s, compared to the 0.30–1.90-second range of traditional vehicles (<em>p</em> value < 0.005). These extended response times in AVs contribute to prolonged traffic flow instability and increased traffic conflicts. Moreover, the type of lead vehicle does not significantly affect the response times of either AVs or TVs (<em>p</em> value > 0.005). The study also highlights that vehicle manufacturer diversity does not substantially affect these response times. Additionally, the examination of fitted GHR parameters underscores AVs’ heightened sensitivity to spacing and relative speed, providing insights into AV dynamics in the presence of mixed traffic.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139083699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2023.2299684
Qi Wang , Yankui Liu , Hongliang Li
This article studies the response problem of an emergency logistics network with a decision hierarchy relationship under uncertainty. To account for the partial distribution information about uncertain demand and transportation costs, we construct a moment-based ambiguity set based on limited historical data, where the pivot variable method is employed to determine the confidence interval of the mean value. Based on the constructed ambiguity set, we develop a novel distributionally robust bi-level post-disaster emergency logistics location-routeing model. By exploiting the structural characteristic, chance-constrained models under box-ellipsoid and budget perturbation sets are reformulated as bi-level mixed-integer conic programming models. To accelerate the solution procedure, the bi-level models are further converted into single-level ones via Karush-Kuhn-Tucker condition, which can be directly solved to optimality using CPLEX software. Supply risk value for each supplier is obtained by applying analytic hierarchy process. We conduct extensive experiments using the Iranian flood as the case study to address the computational performance of our proposed optimisation method.
{"title":"Optimising hierarchical emergency logistics network under ambiguous demand and transportation cost","authors":"Qi Wang , Yankui Liu , Hongliang Li","doi":"10.1080/23249935.2023.2299684","DOIUrl":"10.1080/23249935.2023.2299684","url":null,"abstract":"<div><div>This article studies the response problem of an emergency logistics network with a decision hierarchy relationship under uncertainty. To account for the partial distribution information about uncertain demand and transportation costs, we construct a moment-based ambiguity set based on limited historical data, where the pivot variable method is employed to determine the confidence interval of the mean value. Based on the constructed ambiguity set, we develop a novel distributionally robust bi-level post-disaster emergency logistics location-routeing model. By exploiting the structural characteristic, chance-constrained models under box-ellipsoid and budget perturbation sets are reformulated as bi-level mixed-integer conic programming models. To accelerate the solution procedure, the bi-level models are further converted into single-level ones via Karush-Kuhn-Tucker condition, which can be directly solved to optimality using CPLEX software. Supply risk value for each supplier is obtained by applying analytic hierarchy process. We conduct extensive experiments using the Iranian flood as the case study to address the computational performance of our proposed optimisation method.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139083375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2023.2287502
Manuel Waltert , Edgar Jimenez Perez , Romano Pagliari
Facility requirements determine how and when the capacity of airport passenger terminal facilities is adjusted over time to meet expected demand. Given high levels of uncertainty inherent in long-term airport planning, under and over provision of capacity is a recurrent risk, as conventional strategic planning methods fail to adapt dynamically to changing circumstances. This paper introduces a novel flexible capacity expansion model for airport terminals that considers simultaneously real options ‘on’ and ‘in’ systems. The model is validated for the provision of check-in facilities at Zurich Airport. Results confirm suggestions in the literature that incorporating flexibility creates planning and financial advantages over conventional alternatives. Indeed, for the case of Zurich, the financial value of the flexible alternative is approximately 5% higher than the best conventional phased plan. This also suggests that phasing developments can be carefully devised to produce satisfactory outcomes that enable ex-post application of flexibility ‘on’ systems.
设施需求决定如何及何时调整机场客运大楼设施的容量以满足预期需求。考虑到长期…
{"title":"Flexible facility requirements for strategic planning of airport passenger terminal infrastructure","authors":"Manuel Waltert , Edgar Jimenez Perez , Romano Pagliari","doi":"10.1080/23249935.2023.2287502","DOIUrl":"10.1080/23249935.2023.2287502","url":null,"abstract":"<div><div>Facility requirements determine how and when the capacity of airport passenger terminal facilities is adjusted over time to meet expected demand. Given high levels of uncertainty inherent in long-term airport planning, under and over provision of capacity is a recurrent risk, as conventional strategic planning methods fail to adapt dynamically to changing circumstances. This paper introduces a novel flexible capacity expansion model for airport terminals that considers simultaneously real options ‘on’ and ‘in’ systems. The model is validated for the provision of check-in facilities at Zurich Airport. Results confirm suggestions in the literature that incorporating flexibility creates planning and financial advantages over conventional alternatives. Indeed, for the case of Zurich, the financial value of the flexible alternative is approximately 5% higher than the best conventional phased plan. This also suggests that phasing developments can be carefully devised to produce satisfactory outcomes that enable ex-post application of flexibility ‘on’ systems.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138532520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2024.2317783
Jin-Yang Li , Jing Teng , Hui Wang
Ensuring the robustness of bus networks is essential for delivering reliable and efficient mobility services to passengers. This paper addresses the challenge of assessing the robustness of on-demand bus networks, which are characterised by uncertain topology. We propose a framework based on a random multilayer bus network, from which we develop four topological metrics to quantify network robustness. Additionally, we conduct network attack simulations to derive simulation-based robustness indicators, which are acknowledged as golden rules in robustness measurements. Correlation analysis between the proposed metrics reveals a positive relationship between the topological properties and network robustness, validating the effectiveness of the topological metrics in assessing the robustness of networks with uncertain topology. This study fills a gap in the existing literature by providing a robustness analysis framework specifically tailored to on-demand bus networks, contributing to the design of more resilient on-demand bus systems.
{"title":"Measuring robustness in uncertain topologies: a study of on-demand bus networks","authors":"Jin-Yang Li , Jing Teng , Hui Wang","doi":"10.1080/23249935.2024.2317783","DOIUrl":"10.1080/23249935.2024.2317783","url":null,"abstract":"<div><div>Ensuring the robustness of bus networks is essential for delivering reliable and efficient mobility services to passengers. This paper addresses the challenge of assessing the robustness of on-demand bus networks, which are characterised by uncertain topology. We propose a framework based on a random multilayer bus network, from which we develop four topological metrics to quantify network robustness. Additionally, we conduct network attack simulations to derive simulation-based robustness indicators, which are acknowledged as golden rules in robustness measurements. Correlation analysis between the proposed metrics reveals a positive relationship between the topological properties and network robustness, validating the effectiveness of the topological metrics in assessing the robustness of networks with uncertain topology. This study fills a gap in the existing literature by providing a robustness analysis framework specifically tailored to on-demand bus networks, contributing to the design of more resilient on-demand bus systems.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139772343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2023.2294492
Yuan Zheng , Min Xu , Shining Wu , Shuaian Wang
To manage the bidirectional asymmetric mixed traffic flow with connected and automated vehicles (CAVs) and human-driven vehicles, the study proposes a lane management (LM) model based on the joint policy of CAV dedicated lanes (CDLs), CAV reversible lanes (CRLs), and CAV access strategies (CASs) for non-managed lanes. An analytical model is developed to determine the optimal numbers of CDLs and CRLs and the optimal CASs that maximize overall mixed traffic throughputs, considering four parameters under aggressive, moderate, and conservative CAV technology scenarios. The results show that the LM policy can significantly improve overall throughputs compared with the benchmark policy by deploying optimal CDLs, CRLs, and/or CASs under the three scenarios. Moreover, for the LM policy, the overall throughput gradually rises, except for the asymptotical increments with the CAV penetration rate under the conservative scenario and the asymptotical reductions with the directional imbalance percent of traffic demand under the three scenarios.
{"title":"Lane management for asymmetric mixed traffic flow on bidirectional multi-lane roadways","authors":"Yuan Zheng , Min Xu , Shining Wu , Shuaian Wang","doi":"10.1080/23249935.2023.2294492","DOIUrl":"10.1080/23249935.2023.2294492","url":null,"abstract":"<div><div>To manage the bidirectional asymmetric mixed traffic flow with connected and automated vehicles (CAVs) and human-driven vehicles, the study proposes a lane management (LM) model based on the joint policy of CAV dedicated lanes (CDLs), CAV reversible lanes (CRLs), and CAV access strategies (CASs) for non-managed lanes. An analytical model is developed to determine the optimal numbers of CDLs and CRLs and the optimal CASs that maximize overall mixed traffic throughputs, considering four parameters under aggressive, moderate, and conservative CAV technology scenarios. The results show that the LM policy can significantly improve overall throughputs compared with the benchmark policy by deploying optimal CDLs, CRLs, and/or CASs under the three scenarios. Moreover, for the LM policy, the overall throughput gradually rises, except for the asymptotical increments with the CAV penetration rate under the conservative scenario and the asymptotical reductions with the directional imbalance percent of traffic demand under the three scenarios.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138820909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2023.2270330
Yu Rao , Xiaoyun Feng , Qingyuan Wang , Pengfei Sun
When a train travels in a multi-trains system, the power flow of other trains and the track grades make up the spatial–temporal area (STA) for the train. Finding the optimal solution for the energy-efficient train control (EETC) problem in STA can help reduce the net energy consumption. This paper studies the analytic method to obtain the optimal solution. In Part 1, the algorithm for the problem was designed. The underlying structure of the algorithm is the connection between three optimal states through optimal feasible strategy. In Part 2, the optimality of the optimal feasible strategy is verified through a generalised local energy functional, and its uniqueness is proved based on the variational method. Additionally, we discuss the influence of external power on the optimal solution of the classical EETC problem. Case studies using data for a real freight railway line are given to illustrate our results.
{"title":"The optimal solution to the energy-efficient train control in a multi-trains system–Part 2: the optimality and the uniqueness","authors":"Yu Rao , Xiaoyun Feng , Qingyuan Wang , Pengfei Sun","doi":"10.1080/23249935.2023.2270330","DOIUrl":"10.1080/23249935.2023.2270330","url":null,"abstract":"<div><div>When a train travels in a multi-trains system, the power flow of other trains and the track grades make up the spatial–temporal area (STA) for the train. Finding the optimal solution for the energy-efficient train control (EETC) problem in STA can help reduce the net energy consumption. This paper studies the analytic method to obtain the optimal solution. In Part 1, the algorithm for the problem was designed. The underlying structure of the algorithm is the connection between three optimal <strong>states</strong> through optimal feasible strategy. In Part 2, the optimality of the optimal feasible strategy is verified through a generalised local energy functional, and its uniqueness is proved based on the variational method. Additionally, we discuss the influence of external power on the optimal solution of the classical EETC problem. Case studies using data for a real freight railway line are given to illustrate our results.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135885205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-02DOI: 10.1080/23249935.2023.2284353
Lucas Javaudin , Andrea Araldo , André de Palma
We consider a regulator driving individual choices towards increasing social welfare by providing personal incentives. We formalise and solve this problem by maximising social welfare under a budget constraint. The personalised incentives depend on the alternatives available to each individual and on her preferences. A polynomial time approximation algorithm computes a policy within few seconds. We analytically prove that it is boundedly close to the optimum. We efficiently calculate the curve of social welfare achievable for each value of budget within a given range. This curve can be useful for the regulator to decide the appropriate amount of budget to invest. We extend our formulation to enforcement, taxation and non-personalised-incentive policies. We analytically show that our personalised-incentive policy is also optimal within this class of policies and construct close-to-optimal enforcement and proportional tax-subsidy policies. We then compare analytically and numerically our policy with other state-of-the-art policies. Finally, we simulate a large-scale application to mode choice to reduce CO2 emissions.
{"title":"Personalised incentives with constrained regulator's budget","authors":"Lucas Javaudin , Andrea Araldo , André de Palma","doi":"10.1080/23249935.2023.2284353","DOIUrl":"10.1080/23249935.2023.2284353","url":null,"abstract":"<div><div>We consider a regulator driving individual choices towards increasing social welfare by providing personal incentives. We formalise and solve this problem by maximising social welfare under a budget constraint. The personalised incentives depend on the alternatives available to each individual and on her preferences. A polynomial time approximation algorithm computes a policy within few seconds. We analytically prove that it is boundedly close to the optimum. We efficiently calculate the curve of social welfare achievable for each value of budget within a given range. This curve can be useful for the regulator to decide the appropriate amount of budget to invest. We extend our formulation to enforcement, taxation and non-personalised-incentive policies. We analytically show that our personalised-incentive policy is also optimal within this class of policies and construct close-to-optimal enforcement and proportional tax-subsidy policies. We then compare analytically and numerically our policy with other state-of-the-art policies. Finally, we simulate a large-scale application to mode choice to reduce CO<sub>2</sub> emissions.</div></div>","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"21 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138532529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}