首页 > 最新文献

Transportation Letters-The International Journal of Transportation Research最新文献

英文 中文
Enhanced forecasting of online car-hailing demand using an improved empirical mode decomposition with long short-term memory neural network 利用改进的经验模式分解与长短期记忆神经网络加强网约车需求预测
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2313832
Jiaming Liu , Xiaoya Tang , Haibin Liu
The study on forecasting demand for online car-hailing holds substantial implications for both online car-hailing platforms and government agencies responsible for traffic management. This research proposes an enhanced Empirical Mode Decomposition Long-short Term Memory Neural Network (EMD-LSTM) model. EMD technique reduces noise and extracts stable intrinsic mode functions (IMF) from the original time series. Genetic algorithm is deployed to improve the K-Means clustering for determining optimal clusters. These sub time series serve as input for the prediction model, with combined results giving final predictions. Experimental data from Didi includes Haikou’s car-hailing orders from May to October 2017 and Beijing’s from January to May 2020. Results show improved EMD-LSTM reduces instability and captures characteristics better. Compared to unmodified EMD-LSTM, RMSE decreases by 3.50%, 6.81%, and 6.81% for the three datasets, and by 30.97%, 20%, and 9.24% respectively compared to single LSTM model.
关于网约车需求预测的研究对网约车平台和负责交通管理的政府机构都有重大意义。这项研究...
{"title":"Enhanced forecasting of online car-hailing demand using an improved empirical mode decomposition with long short-term memory neural network","authors":"Jiaming Liu ,&nbsp;Xiaoya Tang ,&nbsp;Haibin Liu","doi":"10.1080/19427867.2024.2313832","DOIUrl":"10.1080/19427867.2024.2313832","url":null,"abstract":"<div><div>The study on forecasting demand for online car-hailing holds substantial implications for both online car-hailing platforms and government agencies responsible for traffic management. This research proposes an enhanced Empirical Mode Decomposition Long-short Term Memory Neural Network (EMD-LSTM) model. EMD technique reduces noise and extracts stable intrinsic mode functions (IMF) from the original time series. Genetic algorithm is deployed to improve the K-Means clustering for determining optimal clusters. These sub time series serve as input for the prediction model, with combined results giving final predictions. Experimental data from Didi includes Haikou’s car-hailing orders from May to October 2017 and Beijing’s from January to May 2020. Results show improved EMD-LSTM reduces instability and captures characteristics better. Compared to unmodified EMD-LSTM, RMSE decreases by 3.50%, 6.81%, and 6.81% for the three datasets, and by 30.97%, 20%, and 9.24% respectively compared to single LSTM model.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1389-1405"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139756103","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}
引用次数: 0
The paired pickup and delivery problem with profit in a two-echelon delivery system with multiple trucks and drones 由多辆卡车和无人机组成的双层运输系统中具有利润的成对取货和送货问题
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2278855
Ebrahim Teimoury , Reza Rashid
Recently researchers proposed truck and drone coordination to increase delivery efficiency and suggested various truck-drone routing problems. In this paper, we also focused on truck and drone coordination and introduced the paired pickup and delivery problem with profit in a two-echelon delivery system. To solve the problem, we propose a hybrid variable neighborhood search algorithm. For this algorithm, we adapted existing neighborhood search operators from the literature and considering the structure of the proposed problem, developed new neighborhood search operators. Also, we have carried out numerous computational experiments to evaluate the proposed solution methods’ performance, where the results show the efficiency of the proposed algorithms. The results highlight that in the paired pickup and delivery problem, for small values of drone operational costs, employing the two-echelon truck and drone routing system increases the profit by up to 5.6 percent in comparison to the vehicle routing system with drones.
最近,研究人员提出了卡车和无人机协调以提高运输效率,并提出了各种卡车-无人机路线问题。在本文中,我们还关注了卡车和无人机的协调问题,并引入了两级配送系统中具有利润的成对取货和配送问题。为了解决这一问题,我们提出了一种混合变量邻域搜索算法。对于该算法,我们采用了文献中已有的邻域搜索算子,并考虑问题的结构,开发了新的邻域搜索算子。此外,我们进行了大量的计算实验来评估所提出的求解方法的性能,结果显示了所提出算法的效率。结果表明,在配对拾取和交付问题中,对于无人机运营成本的小值,采用双层卡车和无人机路线系统与无人机车辆路线系统相比,利润增加了5.6%。
{"title":"The paired pickup and delivery problem with profit in a two-echelon delivery system with multiple trucks and drones","authors":"Ebrahim Teimoury ,&nbsp;Reza Rashid","doi":"10.1080/19427867.2023.2278855","DOIUrl":"10.1080/19427867.2023.2278855","url":null,"abstract":"<div><div>Recently researchers proposed truck and drone coordination to increase delivery efficiency and suggested various truck-drone routing problems. In this paper, we also focused on truck and drone coordination and introduced the paired pickup and delivery problem with profit in a two-echelon delivery system. To solve the problem, we propose a hybrid variable neighborhood search algorithm. For this algorithm, we adapted existing neighborhood search operators from the literature and considering the structure of the proposed problem, developed new neighborhood search operators. Also, we have carried out numerous computational experiments to evaluate the proposed solution methods’ performance, where the results show the efficiency of the proposed algorithms. The results highlight that in the paired pickup and delivery problem, for small values of drone operational costs, employing the two-echelon truck and drone routing system increases the profit by up to 5.6 percent in comparison to the vehicle routing system with drones.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1171-1187"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135341744","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}
引用次数: 0
Research on shared parking allocation considering the heterogeneity of parking slot providers’ temporary parking demand 考虑停车位提供者临时停车需求异质性的共享停车位分配研究
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2303225
Qiaoru Li , Juanjuan Cheng , Liang Chen
Studies on the allocation of parking demand during the sharing period primarily focus on public parking users, ignoring parking slot providers’ temporary parking demand with heterogeneity. Therefore, this paper takes the allocation of parking slot providers’ temporary parking demand as the research object and establishes a differentiated parking allocation (DPA) model to maximize the platform’s net profit. The model is solved using the ant colony optimization (ACO) algorithm and compared with the First-Come-First-Served (FCFS) algorithm. Then, the platform adopts differentiated or undifferentiated charge measures when charging for the parking slot providers’ temporary parking demand. The numerical analysis is performed to select three indicators for evaluation: 1) the utilization rate, 2) the net profit, and 3) the degree of time fragmentation. Results show that the ACO algorithm has an excellent optimization effect in allocating, and the differentiated allocation-undifferentiated charges for the parking slot providers’ temporary parking demand is feasible.
关于共享期间停车需求分配的研究主要集中在公共停车用户上,忽略了停车位提供者的异质性临时停车需求。因此...
{"title":"Research on shared parking allocation considering the heterogeneity of parking slot providers’ temporary parking demand","authors":"Qiaoru Li ,&nbsp;Juanjuan Cheng ,&nbsp;Liang Chen","doi":"10.1080/19427867.2024.2303225","DOIUrl":"10.1080/19427867.2024.2303225","url":null,"abstract":"<div><div>Studies on the allocation of parking demand during the sharing period primarily focus on public parking users, ignoring parking slot providers’ temporary parking demand with heterogeneity. Therefore, this paper takes the allocation of parking slot providers’ temporary parking demand as the research object and establishes a differentiated parking allocation (DPA) model to maximize the platform’s net profit. The model is solved using the ant colony optimization (ACO) algorithm and compared with the First-Come-First-Served (FCFS) algorithm. Then, the platform adopts differentiated or undifferentiated charge measures when charging for the parking slot providers’ temporary parking demand. The numerical analysis is performed to select three indicators for evaluation: 1) the utilization rate, 2) the net profit, and 3) the degree of time fragmentation. Results show that the ACO algorithm has an excellent optimization effect in allocating, and the differentiated allocation-undifferentiated charges for the parking slot providers’ temporary parking demand is feasible.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1305-1317"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139408981","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}
引用次数: 0
Are men from Mars, women from Venus? Investigating the determinants behind the intention to use fully automated taxis 男人来自火星,女人来自金星吗?调查全自动出租车使用意向背后的决定因素
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2310336
Yonghan Zhu , Marijn Janssen , Chengyan Pu
Acceptance by customers is key to the success of shared autonomous vehicles (SAVs). However, only a small group of early technology-savvy customers currently use such vehicles, while the general population does not. Based on the Unified Theory of Acceptance and Use of Technology, Theory of Perceived Risk, and perceived threat of unemployment combined with knowledge of automated vehicles, this research develops an integrated model to investigate the determinants behind the intention to use fully automated taxis. Furthermore, it tested the differences between gender. Through the analysis of 539 samples, the findings showed that performance expectancy, effort expectancy, social influence, and knowledge of automated vehicles positively influence acceptance intention, while perceived safety risk and the perceived threat of unemployment were negatively related to behavioral intention. Moreover, effort expectancy, social influence, and perceived safety risk showed greater influence on females, while knowledge of automated vehicles exerted stronger effects on males.
客户的接受程度是共享自动驾驶汽车(SAVs)成功的关键。然而,目前只有一小部分早期精通技术的客户在使用这类车辆,而普通消费者对共享自动驾驶汽车的接受度却很低。
{"title":"Are men from Mars, women from Venus? Investigating the determinants behind the intention to use fully automated taxis","authors":"Yonghan Zhu ,&nbsp;Marijn Janssen ,&nbsp;Chengyan Pu","doi":"10.1080/19427867.2024.2310336","DOIUrl":"10.1080/19427867.2024.2310336","url":null,"abstract":"<div><div>Acceptance by customers is key to the success of shared autonomous vehicles (SAVs). However, only a small group of early technology-savvy customers currently use such vehicles, while the general population does not. Based on the Unified Theory of Acceptance and Use of Technology, Theory of Perceived Risk, and perceived threat of unemployment combined with knowledge of automated vehicles, this research develops an integrated model to investigate the determinants behind the intention to use fully automated taxis. Furthermore, it tested the differences between gender. Through the analysis of 539 samples, the findings showed that performance expectancy, effort expectancy, social influence, and knowledge of automated vehicles positively influence acceptance intention, while perceived safety risk and the perceived threat of unemployment were negatively related to behavioral intention. Moreover, effort expectancy, social influence, and perceived safety risk showed greater influence on females, while knowledge of automated vehicles exerted stronger effects on males.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1366-1377"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139756095","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}
引用次数: 0
Motorized two-wheeler riders’ rear brake application in sudden hazardous event of animal crossing 机动两轮骑手后制动在突发性危险事件中的应用
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2291227
Monik Gupta , Nagendra R. Velaga
This study aims to quantify the riders’ performance in the sudden event of animal crossing using explanatory variables such as psychological riding conditions and socio demographic parameters. The participants were asked to ride four sessions on the motorized two-wheeler simulator in randomized order: 1) Base, 2) Distraction, 3) Time pressure, and 4) Distraction along with Time pressure. The rear brake application was classified into four groups using K-means clustering: No braking, Mild braking, Harsh braking, and Very Harsh braking. Further, a multinomial logistic regression model was developed to quantify the rear braking behavior. The results from the study revealed that the odds of applying the harsher brakes are only 0.32 times in comparison to mild braking when riders are distracted. Overall findings indicate that riders’ psychological conditions can alter rider’s behavior, and driver training focusing on several hazards can further help in improving road safety.
本研究旨在利用心理骑行条件和社会人口学参数等解释变量,量化骑手在动物穿越突发事件中的表现。…
{"title":"Motorized two-wheeler riders’ rear brake application in sudden hazardous event of animal crossing","authors":"Monik Gupta ,&nbsp;Nagendra R. Velaga","doi":"10.1080/19427867.2023.2291227","DOIUrl":"10.1080/19427867.2023.2291227","url":null,"abstract":"<div><div>This study aims to quantify the riders’ performance in the sudden event of animal crossing using explanatory variables such as psychological riding conditions and socio demographic parameters. The participants were asked to ride four sessions on the motorized two-wheeler simulator in randomized order: 1) Base, 2) Distraction, 3) Time pressure, and 4) Distraction along with Time pressure. The rear brake application was classified into four groups using K-means clustering: No braking, Mild braking, Harsh braking, and Very Harsh braking. Further, a multinomial logistic regression model was developed to quantify the rear braking behavior. The results from the study revealed that the odds of applying the harsher brakes are only 0.32 times in comparison to mild braking when riders are distracted. Overall findings indicate that riders’ psychological conditions can alter rider’s behavior, and driver training focusing on several hazards can further help in improving road safety.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1268-1275"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138494246","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}
引用次数: 0
Exploring the design of reward functions in deep reinforcement learning-based vehicle velocity control algorithms 探索基于深度强化学习的车辆速度控制算法中的奖励函数设计
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2305018
Yixu He , Yang Liu , Lan Yang , Xiaobo Qu
The application of deep reinforcement learning (DRL) techniques in intelligent transportation systems garners significant attention. In this field, reward function design is a crucial factor for DRL performance. Current research predominantly relies on a trial-and-error approach for designing reward functions, lacking mathematical support and necessitating extensive empirical experimentation. Our research uses vehicle velocity control as a case study, build training and test sets, and develop a DRL framework for speed control. This framework examines both single-objective and multi-objective optimization in reward function designs. In single-objective optimization, we introduce “expected optimal velocity” as an optimization objective and analyze how different reward functions affect performance, providing a mathematical perspective on optimizing reward functions. In multi-objective optimization, we propose a reward function design paradigm and validate its effectiveness. Our findings offer a versatile framework and theoretical guidance for developing and optimizing reward functions in DRL, particularly for intelligent transportation systems.
深度强化学习(DRL)技术在智能交通系统中的应用备受关注。在这一领域,奖励函数设计是 DRL 的关键因素。
{"title":"Exploring the design of reward functions in deep reinforcement learning-based vehicle velocity control algorithms","authors":"Yixu He ,&nbsp;Yang Liu ,&nbsp;Lan Yang ,&nbsp;Xiaobo Qu","doi":"10.1080/19427867.2024.2305018","DOIUrl":"10.1080/19427867.2024.2305018","url":null,"abstract":"<div><div>The application of deep reinforcement learning (DRL) techniques in intelligent transportation systems garners significant attention. In this field, reward function design is a crucial factor for DRL performance. Current research predominantly relies on a trial-and-error approach for designing reward functions, lacking mathematical support and necessitating extensive empirical experimentation. Our research uses vehicle velocity control as a case study, build training and test sets, and develop a DRL framework for speed control. This framework examines both single-objective and multi-objective optimization in reward function designs. In single-objective optimization, we introduce “expected optimal velocity” as an optimization objective and analyze how different reward functions affect performance, providing a mathematical perspective on optimizing reward functions. In multi-objective optimization, we propose a reward function design paradigm and validate its effectiveness. Our findings offer a versatile framework and theoretical guidance for developing and optimizing reward functions in DRL, particularly for intelligent transportation systems.</div></div>","PeriodicalId":48974,"journal":{"name":"Transportation Letters-The International Journal of Transportation Research","volume":"16 10","pages":"Pages 1338-1352"},"PeriodicalIF":3.3,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139518426","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}
引用次数: 0
A many-to-many pick-up and delivery problem under stochastic battery depletion of electric vehicles 电动汽车随机电池耗尽情况下的多对多接送问题
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2294185
Merve İbiş Bozyel , Mehmet Soysal , Mustafa Çimen
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.
该研究将传统的取货和送货问题(pdp)扩展到解决城市物流和电动汽车(EV)采用的具体挑战。这些挑战包括电动汽车的行驶里程有限、沿途的能源消耗以及交通状况的不确定性。为了克服电动汽车的有限里程,该研究包括电池交换站,以确保有足够的能量来完成送货路线。车辆能源消耗考虑减少里程焦虑和优化能源使用。该研究还考虑了影响能源消耗和交付时间表的交通状况的不可预测性。为了解决这些问题,本研究提出了一个近似的二次机会约束混合整数规划(QC-MIP)模型,该模型具有线性近似、建设性启发式和元启发式。这些定量模型结合了全面的电动汽车能量估计方法,使能源预测更加准确。所提出的方法为提高城市物流环境中的能源效率和交付绩效提供了有价值的见解和策略。
{"title":"A many-to-many pick-up and delivery problem under stochastic battery depletion of electric vehicles","authors":"Merve İbiş Bozyel ,&nbsp;Mehmet Soysal ,&nbsp;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}
引用次数: 0
A day-to-day evacuation model to maximise transport resilience under dynamic hazards 一个日常疏散模型,以最大限度地提高动态灾害下的运输弹性
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2280860
Elnaz Bakhshian , Rui Teixeira , Beatriz Martinez-Pastor
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.
当灾难发生时,传输网络可能会受到破坏。部分道路可能全部或部分封闭,系统无法满足全部需求。关键考虑因素包括转移eva…
{"title":"A day-to-day evacuation model to maximise transport resilience under dynamic hazards","authors":"Elnaz Bakhshian ,&nbsp;Rui Teixeira ,&nbsp;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}
引用次数: 0
Festival timetable synchronization of metro trains and high-speed railway trains for late-night operations: an integrated bi-directional transfer optimization model 地铁列车与高铁列车深夜运行的节日时刻表同步:一体化双向换乘优化模型
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2290789
Xuan Li , Yan Liu , Quan Zhang
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.
本文主要研究了高速铁路与地铁夜间运行的节假日时刻表同步问题。提出了一种多目标优化地铁时刻表的模型。
{"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 ,&nbsp;Yan Liu ,&nbsp;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}
引用次数: 0
Online flash delivery from multiple depots 从多个仓库在线闪送
IF 3.3 3区 工程技术 Q2 TRANSPORTATION Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2278859
Maximilian Kronmüller , Andres Fielbaum , Javier Alonso-Mora
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.
摘要:本文研究了按需最后一英里物流的两个关键新特征:i)多个仓库,优化每个订单的取货地点;ii)允许车辆执行仓库…
{"title":"Online flash delivery from multiple depots","authors":"Maximilian Kronmüller ,&nbsp;Andres Fielbaum ,&nbsp;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}
引用次数: 0
期刊
Transportation Letters-The International Journal of Transportation Research
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1