{"title":"A many-to-many pick-up and delivery problem under stochastic battery depletion of electric vehicles","authors":"Merve İbiş Bozyel , Mehmet Soysal , Mustafa Çimen","doi":"10.1080/19427867.2023.2294185","DOIUrl":"10.1080/19427867.2023.2294185","url":null,"abstract":"<div><div>The study extends the traditional pick-up and delivery problems (PDPs) to address the specific challenges of urban logistics and electric vehicle (EV) adoption. These challenges include the limited range of EVs, energy consumption along the route, and uncertainty in traffic conditions. To overcome the limited range of EVs, the study includes battery swapping stations to ensure sufficient energy to complete delivery routes. Vehicle energy consumption is considered to reduce range anxiety and optimize energy use. The study also considers the unpredictability of traffic conditions that affect energy consumption and delivery schedules. To address these concerns, the study proposes an approximate Quadratic Chance-Constrained Mixed-Integer Programming (QC-MIP) model with a linear approximation, a constructive heuristic and a meta-heuristic. These quantitative models incorporate comprehensive EV energy estimation approaches, enabling more accurate energy predictions. The proposed approaches provide valuable insights and strategies for improving energy efficiency and delivery performance in urban logistics environments.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1287-1304"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138946009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A day-to-day evacuation model to maximise transport resilience under dynamic hazards","authors":"Elnaz Bakhshian , Rui Teixeira , Beatriz Martinez-Pastor","doi":"10.1080/19427867.2023.2280860","DOIUrl":"10.1080/19427867.2023.2280860","url":null,"abstract":"<div><div>A transport network may face damage due to a disaster. Some roads may be wholly or partially closed, and the system cannot satisfy the whole demand. Critical considerations include transferring evacuees from dangerous zones to safe zones. This paper presents a novel optimization method that will allow a transport network to run more efficiently during a dynamic hazard that will change through the periods. The objective is to minimize the maximum time needed to evacuate the last group of people from critical and intermediate zones. Regarding the complexity class of evacuation problems, a Genetic Algorithm (GA) approach is designed to solve large-size problems. Also, the Sioux Falls network and Dublin Transportation Network case studies are defined to validate the proposed model and GA approach. This study assesses the system’s resilience during a critical event by comparing the system’s behavior before and during the hazard, which helps improve the recovery process.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1224-1236"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Festival timetable synchronization of metro trains and high-speed railway trains for late-night operations: an integrated bi-directional transfer optimization model","authors":"Xuan Li , Yan Liu , Quan Zhang","doi":"10.1080/19427867.2023.2290789","DOIUrl":"10.1080/19427867.2023.2290789","url":null,"abstract":"<div><div>This paper focuses on synchronizing festival timetables between high-speed railway (HSR) and metro for late-night operations. A multi-objective model is proposed to optimize metro timetables of the last service period incorporating collaboration with HSR timetables. The model is designed to facilitate bi-directional transfers by maximizing spatial accessibility and temporal availability of metro service as well as minimizing transfer waiting times for HSR passengers. Our model can be efficiently solved using Gurobi, providing optimal solutions for large-scale metro networks within reasonable computational timeframes. A real-world case study is conducted to validate the effectiveness of our model. The results indicate that slight adjustments to metro timetables, without introducing additional trains, can yield significantly enhancements in late-night metro service for HSR passengers. Moreover, a smaller extension of service time across the entire metro network is proved to be more effective than a greater extension of service time on hub-connected metro lines.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1252-1267"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138494247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Maximilian Kronmüller , Andres Fielbaum , Javier Alonso-Mora
{"title":"Online flash delivery from multiple depots","authors":"Maximilian Kronmüller , Andres Fielbaum , Javier Alonso-Mora","doi":"10.1080/19427867.2023.2278859","DOIUrl":"10.1080/19427867.2023.2278859","url":null,"abstract":"<div><div>We study routing for on-demand last-mile logistics with two crucial novel features: i) Multiple depots, optimizing where to pick-up every order, ii) Allowing vehicles to perform depot returns prior to being empty, thus adapting their routes to include new orders online. Both features result in shorter distances and more agile planning.We propose a scalable dynamic method to deliver orders as fast as possible. Following a rolling horizon approach, each time step the following is executed. First, define potential pick-up locations and identify which groups of orders can be transported together, with which vehicle and following which route. Then, decide which of these potential groups of orders will be executed and by which vehicle by solving an integer linear program. We simulate one day of service in Amsterdam that considers 10,000 requests, compare results to several strategies and test different scenarios. Results underpin the advantages of the proposed method.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1188-1204"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138504260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Parcel locker location problem with selectable volume sizes and heterogeneous customers in the last mile delivery","authors":"","doi":"10.1080/19427867.2023.2277013","DOIUrl":"10.1080/19427867.2023.2277013","url":null,"abstract":"<div><div>This study introduces a novel parcel locker location problem in the last mile delivery where each parcel locker is equipped with a set of selectable volume sizes and provides services for two types of customers: commuters and home-based customers. We establish a pickup cost model to quantify the effort exerted by customers during the retrieval process. Furthermore, we design a satisfaction function to measure customers’ willingness to retrieve items from a specific parcel locker. Finally, we implement a financial incentive mechanism to enhance customer satisfaction by reducing the pickup cost. To solve this problem, we formulate a problem-specific scatter search algorithm. Extensive experiments demonstrate the computational effectiveness of the proposed algorithm. Furthermore, sensitivity analyses show that the selectable volume size model can reduce the total cost by up to 16.8%, while “pickup on the way” can achieve a reduction of up to 63.97% in our instances.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1140-1154"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135286122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Metro stop-skipping rescheduling optimization considering passenger waiting time fairness","authors":"","doi":"10.1080/19427867.2023.2270243","DOIUrl":"10.1080/19427867.2023.2270243","url":null,"abstract":"<div><div>In urban metro systems, unexpected events often occur to cause discordance in the planned timetable and delay in passenger travel. Therefore, this study focuses on the timetable rescheduling problem by adopting a stop-skipping strategy during the off-peak period. In addition, there are a number of existing optimization models that minimize the total passenger waiting time, which can cause fairness issues for a small group of passengers having longer waiting time at some stations. In this study, a rescheduling model is proposed to consider passenger waiting time fairness and train travel time cost. This model is tested with a randomly designed delay scenario of Nanjing Metro Line 2, which can be efficiently solved by a designed iterative algorithm based on decomposition method. Compared to the standard stop pattern, the result shows that the stop-skipping pattern can better alleviate the impact of sudden delays, while simultaneously ensuring the passenger waiting time fairness.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1115-1125"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135888859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Integrated optimization of intermittent lane intersection design and dynamic signal control: efficiency, safety, and fuel consumption","authors":"","doi":"10.1080/19427867.2023.2278854","DOIUrl":"10.1080/19427867.2023.2278854","url":null,"abstract":"<div><div>Existing unconventional intersection designs can enhance the capacity of intersections to deal with repaid pressure on urban commuting, whereas they force vehicles to multi-stop and reorganize, resulting in safety risks and high fuel consumption. This paper proposes the Intermittent Lane Intersection (ILI) that combines the advantages of variable lane intersection and CTE (Combining the tandem control and exit lanes for left-turn control). An integrated optimization model is established to obtain the optimal geometric and signal control parameters, and a homothermic genetic algorithm is used to solve the model. Then, the application of ILI in different traffic demands of the Tianfu Third Street intersection is analyzed. Compared with the benchmark design (TI, CTE, and CTE with signal coordinated control), ILI can effectively reduce intersection delay, fuel consumption, and parking times. Additionally, ILI has great application superiority when the traffic arrival rate is [1500,1700] and the left-turn ratio is [0.40,0.60].</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1155-1169"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135242091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Investigating the spatial heterogeneity of factors influencing speeding-related crash severities using correlated random parameter order models with heterogeneity-in-means","authors":"","doi":"10.1080/19427867.2023.2262201","DOIUrl":"10.1080/19427867.2023.2262201","url":null,"abstract":"<div><div>Speeding has been acknowledged as a critical determinant in increasing the risk of crashes and their resulting injury severities. This paper employs Global Moran’s I coefficient and local Getis – Ord G* indexes to systematically account for the spatial distribution feature of speeding-related crashes, study the global spatial pattern of speeding-related crashes, and identify severe crash cluster districts. The findings demonstrate that severe speeding-related crashes within the state of Pennsylvania have a spatial clustering trend, where four crash datasets are extracted from four hotspot districts. Two log-likelihood ratio (LR) tests were conducted to determine whether speeding-related crashes classified by hotspot districts should be modeled separately. The results suggest that separate modeling is necessary. To capture the unobserved heterogeneity, four correlated random parameter order models with heterogeneity in means are employed to explore the factors contributing to crash severity involving at least one vehicle speeding.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 989-1001"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135548622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimizing electric bus charging infrastructure deployment under two charging modes considering seasonal differences","authors":"","doi":"10.1080/19427867.2023.2275855","DOIUrl":"10.1080/19427867.2023.2275855","url":null,"abstract":"<div><div>The innovations of battery and charging technologies facilitate worldwide bus electrification, which can conserve energy and reduce emissions. The emergence of wireless power transfer technology offers the potential to alleviate bus range anxiety. This paper constructs the layout models of static wireless and centralized charging stations based on the seasonal differences associated with battery capacities and passenger flow, which aims to obtain the bus charging station layout scheme of the lowest cost. Then, the heuristic algorithm is utilized to solve the layout models as the mixed linear programming problem. This study results confirm that the combined layout of static wireless and centralized charging stations is more advantageous than a single model. Finally, the required fixed cost of supporting bus system operation is explored for future capital reserves.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1126-1139"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135679849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A fast-response mathematical programming approach for delivering disaster relief goods: an earthquake case study","authors":"","doi":"10.1080/19427867.2023.2270238","DOIUrl":"10.1080/19427867.2023.2270238","url":null,"abstract":"<div><div>This paper tackles a complex logistics challenge of disaster management, encompassing warehouse location, pre-disaster inventory planning, routing, and post-disaster relief supply delivery. We establish an iterative process for optimizing relief distribution to shelters. Adaptable warehouse inventory reallocation responds to fluctuating demands, guided by a two-phase mathematical programming approach. In the first phase, a two-stage stochastic programming (TSSP) model determines optimal warehouse and shelter locations and inventory levels. In the subsequent phase, we introduce a mixed-integer programming (MIP) model to minimize the overall delivery time by making routing decisions. To streamline the process, we introduce a novel enumeration algorithm that trims down route options by considering unavailable links, effectively transforming the MIP model into an assignment-based model. This innovation results in a noticeable 74% reduction in solution time. Further efficiency is achieved by developing a branch-and-cut algorithm for swift MIP resolution. A real-world case study confirms the practicality of our approach.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 9","pages":"Pages 1091-1114"},"PeriodicalIF":3.3,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135221723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}