Transportation Research Part E-Logistics and Transportation Review最新文献

{"title":"Is fare-free public transport effective in improving air quality? Evidence from Fuzhou, China","authors":"Yuan Liang,&nbsp;Donggen Wang","doi":"10.1016/j.tre.2025.104040","DOIUrl":"10.1016/j.tre.2025.104040","url":null,"abstract":"<div><div>Fare-free public transport (FFPT) programs are gaining increasing popularity worldwide as a policy tool to mitigate the negative externalities associated with automobile usage. However, evidence regarding their effectiveness in reducing air pollution, a major automobile externality, remains limited. In this study, we empirically examine the effect of FFPT programs on air quality in Fuzhou, a provincial capital city in China, based on a quasi-experimental design. Using difference-in-differences models, we find that Fuzhou’s FFPT program reduces fine particulate (PM_2.5) concentrations by 0.332 µg/m³ (2.1 %) in the short run. Furthermore, the program leads to an increase of 129,486 rides (49.8%) in daily subway ridership. Back-of-the-envelope calculations indicate that the health benefits brought by the FFPT program through air quality improvements, including reduced mortality and healthcare expenditures, amount to about 3.09 billion Chinese yuan (or 478.92 million US dollars) annually, which is six times the loss of fare revenue. These findings highlight the potential of fare-free public transport as a sustainable urban transport policy in urban China and contribute to a better understanding of its cost-effectiveness.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104040"},"PeriodicalIF":8.3,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143512263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The hierarchical multimodal hub location problem for cross-border logistics networks considering multiple capacity levels, congestion and economies of scale","authors":"Zhenjie Wang ,&nbsp;Dezhi Zhang ,&nbsp;Lóránt Tavasszy ,&nbsp;Stefano Fazi","doi":"10.1016/j.tre.2025.103972","DOIUrl":"10.1016/j.tre.2025.103972","url":null,"abstract":"<div><div>The continuous growth of international container trade calls for logistics networks that seamlessly connect cross-border, domestic, and local transport services. In the design of these networks with various hubs and modes of transport, the consideration of both economies of scale for multimodal transport and congestion is essential since they can significantly impact the location of the hubs and their size. Thereby, in this paper, we study these features within a multimodal hub location problem for international trade that considers a hierarchy in the network structure. We develop a mixed-integer linear programming formulation, minimizing infrastructural, operational, and congestion costs. A hybrid adaptive variable neighborhood search algorithm with tailored operators and speed-up strategies is proposed to solve large-scale instances. Numerical experiments are conducted for China’s New Western Land-Sea Corridor case and provide new managerial insights for designing hierarchical, multi-modal, cross-border logistics networks.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 103972"},"PeriodicalIF":8.3,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143479190","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}

{"title":"Generic model for capacity allocation on transportation terminals","authors":"Nihal Berktas ,&nbsp;Konstantinos G. Zografos","doi":"10.1016/j.tre.2025.104017","DOIUrl":"10.1016/j.tre.2025.104017","url":null,"abstract":"<div><div>Transportation terminals play an important role in the functioning of the transportation system. Therefore, the efficient use of the capacity of transportation terminals is considered a major determinant of the performance of transportation networks. An important decision related to the efficient functioning of congested terminals relates to the optimum allocation of the available capacity to different operators (users). The capacity allocation problem in transportation terminals, such as airports, railroad stations, ports, involves the optimum apportion of the available capacity to different users, such as airlines, rail, and shipping companies, while satisfying operational, and regulatory constraints and requirements. Motivated by the similarities across capacity allocation problems in terminals of different transportation modes and the lack of a unifying framework, this study introduces a generic mixed integer linear programming (MILP) formulation and demonstrates its applicability through a detailed application of the proposed model for rail networks. The generic mathematical model is a generalization of models highly utilized in airport slot allocation. We explicitly present how the model applies to the train timetabling problem and conduct computational experiments using publicly available data. Our computational experiments show that the model consistently achieves optimal solutions across almost all tested cases, including instances where published solutions are suboptimal. The analysis of the results for a specific instance indicates that incorporating station capacity constraints yields the same set of scheduled requests but alters the deviations from the desired arrival and departure times. In contrast, increase in the flexibility of the requested times significantly affect the solution, leading to increase in the number of scheduled trains, deviations, and the overall length of the journey.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104017"},"PeriodicalIF":8.3,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143487183","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}

{"title":"Airport slot allocation with low-carbon consideration","authors":"Yiqun Wang,&nbsp;Yaodong Ni","doi":"10.1016/j.tre.2025.104009","DOIUrl":"10.1016/j.tre.2025.104009","url":null,"abstract":"<div><div>Continuously increasing carbon emissions pose new challenges to the civil aviation industry. Although new techniques to reduce emissions are being developed, the aviation industry still calls for research on advanced management practices. Airport slot allocation in air traffic flow management aims to reduce flight delays by rescheduling flights. This study extends previous research by proposing a <em>low-carbon air traffic management model</em> that considers flight carbon emissions during airport slot allocation. The model is formulated as a nonlinear integer programming. A <em>flight-based variable neighborhood search</em> algorithm is developed to solve the model. The algorithm is extended by operating flights in different slots within an airport network. Computational experiments on real-world data show that the algorithm can generate a near-optima solution within a short amount of time. A case study based on the solutions indicates that the model can effectively reduce carbon emissions by 26.3%, while simultaneously maintaining delays at a comparable level. These results provide insights into future practices for the civil aviation industry.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104009"},"PeriodicalIF":8.3,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143474520","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}

{"title":"Combinatorial Group-Buying double auction for recycled remanufacturing products of construction waste","authors":"Xiang T.R. Kong ,&nbsp;Rui Huang ,&nbsp;Kai Kang ,&nbsp;Suxiu Xu","doi":"10.1016/j.tre.2025.104030","DOIUrl":"10.1016/j.tre.2025.104030","url":null,"abstract":"<div><div>Digital trading plays a crucial role in construction waste resource utilization. However, supply–demand imbalance and inefficient pricing exist under a prevalent negotiation-based trading approach and a fixed price mechanism, resulting in high transaction costs and rigid clearing prices. Furthermore, high ask prices restrict the transaction scale of recycled remanufacturing products of construction waste (RRPCW). These deficiencies severely hinder development of RRPCW digital trading market. Motivated by the successful implementation of group-buying in various industries, this article aims to propose a combinatorial group-buying double auction mechanism to deal with the challenges in RRPCW transactions. A combinatorial double auction is firstly established where buyers are allowed to bid on bundles of RRPCW to satisfy their full set of procurement requirements. To further scale up transactions, group-buying is incorporated into the auction, where sellers provide corresponding discounts to their matched buyers when thresholds are reached. Such an approach can effectively leverage buyers’ collective purchasing power and scale effect to lower the purchasing costs. The winner determination problem is solved with a bid density-based scheme, while buyers’ payments and sellers’ revenues are calculated by a critical value-based scheme. Theoretical analysis manifests that the designed mechanism can realize individual rationality, strong budget balance and incentive-compatibility of buyers. Five sensitivity analyses including buyers’ bid prices, threshold levels, discount degrees, seller supply heterogeneity, and buyer demand distribution on the mechanism’s overall performance are examined. Additionally, the results of comparative analysis among the proposed mechanism, its counterparts and the fixed price mechanism under different market conditions demonstrate the superiority of our new designed mechanism. Finally, managerial implications are summarized based on the stakeholders’ multi-dimension perspectives. Especially, we emphasized that the regulatory role of the platform is vital for the sustainable and healthy development in the construction waste trading industry.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104030"},"PeriodicalIF":8.3,"publicationDate":"2025-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143471372","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}

{"title":"Optimizing the loading of double stack trains under uncertain container availability","authors":"ManWo Ng ,&nbsp;Yu-Chi Lee ,&nbsp;Dung-Ying Lin","doi":"10.1016/j.tre.2025.104016","DOIUrl":"10.1016/j.tre.2025.104016","url":null,"abstract":"<div><div>This paper contributes to the literature on the operations management of double stack trains by introducing a new, real-world research problem that arises when loading trains at marine container terminals with on-dock rail service. Specifically, in this research we model the reality that containers that need to be loaded on railcars can be unavailable at the time of loading, while optimizing the assignment of railcars to hubs and trains, and containers to railcars. To this end, we propose a two stage stochastic program that aims to minimize the number of well cars used when container availability is uncertain (first stage) while also maximizing their space utilization when taking corrective actions (second stage). For its solution, a tailored integer L-shaped solution method is presented. Algorithmic performance and managerial insights are highlighted in a series of numerical experiments. Findings include: 1) The proposed L-shaped method is superior compared to a state-of-the-art commercial solver (up to 5 times faster in our experiments). 2) It is beneficial for the rail manager to prioritize making available 40-foot containers versus 20-foot containers. 3) The higher the probability of container availability in the second stage, the more well cars should be made available in the first stage.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104016"},"PeriodicalIF":8.3,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143471320","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}

{"title":"Optimal rebalancing and charging of shared electric scooters using charging hubs","authors":"Jesus Osorio,&nbsp;Yanfeng Ouyang","doi":"10.1016/j.tre.2025.104018","DOIUrl":"10.1016/j.tre.2025.104018","url":null,"abstract":"<div><div>This paper addresses the overnight e-scooter rebalancing and charging problem in which e-scooters can be charged at a set of capacitated charging hubs. Operators use capacitated vehicles to collect e-scooters that need charging, drop them off at the hubs for charging, and pick them up later for repositioning. First, a discrete mathematical formulation is presented to optimize the drop-offs and pickups of e-scooters, as well as the routing/scheduling of vehicles. E-scooters of different states of charge (SoC) are modeled as multiple commodities linked through an SoC transition function. To reduce computational burdens, a discrete–continuous hybrid model is developed such that asymptotic vehicle routing formulas can be used to approximate local tour lengths and operational costs, and at the same time provide guidelines for building near-optimum feasible solutions. The hybrid model produces close approximations to the feasible solution in short times and shows to be a potential tool for strategic decision-making. Numerical tests showed interesting interdependencies and trade-offs among the numbers and capacities of both hubs and vehicles. Running dispersed charging hubs, even smaller ones, could result in a superior system service than running a few centralized hubs.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104018"},"PeriodicalIF":8.3,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143464660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Collaborative multidepot split delivery network design with three-dimensional loading constraints","authors":"Yong Wang ,&nbsp;Yuanfan Wei ,&nbsp;Yuanhan Wei ,&nbsp;Lu Zhen ,&nbsp;Shejun Deng","doi":"10.1016/j.tre.2025.104032","DOIUrl":"10.1016/j.tre.2025.104032","url":null,"abstract":"<div><div>The growing demand for bulky goods has spurred logistics firms to explore how to effectively manage and optimize multidepot delivery networks that consider three-dimensional loading constraints. The ability to divide customer demands and adaptively adjust vehicle compartments has significantly enhanced delivery efficiency and vehicle resource utilization. This study develops a collaborative multidepot vehicle routing problem that accommodates split deliveries and three-dimensional loading constraints. It begins by formulating a multi-objective mathematical model that aims to minimize total operating costs (TOC) and the number of vehicles used (NV) while maximizing the average loading rate (ALR). A novel hybrid algorithm combining an improved <em>k</em>-nearest neighbor clustering algorithm with an adaptive non-dominated sorting genetic algorithm-III (ANSGA-III) is developed to find Pareto optimal solutions. The improved <em>k</em>-nearest neighbor clustering algorithm is applied for the reallocation of customers. The ANSGA-III incorporates elite alteration and adaptive information feedback mechanisms to enhance the solution quality and algorithm convergence. Strategies for split loads and vehicle compartment partition are integrated into the ANSGA-III, facilitating the improvement of vehicle resource configuration efficiency. The superiority of the proposed algorithm is verified by comparison with those of the CPLEX solver for small-scale problems and against multi-objective particle swarm optimization, multi-objective evolutionary algorithms, and multi-objective ant colony optimization for medium-to-large problems. Additionally, the proposed model and algorithm are applied to a real-world case study in Chongqing city, China, and the result comparison from the initial network to optimized network shows that the TOC and NV reduced by 43.57% and 32.14%, respectively, while the ALR is improved by 33.51%. Furthermore, this study discusses the optimized results under varying the vehicle compartment partition strategies, contributing to the superiority of proposed approach in improving vehicle resource utilization efficiency. This represents significant cost savings of $2,934 and a reduction of six vehicles, along with a notable 23.35%% improvement in ALR compared to the scenario without compartment division. We also discuss various scenarios involving the split load strategies and different loading capacity schemes, and the computational results demonstrate that the proposed approach improves vehicle loading rates and reduces logistics operating costs. Specifically, the result comparison between the network with and without split load strategies shows that the TOC and ALR in each depot are improved by $2,128, $905, $1,265, $796, and 40.47%, 34.67%, 21.98%, 36.91%, respectively. The findings offer essential insights for promoting a digitally-intelligent and resource-efficient urban logistics system.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104032"},"PeriodicalIF":8.3,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143463859","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}

{"title":"Enhancing feeder bus service coverage with Multi-Agent Reinforcement Learning: A case study in Hong Kong","authors":"Yang Su,&nbsp;Hai Yang","doi":"10.1016/j.tre.2025.103997","DOIUrl":"10.1016/j.tre.2025.103997","url":null,"abstract":"<div><div>Public transport is a vital component of modern urban mobility, playing a significant role in reducing congestion and promoting environmental sustainability. Feeder bus services are essential for connecting residents to major public transport hubs, such as metro or rail stations. In this paper, a novel framework that enhances service coverage of the feeder bus while maintaining network efficiency is proposed. The framework integrates Multi-Agent Reinforcement Learning (MARL) to simulate and optimize route designs and frequency settings. Additionally, we introduce a Cost-based Competitive Coverage (CCC) Model to evaluate the performance of the feeder bus services by considering competition with other public transport modes. A case study conducted in two new towns in Hong Kong demonstrates the effectiveness and robustness of the proposed framework, highlighting its adaptability and potential to improve public transport accessibility.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 103997"},"PeriodicalIF":8.3,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143453139","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}

{"title":"A comprehensive assessment of connected and automated vehicle analytical, modeling, and simulation tools","authors":"Keke Long ,&nbsp;Ke Ma ,&nbsp;Qianwen Li ,&nbsp;Xiaopeng Li ,&nbsp;Zhitong Huang ,&nbsp;Rachel James ,&nbsp;Amir Ghiasi","doi":"10.1016/j.tre.2025.104007","DOIUrl":"10.1016/j.tre.2025.104007","url":null,"abstract":"<div><div>Connected and Automated Vehicles (CAVs) promise to redefine the future of transportation. Infrastructure Owners and Operators (IOOs require advanced analytical, modeling, and simulation (AMS) tools) to grasp the impact of CAVs on their strategic goals, such as improving safety, enhancing mobility, and advancing equity, and assess policy modifications to steer the deployment of this technology effectively. Although recent research has made strides in developing models that characterize CAV behavior in mixed-traffic scenarios, significant modeling gaps persist. These gaps hinder decision-makers and policymakers from fully understanding how CAVs can serve as an instrumental force in driving desired improvements in transportation system performance. This study aims to identify these gaps by organizing two stakeholder webinars that focus on CAV AMS tools. The discussions from these webinars are categorized into three primary areas: CAV technologies, road user behaviors, and system-level modeling. This categorization helps structure an in-depth literature review designed to pinpoint existing shortcomings in CAV research. The study also provides an overview of current datasets that are both representative and capable of addressing some of these research gaps. Ultimately, this study seeks to act as a valuable reference for directing future research efforts in CAVs.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104007"},"PeriodicalIF":8.3,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143463858","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}