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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2313832
Jiaming Liu , Xiaoya Tang , Haibin Liu
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2278855
Ebrahim Teimoury , Reza Rashid
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2303225
Qiaoru Li , Juanjuan Cheng , Liang Chen
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2310336
Yonghan Zhu , Marijn Janssen , Chengyan Pu
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2291227
Monik Gupta , Nagendra R. Velaga
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2024.2305018
Yixu He , Yang Liu , Lan Yang , Xiaobo Qu
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2294185
Merve İbiş Bozyel , Mehmet Soysal , Mustafa Çimen
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2280860
Elnaz Bakhshian , Rui Teixeira , Beatriz Martinez-Pastor
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2290789
Xuan Li , Yan Liu , Quan Zhang
{"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区 工程技术
Transportation Letters-The International Journal of Transportation Research Pub Date : 2024-11-25 DOI: 10.1080/19427867.2023.2278859
Maximilian Kronmüller , Andres Fielbaum , Javier Alonso-Mora
{"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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信