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

{"title":"A comprehensive framework for estimating aircraft fuel consumption based on flight trajectories","authors":"Linfeng Zhang ,&nbsp;Lei Bian ,&nbsp;Changmin Jiang ,&nbsp;Lingxiao Wu","doi":"10.1016/j.tre.2025.104339","DOIUrl":"10.1016/j.tre.2025.104339","url":null,"abstract":"<div><div>The calculation of aircraft fuel consumption is crucial for airline operations management, environmental protection, and other aspects. The use of Automatic Dependent Surveillance-Broadcast (ADS-B) data can significantly enhance the accuracy and resolution of fuel consumption calculations over flight routes. However, ADS-B data exhibits several issues, including inconsistent data point distribution, uneven interval widths, and variability in flight durations, making it difficult to align with fuel consumption data. This study developed a comprehensive mathematical framework and established a connection between flight dynamics in ADS-B data and fuel consumption, providing a set of high-precision, high-resolution fuel calculation methods. It also allows other practitioners to select data sources according to specific needs through this framework. The framework includes three main steps: (1) Using ADS-B data to determine the flight profile, which involves identifying aircraft behaviors such as acceleration, deceleration, climb, and descent, and establishing their theoretical relationships and parameters with fuel consumption. (2) Fitting the coefficients of the relationship between flight profiles and fuel consumption using available interval fuel consumption data. (3) Calculating instantaneous fuel consumption through monotonic and smooth interpolation. Our comprehensive analysis of ADS-B and Aircraft Communications Addressing and Reporting System (ACARS) datasets from April 2022 to December 2023, focusing on interval and instantaneous fuel consumption patterns among China’s 11 most prevalent aircraft types. The interval fuel consumption error demonstrates a reduction to 0.1% at the 10th percentile of the error distribution, while maintaining a mean error of 3.31%. Even at the 90th percentile, the error remains below 10%, demonstrating the model’s robustness across most scenarios. Regarding instantaneous fuel consumption model performance, the Boeing 737 MAX 800 demonstrates a cumulative instantaneous fuel consumption error of just 6.6% during cruise phase, while the Airbus A321-200 shows errors of 7.1% during climb and 8.4% during descent phases.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104339"},"PeriodicalIF":8.8,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144781303","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":"Risk disclosure in reward-based crowdfunding: Voluntary or mandatory?","authors":"Yanhong Sun ,&nbsp;Bingqing Ouyang ,&nbsp;Qiuyan Chen ,&nbsp;Shuai Yan","doi":"10.1016/j.tre.2025.104358","DOIUrl":"10.1016/j.tre.2025.104358","url":null,"abstract":"<div><div>Reward-based crowdfunding is characterized by high uncertainty in product delivery. This intrinsic risk feature elevates risk disclosure to a strategic concern, especially in a competitive crowdfunding market: (1) when will a creator voluntarily disclose his delivery risk information? and (2) what is the impact of a platform’s mandatory risk disclosure policy (MDP)? Our analysis yields some interesting findings. In particular, the information spillover effect may promote a high-risk creator to voluntarily disclose his risk information rather than free-riding on the disclosed information of a low-risk creator, in order to mitigate market competition. However, the interplay between the spillover effect and disclosure costs may lead two creators into the trap of the prisoners’ dilemma by withholding their risk information. Our analysis also suggests that MDP does not always harm the high-risk creator due to the mitigation of the spillover effect, and it can also help resolve the prisoners’ dilemma, thereby increasing both creators’ crowdfunding performance if disclosure costs are not excessively high. Nevertheless, contrary to the intuitive expectation that MDP will protect consumers’ interests by enabling them to make informed decisions, our results indicate that MDP may actually reduce consumer surplus by increasing crowdfunding prices.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104358"},"PeriodicalIF":8.8,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144781301","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":"The traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup","authors":"Lingrui Hong ,&nbsp;Lin Zhou ,&nbsp;Roberto Baldacci","doi":"10.1016/j.tre.2025.104347","DOIUrl":"10.1016/j.tre.2025.104347","url":null,"abstract":"<div><div>This paper introduces the traveling salesman problem with drone based on vehicle mobile parking for customer self-pickup (TSPD-VMPCP) in last-mile delivery. A set of vertices is considered, including a depot, parking spots, home delivery (HD) customers that must be visited directly within predefined time windows by truck or drone, and customers with self-pickup (CP) preference that must be served by designated parking spots. Specifically, we allow the drone to perform multi-loop, in which the drone launches and lands at the same location. CP customers are covered using a probability function based on their self-pickup behavior and the truck’s stoppage duration. The TSPD-VMPCP aims to minimize the total operating cost. We model the TSPD-VMPCP as a mixed-integer linear program and develop an adaptive large neighborhood search (ALNS) metaheuristic, in addition to a two-phase local search (2P-LS) based on variable neighborhood descent (VND) and matheuristic. We assess the performance of ALNS by comparing it with the Gurobi solver on small instances. The numerical results for medium and large instances highlight the effectiveness of the various components of the ALNS. Furthermore, we provide some managerial insights.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104347"},"PeriodicalIF":8.8,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144781304","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":"Safety-oriented multi-depot integrated vehicle and crew scheduling problem","authors":"Weitiao Wu,&nbsp;Yangyi Zhu","doi":"10.1016/j.tre.2025.104348","DOIUrl":"10.1016/j.tre.2025.104348","url":null,"abstract":"<div><div>Safety in public transportation operations remains a critical concern. The state-of-the-practice countermeasures primarily focus on real-time warning strategies, but there is still room for improving bus operation safety through reallocating fleet resources. This study introduces the Safety-oriented Multi-depot Integrated Vehicle and Crew Scheduling Problem (S-MD-IVCSP), a new generalization to the IVCSP where the safety risks of trip tasks are explicitly considered. To this end, we use the survival analysis model to assess safety risks during drivers’ work processes using warning data. Particularly, a safety risk transition model is developed based on the changing patterns of safety risk in single-line bus operations, which can be applied to driver crossline scenarios under regional scheduling. A time-space network model is devised to represent the S-MD-IVCSP. The drivers’ risk probability is incorporated into the objective. An enhanced adaptive large neighborhood search algorithm, featuring multiple operators, is developed to reduce the fleet size, optimize crew working hours, and mitigate drivers’ duty risks. The model is applied to 3 real-world bus lines in Guangzhou, China. Results show that our approach can reduce safety risks by at least 30% compared to the traditional cost-oriented approach, without significantly increasing operational costs. There is strong compatibility between regional scheduling strategies and proactive safety measures. By leveraging the warning data, regional scheduling can reduce the crew’s safety risks effectively, improving safety performance by over 19% compared to single-line scheduling mode. We also investigate the impact of crew compositions and limited driver resources on overall safety performance.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104348"},"PeriodicalIF":8.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772320","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":"Integrating crowd-shipping into last-mile delivery: A two-stage stochastic optimization approach","authors":"Shixuan Tang ,&nbsp;Wentao Huang ,&nbsp;Sisi Jian","doi":"10.1016/j.tre.2025.104342","DOIUrl":"10.1016/j.tre.2025.104342","url":null,"abstract":"<div><div>Crowd-shipping has emerged as a cost-effective solution to meet the growing demand for urban last-mile delivery. This paper examines the integration of partial crowd-shipping into traditional parcel delivery from the perspective of a delivery company. We explicitly consider both crowd-shipping supply and parcel demand uncertainties, and formulate a parcel delivery problem with crowd-shipping in stochastic programming (PDPCS-SP) that aims to minimize the expected total operational costs. Given the computational complexity of the problem, we develop a heuristic algorithm based on an adaptive large neighborhood search (ALNS) to efficiently solve large-scale instances. Extensive numerical experiments demonstrate the effectiveness and efficiency of the proposed PDPCS-SP model and solution approach, highlighting the potential to enhance the sustainability and economic viability of last-mile delivery operations.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104342"},"PeriodicalIF":8.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772316","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":"Cooperative strategy selection for livestreaming commerce supply chain with network externality","authors":"Benyong Hu ,&nbsp;Fuxia Ren ,&nbsp;Jiaxin Yi ,&nbsp;Chao Meng ,&nbsp;Xu Chen","doi":"10.1016/j.tre.2025.104352","DOIUrl":"10.1016/j.tre.2025.104352","url":null,"abstract":"<div><div>In the ever-evolving landscape of livestreaming commerce, brands (proposing service requirements) and platforms (providing technical and operational support) serve as core collaborative entities facing two-way challenges: brands are constrained by high service costs and operational inexperience, while platforms encounter flow bottlenecks due to insufficient brand service capabilities. This dual challenge requires both parties to collaboratively design cooperation strategies to achieve value co-creation. We apply the Stackelberg Model and Nash Bargaining Model to characterize three cooperation strategies between brands and platforms, namely Simple Cooperation (SPC), Operational Support (OS), and Strategic Cooperation (STC), then analyze the solutions in different scenarios. By integrating fan economy and herd behavior into game-theoretic frameworks, we conduct decision analysis. First, our results show that compared with SPC, both STC and OS can lead to <em>Pareto</em> improvement. Second, when platforms have strong bargaining power and market conditions are sluggish, both parties opt for OS as the equilibrium strategy. Third, STC is optimal when brands and platforms have comparable bargaining power in flourishing markets. Especially as market conditions change, STC can effectively adjust the retail price and stimulate the brand to invest. Three extensions based on revenue sharing and cost sharing mechanisms validate the robustness of the findings. Our research comprehensively investigates the impacts of network externality, livestreaming services, and negotiation power on optimal strategic choices, presenting a robust decision framework that offers practical guidance for the livestreaming commerce ecosystem to foster collaborative growth.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104352"},"PeriodicalIF":8.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772318","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":"CL-DGCN: contrastive learning based deeper graph convolutional network for traffic flow data prediction","authors":"Enwei Zhang ,&nbsp;Zhiqiang Lv ,&nbsp;Zesheng Cheng ,&nbsp;Jintao Ke","doi":"10.1016/j.tre.2025.104345","DOIUrl":"10.1016/j.tre.2025.104345","url":null,"abstract":"<div><div>Accurate and efficient traffic prediction helps to establish multimodal transportation systems and improve the travelling experience in daily life. Currently the mainstream traffic prediction methods are implemented based on Graph Convolutional Network (GCN), superimposing GCN layers can obtain better prediction results, but excessive superimposition will lead to the over-smooth problem, this paper proposes CL-DGCN to overcome this problem, which obtains the representations of the features through contrastive learning, and uses the improved message aggregation function to overcome the over-smooth problem. In this study, the CL-DGCN model is experimented on four domestic and international open-source, real datasets (PEMSBAY, METR-LA, BEIJING and SZ-TAXI), and CL-DGCN achieves optimal or sub-optimal results in most time-step predictions, and reduces the composite error by more than 10 % compared to the baseline model, which well illustrates that the CL-DGCN model possesses more accurate prediction results.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104345"},"PeriodicalIF":8.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772319","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":"On the optimal micro-hub locations in a multi-modal last-mile delivery system","authors":"Patrick Stokkink ,&nbsp;Nikolas Geroliminis","doi":"10.1016/j.tre.2025.104344","DOIUrl":"10.1016/j.tre.2025.104344","url":null,"abstract":"<div><div>Last-mile delivery is one of the most polluting parts of the supply chain. This is partially caused by increased congestion in urban areas and repetitive stop-and-go traffic. One possible alternative to this is to use micro-mobility to replace large motorized vehicles. However, these vehicles are usually slower and have lower capacity. In this work, we propose a multi-modal logistics system for last-mile delivery that combines the use of trucks, metro and micro-mobility. This innovative type of system uses the metro to distribute the parcels to micro-hubs across the network and uses micro-mobility only for the final part of the parcel’s itinerary from the micro-hub to the front door of the customer. We focus on finding the optimal micro-hub locations in such a system. We use a continuum approximation of the operational and tactical decisions which includes routing of the micro-mobility vehicles. The whole problem is then modeled as a Mixed Integer Linear Programming (MILP) model for the strategic decisions regarding the micro-hubs, which include location, capacity, and fleet-assignment decisions. We evaluate the results of a case study of the city of Madrid, which illustrates that a multi-modal last-mile delivery system can significantly improve a traditional last-mile delivery system in terms of operational costs and pollution.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104344"},"PeriodicalIF":8.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144781300","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 decomposable multi-fusion spatio-temporal marine traffic flow forecasting algorithm: Taking the North Sea and Baltic Sea region as an example","authors":"Yi Yuan ,&nbsp;Hetian Guo ,&nbsp;Zipei Fan ,&nbsp;Yingzhi Peng ,&nbsp;Jiaqi Zhang ,&nbsp;Xuan Song ,&nbsp;Ryosuke Shibasaki","doi":"10.1016/j.tre.2025.104340","DOIUrl":"10.1016/j.tre.2025.104340","url":null,"abstract":"<div><div>Maritime transportation, which is responsible for handling over 80% of global trade, is integral to the international supply chain. As global trade continues to expand, the management of marine traffic has become crucial for improving logistics efficiency. Precise and accurate marine traffic flow (MTF) prediction is essential for optimizing shipping routes, reducing transit times, and improving overall supply chain effectiveness. AIS equipment is now mandatory on vessels, transmitting static data such as the vessel’s identification code and flag state, along with dynamic data including latitude, longitude, speed and heading. High-frequency and comprehensive AIS data enables more accurate predictions of maritime traffic flow. In this paper, we propose an end-to-end MTF prediction framework utilizing AIS data as the primary source. The algorithm encompasses three critical steps: data preprocessing, marine traffic network extraction, and maritime traffic flow prediction. This comprehensive approach ensures more accurate predictions of the maritime traffic flow. In the marine traffic network extraction process, we distinguish nodes by categorizing AIS data feature points into mooring points and waypoints to obtain a more accurate identification. We then introduce a Decomposable Multi-fusion Spatio-temporal Network (DMFSTN) to enhance the accuracy of maritime traffic flow predictions. Existing approaches do not solve the relationship between static and dynamic features well. At the same time, the often-used serialized extraction of spatial and temporal features tends to overlook fine-grained spatio-temporal dependence features. To address these issues, our DMFSTN model integrates temporal and spatial features and leverages dynamic and static spatial relationships for more precise MTF predictions. Additionally, our model also decomposes marine flow data into trend and seasonal components, offering insights into underlying patterns. As a case study, we apply our model to analyze MTF of the North Sea and Baltic Sea region using data provided by the Danish Maritime Administration. Extensive comparative and ablation experiments in this dataset demonstrate the effectiveness of our model.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104340"},"PeriodicalIF":8.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144781302","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":"Preservation modes and channel leadership in seafood supply chains: A comparative study of chilled and frozen strategies","authors":"Zhangwei Feng ,&nbsp;Na Luo ,&nbsp;Lingxiao Wu ,&nbsp;Yanping Liu ,&nbsp;Herbert Sima","doi":"10.1016/j.tre.2025.104355","DOIUrl":"10.1016/j.tre.2025.104355","url":null,"abstract":"<div><div>The preservation of seafood is a critical challenge in the fresh food supply chain, particularly when navigating the complexities of dual-channel models and leadership dynamics. This paper investigates the impact of preservation methods (chilled vs. frozen) and leadership structures (centralized vs. decentralized) on seafood supply chains. We examine the strategic decisions of suppliers and retailers regarding preservation mode selection and explore the advantages of supplier- or retailer-dominated supply chains. By incorporating insights from extension models, we highlight how hybrid sales channels, combining chilled and frozen modes, can outperform a single mode under specific conditions related to fixed and variable costs. Additionally, we investigate the conditions under which decentralized supply chains can outperform centralized systems, particularly in markets where product freshness and retailer responsiveness are crucial. Through a comparative analysis, we reveal critical thresholds for trade-offs between supply chain models, emphasizing the importance of cost structures, and propose cost-sharing contracts to enhance coordination and incentivize investment in cold chain logistics. This study contributes to the understanding of fresh food supply chains, preservation technologies, hybrid sales modes, and leadership dynamics, offering practical implications for optimizing seafood supply chain operations.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"203 ","pages":"Article 104355"},"PeriodicalIF":8.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144772317","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}