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

{"title":"Integrated scheduling of truck and drone fleets for cargo transportation in post-disaster relief: A two-stage stochastic optimization approach","authors":"Xin Yang ,&nbsp;Wenjie Cao ,&nbsp;Kai Wang ,&nbsp;Haodong Yin ,&nbsp;Jianjun Wu ,&nbsp;Lingxiao Wu","doi":"10.1016/j.tre.2025.104015","DOIUrl":"10.1016/j.tre.2025.104015","url":null,"abstract":"<div><div>This paper develops a two-stage stochastic optimization approach to handle the integrated scheduling problem of truck and drone fleets for cargo transportation in post-disaster relief. Initially, a two-stage stochastic optimization model is introduced to account for the uncertainty of the traveling time of trucks. The first stage involves an integer nonlinear optimization model to determine the drone allocation scheme and truck scheduling scheme, and the second stage employs a mixed-integer linear optimization model to establish the drone scheduling scheme. Subsequently, an efficient heuristic algorithm based on parallel computation is developed to solve the problem. Finally, some experimental tests were conducted using real disaster data from extreme rainstorms in Fangshan District, Beijing in July 2023. The extensive experiments demonstrate that the proposed algorithm consistently identifies high-quality solutions efficiently compared to the exact algorithm. The numerical results suggest that considering the drone allocation scheme can reduce relief cargo transportation time and enhance transportation efficiency.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104015"},"PeriodicalIF":8.3,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403631","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":"Joint re-dispatching and pricing on a business-to-consumer ride-hailing platform","authors":"Jiang-Hua Zhang,&nbsp;Rui Zhu,&nbsp;Jing-Peng Wang","doi":"10.1016/j.tre.2025.103998","DOIUrl":"10.1016/j.tre.2025.103998","url":null,"abstract":"<div><div>On-demand B2C ride-hailing platforms have enhanced service efficiency through centralized order dispatching and full-time driver management while diversifying services to meet passengers’ varying needs for service quality. This paper is one of the first that considers a B2C ride-hailing platform that coordinates ordinary and limousine services, integrating re-dispatching and pricing strategies to optimize short-term revenue and strategically determining its fleet size and initial vehicle allocation to enhance long-term system welfare. We establish a two-period framework to capture the decision-making processes of various stakeholders, considering passengers’ heterogeneous preferences for the two services and the impact of re-dispatching limousine vehicles. For the platform’s short-term operational strategy, we identify a critical threshold for the initial allocation proportion of ordinary vehicles. Below this critical threshold, and in markets smaller than a specific size decreasing with the initial ordinary vehicle proportion, a joint re-dispatching and pricing strategy should be adopted. Otherwise, a single pricing strategy suffices. All passengers can be served in smaller markets, while only passengers with stronger preferences for the ordinary (limousine) service place orders in larger markets. The platform can enhance long-term system welfare by strategically managing fleet size and optimizing the initial allocation of vehicles. Larger markets or greater service quality differences promote the platform to choose a larger fleet and fewer initial ordinary vehicles. In contrast, a larger difference in operating costs between limousine and ordinary vehicles has the opposite effect.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 103998"},"PeriodicalIF":8.3,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403713","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":"Destination-to-gate assignment to mitigate congestion-related risks in oversaturated metro lines: A new passenger flow control strategy","authors":"Linhuan Zhong ,&nbsp;Guangming Xu ,&nbsp;Wei Liu ,&nbsp;Yang Liu ,&nbsp;Xinyi Liu","doi":"10.1016/j.tre.2025.104005","DOIUrl":"10.1016/j.tre.2025.104005","url":null,"abstract":"<div><div>The accumulation of large passenger flows at metro stations often poses congestion risks to urban rail systems, including an increased likelihood of accidents (e.g., slips, trips, and falls) and train departure delays. However, during peak hours, the priority boarding rights of passengers at upstream stations often lead to congestion and overcrowding at downstream popular stations. We propose a new passenger flow control strategy to address this issue, namely destination-to-gate assignment. This approach assigns specific gates to destinations served by the station, enabling passengers to board the appropriate train carriages. This strategic allocation facilitates a more even distribution of passengers, reducing congestion and enhancing spatial equity in passenger travel, thereby mitigating operational risks associated with overcrowding. For the problem of interest, we propose a nonlinear integer programming model to optimize the destination-to-gate assignment, aiming to simultaneously minimize risks related to passenger crowding and waiting times. The model adopts a first-come, first-served (FCFS) boarding rule to accurately capture the dynamic nature of passenger flow while considering the capacity limitations of train carriages. Leveraging the model’s characteristics, we employ a set of linearization methods to equivalently transform it into a mixed-integer linear programming (MILP) model. To address the computational challenges posed by real-world scale, we develop a customized heuristic algorithm that uses Variable Neighborhood Search (VNS) combined with passenger flow simulation to efficiently generate high-quality solutions. Finally, we conduct a series of numerical experiments using data from Guangzhou Metro Line 9 to demonstrate the effectiveness of our proposed approach. The results show that the proposed destination-to-gate assignment strategy effectively alleviates congestion-related risks across all stations and promotes spatial equity in passenger travel, even under varying levels of passenger compliance, demand, and train delays. It can thus be recommended as a self-organizing and easily implementable passenger flow control method.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104005"},"PeriodicalIF":8.3,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403711","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":"Design of platform-labeling standards and competition strategy for retail platforms","authors":"Sijie Zhou,&nbsp;Ye Shi,&nbsp;Yugang Yu,&nbsp;Jie Liu","doi":"10.1016/j.tre.2025.104010","DOIUrl":"10.1016/j.tre.2025.104010","url":null,"abstract":"<div><div>In operations management, eco-labels have become a crucial measure to stimulate green product production and consumption. Most related research focuses on self-labeling by firms or national-labeling by external certifiers, while few studies consider the implementation of platform-label certification. After constructing a two-stage optimization model to explore the design mechanism of platform-labeling standards, we propose the optimal platform-label design policy in a platform-based supply chain. We also propose the optimal strategies for competing firms on the retail platform. When the labeling credibility is high, the platform-labeling policy benefits the platform-labeled retailer. The platform-labeling strategy achieves Pareto improvement in total profit and environmental benefit under a global (entire sales season) optimization criterion or with a profit-maximizing platform. Both the platform-labeled retailer and environment benefit more from our proposed solutions for platform-labeling than current common policies. When platform designs a higher platform-labeling standard, effective measures must be taken to improve the platform’s reputation. The retailers should adopt platform-labeling when its credibility is high but retain self-labeling when it is low. Platforms can compensate the benefit-injured party through cost sharing and commission reduction while gaining more money from the beneficiary. We identify how and when the platform should intervene to stimulate green product development through platform-labeling certification and extend the base model to validate the robustness of our main results.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104010"},"PeriodicalIF":8.3,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403712","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":"Integrated reinforcement learning of automated guided vehicles dynamic path planning for smart logistics and operations","authors":"G.T.S. Ho ,&nbsp;Yuk Ming Tang ,&nbsp;Eric K.H. Leung ,&nbsp;P.H. Tong","doi":"10.1016/j.tre.2025.104008","DOIUrl":"10.1016/j.tre.2025.104008","url":null,"abstract":"<div><div>Automated guided vehicles (AGV) play a critical role in fostering a smarter logistics and operations environment. Conventional path planning for AGVs enables the load-in-load-out of the items, but existing approaches rarely consider dynamic integrations with smart warehouses and factory systems. Therefore, this study presents a reinforcement learning (RL) approach for real-time path planning in automated guided vehicles within smart warehouses or smart factories. Unlike conventional path planning methods, which struggle to adapt to dynamic operational changes, the proposed algorithm integrates real-time information to enable responsive and flexible routing decisions. The novelty of this study lies in integrating AGV path planning and RL within a dynamic environment, such as a smart warehouse containing various workstations, charging stations, and storage locations. Through various scenarios in smart factory settings, this research demonstrates the algorithm’s effectiveness in handling complex logistics and operations environments. This research advances AGV technology by providing a scalable solution for dynamic path planning, enhancing efficiency in modern industrial systems.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 104008"},"PeriodicalIF":8.3,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143395215","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":"Robust emergency logistics network design for pandemic emergencies under demand uncertainty","authors":"Yucong Hu,&nbsp;Qingyang Liu,&nbsp;Sitong Li,&nbsp;Weitiao Wu","doi":"10.1016/j.tre.2024.103957","DOIUrl":"10.1016/j.tre.2024.103957","url":null,"abstract":"<div><div>Pandemic emergencies often result in a surge in demand for emergency supplies in affected regions. To expedite the recovery process, ensuring prompt and reliable emergency supplies is crucial, yet the demand for these supplies often exhibits stochastic and time-varying characteristics as the emergency evolves. This paper introduces a two-echelon multi-period location-routing allocation problem, with the objective of concurrent optimization of facility location, transportation routing, and the allocation of various types of emergency supplies. We integrate a constraint relationship equation that links supplies and cure rate into the established SEIR model to illustrate how emergency supplies counter the spread of the epidemic. In terms of the uncertain demand for various emergency supplies across multiple emergency periods, we quantify the nominal supply demand utilizing an enhanced SEIR model. On this basis, a set of uncertain demands for emergency supplies that are subject to random disturbances in real demand is established. We devise a multi-objective robust optimization model employing a budget-of-uncertainty robust approach to minimize total transportation time, total transportation cost, and shortage of emergency supplies. Subsequently, we develop a customized multi-objective discrete gray wolf algorithm aimed at enhancing solution efficiency. Our model is applied to a real-world case study in Shanghai during the 2022 COVID-19 pandemic. Results have proved that the algorithm is effective and feasible. Managerial insights are also provided.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"196 ","pages":"Article 103957"},"PeriodicalIF":8.3,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143395139","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":"Arrival information-guided spatiotemporal prediction of transportation hub passenger distribution","authors":"Long Cheng ,&nbsp;Xinmei Cai ,&nbsp;Da Lei ,&nbsp;Shulin He ,&nbsp;Min Yang","doi":"10.1016/j.tre.2025.104011","DOIUrl":"10.1016/j.tre.2025.104011","url":null,"abstract":"<div><div>Understanding the spatiotemporal distribution of hub passenger flow is essential for optimizing both hub and urban transportation operations. However, predicting spatiotemporal distribution of transportation hub passenger flow encounters is challenging due to complex factors influencing its dynamics. This paper proposes a deep learning model, the Deep Spatiotemporal Graph Attention Network (DSTGAT), to predict the spatiotemporal distribution of hub passenger flow in urban areas. The DSTGAT consists of two modules: a spatiotemporal passenger flow prediction module and a passenger flow correction module. The spatiotemporal prediction module integrates Graph Attention Networks (GATs) and Gated Recurrent Units (GRUs) to capture the spatial and temporal dependencies in passenger flow, considering factors such as land function, adjacency, distance to the hub, and weather conditions. The passenger flow correction module uses Dynamic Time Warping (DTW) to identify the similarity of historical arrival passenger flows. Based on this similarity, it selects the most similar passenger flow distribution for prediction correction. A case study using data from Beijing Daxing International Airport in China demonstrates the superior performance of the DSTGAT compared to baseline models. The model exhibits robust predictive accuracy, particularly in regions with high passenger flow fluctuations and during holiday periods. The study highlights the importance of considering external factors and arrival passenger flow in achieving accurate hub passenger flow predictions.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 104011"},"PeriodicalIF":8.3,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143377761","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":"Profit maximization in congested hub location problems: Demand models and service level constraints","authors":"Ata Jalili Marand ,&nbsp;Pooya Hoseinpour","doi":"10.1016/j.tre.2025.103995","DOIUrl":"10.1016/j.tre.2025.103995","url":null,"abstract":"<div><div>This study investigates a congested hub location problem with the aim of optimizing a service provider’s profit by determining hub locations, capacities, and prices for serving commodities. The study incorporates a price-dependent demand function with a general functional form and models hub operations as <span><math><mrow><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn></mrow></math></span> queueing systems to address congestion effects. The problem is initially formulated as a mixed-integer nonlinear program, which is subsequently transformed into a mixed-integer second-order cone program, demonstrating solvability with standard off-the-shelf solvers. Through numerical analysis, the study evaluates the influence of different demand functional forms and service time constraints on the optimal network configuration and the service provider’s profitability.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103995"},"PeriodicalIF":8.3,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143351038","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":"Agricultural supply chain finance considering interest or direct subsidy by government","authors":"Zelong Yi ,&nbsp;Yuqing Chen ,&nbsp;Suyuan Luo ,&nbsp;Hao Huang","doi":"10.1016/j.tre.2025.103992","DOIUrl":"10.1016/j.tre.2025.103992","url":null,"abstract":"<div><div>In practice, interest subsidy and direct subsidy are implemented by many governments to alleviate the financial burdens on farmers who seek loans from banks. However, the issues regarding whether these subsidies should be adopted and which subsidy policy is more effective under bank financing remain underexplored. To address the gap, this paper investigates the impact of distinct subsidy policies on capital-constrained farmers, as well as on consumers and society under bank financing. We establish an agricultural supply chain involving two competing farmers, a bank and a government, wherein the two farmers are heterogeneous in their production costs, and the government provides interest subsidy or direct subsidy to them. By deriving and comparing the equilibrium results among three models (bank financing without government subsidy, bank financing with interest subsidy, and bank financing with direct subsidy), we derive the following main findings: First, when the unit production costs between the farmers are relatively unbalanced, an escalation in the government subsidy rate (interest/direct subsidy rate) results in a decrease in both the planting quantity and the profit of the farmer with a lower unit production cost. Second, the preference for government subsidy policies between the farmers is contingent on the unit production cost gap. Both farmers opt for the same subsidy policy when the unit cost gap is immaterial, while they prefer different subsidy policies when the unit cost disparity is significant. Third, government subsidies may not always be beneficial to the individual farmers, the collective farmers, consumers, and society. Moreover, the selection of the optimal subsidy policy is contingent on the interest subsidy rate and the expected market potential. Collectively, these findings highlight the important role of government subsidies in influencing farmers, consumers and society.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103992"},"PeriodicalIF":8.3,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143302520","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":"Truthful online bundle double auction mechanisms for a transport market with dynamic demands and supplies","authors":"Jiantao Guo ,&nbsp;Juliang Zhang ,&nbsp;T.C.E. Cheng","doi":"10.1016/j.tre.2025.103964","DOIUrl":"10.1016/j.tre.2025.103964","url":null,"abstract":"<div><div>In this paper, we study the transaction mechanism design problem for a market where shippers and carriers dynamically arrive at and depart from an online freight platform to trade their transport services over a transport network. The agents are self-interested and their valuations, costs, and arrival and departure times are private information. We propose online double auction mechanisms to dynamically match the demands and supplies and set the transaction prices for three different cases. We first consider the case that each shipper wants to procure one unit of transport service on a lane and each carrier can supply multiple units of transport service on multiple lanes, and propose the Online Bundle Double Auction (OBDA) mechanism for it. We show that the mechanism is <em>feasible, incentive-compatible</em>, <em>individually rational</em>, and <em>budget-balanced</em>. Then we further consider two more general cases: the case where the shippers have multi-unit demand on one lane and the case where the shippers have multi-unit indivisible demand on multiple lanes. We show that the framework of the OBDA mechanism can still be applied to these cases by modifying some rules. We show that the two modified mechanisms still have good properties. Moreover, we conduct numerical studies to investigate the impacts of some parameters on these mechanisms’ performance.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"195 ","pages":"Article 103964"},"PeriodicalIF":8.3,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143302431","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}