EURO Journal on Transportation and Logistics最新文献

筛选
英文 中文
Erratum regarding missing declaration of competing interest statement in previously published article 关于先前发表的文章中缺少竞争利益声明的勘误
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100030
{"title":"Erratum regarding missing declaration of competing interest statement in previously published article","authors":"","doi":"10.1016/j.ejtl.2021.100030","DOIUrl":"https://doi.org/10.1016/j.ejtl.2021.100030","url":null,"abstract":"","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100030"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100030","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136518317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Variable Neighborhood Search heuristic for rolling stock rescheduling 机车车辆调度的可变邻域搜索启发式算法
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100032
Rowan Hoogervorst , Twan Dollevoet , Gábor Maróti , Dennis Huisman
{"title":"A Variable Neighborhood Search heuristic for rolling stock rescheduling","authors":"Rowan Hoogervorst ,&nbsp;Twan Dollevoet ,&nbsp;Gábor Maróti ,&nbsp;Dennis Huisman","doi":"10.1016/j.ejtl.2021.100032","DOIUrl":"10.1016/j.ejtl.2021.100032","url":null,"abstract":"<div><p>We present a Variable Neighborhood Search heuristic for the rolling stock rescheduling problem. Rolling stock rescheduling is needed when a disruption leads to cancellations in the timetable. In rolling stock rescheduling, one must then assign duties, i.e., sequences of trips, to the available train units in such a way that both passenger comfort and operational performance are taken into account. For our heuristic, we introduce three neighborhoods, which focus on swapping duties between train units, on improving the individual duties and on changing the shunting that occurs between trips, respectively. These neighborhoods are used for both a Variable Neighborhood Descent local search procedure and for perturbing the current solution in order to escape from local optima. Moreover, we show that the heuristic can be extended to the setting of flexible rolling stock turnings at ending stations by introducing a fourth neighborhood. We apply our heuristic to instances of Netherlands Railways (NS). The results show that the heuristic is able to find high-quality solutions within 1 ​min of solving time. This allows rolling stock dispatchers to use our heuristic in real-time rescheduling.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100032"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100032","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123381441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Study on sensitivity of electric bus systems under simultaneous optimization of charging infrastructure and vehicle schedules 充电基础设施和车辆调度同步优化下电动客车系统灵敏度研究
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100049
Miriam Stumpe , David Rößler , Guido Schryen , Natalia Kliewer
{"title":"Study on sensitivity of electric bus systems under simultaneous optimization of charging infrastructure and vehicle schedules","authors":"Miriam Stumpe ,&nbsp;David Rößler ,&nbsp;Guido Schryen ,&nbsp;Natalia Kliewer","doi":"10.1016/j.ejtl.2021.100049","DOIUrl":"10.1016/j.ejtl.2021.100049","url":null,"abstract":"<div><p>The transition from traditional fuel-based bus transportation towards electric bus systems is regarded as a beacon of hope for emission-free public transport. In this study, we focus on battery electric bus systems, in which charging is possible at a variety of locations distributed at terminal stations over the entire bus network. In such systems, two intertwined planning problems to be considered are charging location planning and electric vehicle scheduling. We account for the interdependent nature of both planning problems by adopting a simultaneous optimization perspective. Acknowledging the existence of parameter uncertainty in such complex planning situations, which is rooted in potential changes of values of several environmental factors, we analyze the solution sensitivity to several of these factors in order to derive methodological guidance for decision makers in public transportation organizations. Based on the formulation of a new mathematical model and the application of a variable neighborhood search metaheuristic, we conduct sensitivity analysis by means of numerical experiments drawing on real-world data. The experiments reveal that it is not possible to identify persistent structures for charging locations by an a priori analysis of the problem instances, so that rather a simultaneous optimization is necessary. Furthermore, the experiments show that the configuration of electric bus systems reacts sensitively to parameter changes.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100049"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100049","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121331790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
The impact of wind on energy-efficient train control 风对列车节能控制的影响
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2020.100013
Alessio Trivella, Pengling Wang, Francesco Corman
{"title":"The impact of wind on energy-efficient train control","authors":"Alessio Trivella,&nbsp;Pengling Wang,&nbsp;Francesco Corman","doi":"10.1016/j.ejtl.2020.100013","DOIUrl":"https://doi.org/10.1016/j.ejtl.2020.100013","url":null,"abstract":"<div><p>An energy-efficient train trajectory corresponds to the speed profile of a train between two stations that minimizes energy consumption while respecting the scheduled arrival time and operational constraints such as speed limits. Determining this trajectory is a well-known problem in the operations research and transport literature, but has so far been studied without accounting for stochastic variables like weather conditions or train load that in reality vary in each journey. These variables have an impact on the train resistance, which in turn affects the energy consumption. In this paper, we focus on wind variability and propose a train resistance equation that accounts for the impact of wind speed and direction explicitly on the train motion. Based on this equation, we compute the energy-efficient speed profile that exploits the knowledge of wind available before train departure, i.e., wind measurements and forecasts. Specifically, we: (i) construct a distance-speed network that relies on a new non-linear discretization of speed values and embeds the physical train motion relations updated with the wind data, and (ii) compute the energy-efficient trajectory by combining a line-search framework with a dynamic programming shortest path algorithm. Extensive numerical experiments reveal that our “wind-aware” train trajectories present different shape and reduce energy consumption compared to traditional speed profiles computed regardless of any wind information.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100013"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2020.100013","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136518315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Preface: Public transport planning in the face of uncertainty 前言:面对不确定性的公共交通规划
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100035
Marie Schmidt, Konstantinos Gkiotsalitis, Inmaculada Rodríguez-Martín
{"title":"Preface: Public transport planning in the face of uncertainty","authors":"Marie Schmidt,&nbsp;Konstantinos Gkiotsalitis,&nbsp;Inmaculada Rodríguez-Martín","doi":"10.1016/j.ejtl.2021.100035","DOIUrl":"https://doi.org/10.1016/j.ejtl.2021.100035","url":null,"abstract":"","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100035"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100035","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136518311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust transit line planning based on demand estimates obtained from mobile phones 基于从移动电话获得的需求估计的稳健的交通线路规划
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100034
Chungmok Lee , Rahul Nair
{"title":"Robust transit line planning based on demand estimates obtained from mobile phones","authors":"Chungmok Lee ,&nbsp;Rahul Nair","doi":"10.1016/j.ejtl.2021.100034","DOIUrl":"10.1016/j.ejtl.2021.100034","url":null,"abstract":"<div><p>The line-planning problem seeks to determine the set of fixed routes (or lines) a transit operator should run, along with associated operation frequencies. We propose an optimization algorithm for the transit-line-planning problem based on bi-level programming that exploits the problem’s structure in conjunction with the range estimation of demands. The issue of conservativeness due to the range estimation is mitigated by adopting the robust optimization approach. The model was inspired by a real-world application that leverages big data available from telecommunications operators to estimate city-wide mobility patterns. Demand estimates from such sources are based on large sample sizes (often orders of magnitude larger than those used in survey-based approaches), and capture day-to-day variability in travel demand as ranges. The validity of the proposed algorithm is demonstrated by using real-world data derived from 2.5 billion call data records from Abidjan, Côte d’Ivoire.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100034"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100034","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124071351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Multi-modal transport of perishable products with demand uncertainty and empty repositioning: A scenario-based rolling horizon framework 具有需求不确定性和空重新定位的易腐产品多式联运:基于场景的滚动地平线框架
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100044
M. SteadieSeifi, N. Dellaert, T. Van Woensel
{"title":"Multi-modal transport of perishable products with demand uncertainty and empty repositioning: A scenario-based rolling horizon framework","authors":"M. SteadieSeifi,&nbsp;N. Dellaert,&nbsp;T. Van Woensel","doi":"10.1016/j.ejtl.2021.100044","DOIUrl":"10.1016/j.ejtl.2021.100044","url":null,"abstract":"<div><p>We study the planning of a multi-modal transportation system with perishable products, demand uncertainty and repositioning of the empty Returnable Transport Items (RTIs). We propose a rolling horizon framework where we periodically re-optimize. As such, relevant responses and actions to new occurred demand are taken, and possible updates to the transportation and repositioning plans can be made. Our rolling horizon framework considers the uncertainty of customer demand, formulated as a Scenario-based Two-Stage Program (STSP) for which a set of scenarios is generated. An Adaptive Large Neighborhood Search (ALNS) algorithm is used to solve this scenario-based problem. Our proposed ALNS algorithm employs new operators and strategies to solve this complex and large problem. We give detailed computational analysis on the properties of our framework, evaluating the effects of stochastic demand, and we provide practical insights.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100044"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100044","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127083194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A multi-agent semi-cooperative unmanned air traffic management model with separation assurance 一种具有分离保障的多智能体半合作无人空中交通管理模型
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100058
Yanchao Liu
{"title":"A multi-agent semi-cooperative unmanned air traffic management model with separation assurance","authors":"Yanchao Liu","doi":"10.1016/j.ejtl.2021.100058","DOIUrl":"10.1016/j.ejtl.2021.100058","url":null,"abstract":"<div><p>This paper presents an air traffic management framework to enable multiple fleets of unmanned aerial vehicles to traverse dense, omni-directional air traffic safely and efficiently. The main challenge addressed here is separation assurance in the absence of full coordination and communication. In this framework, each fleet is independently managed by a routing agent, which progressively plans the non-overlapping move-ahead corridors for vehicles in the fleet by solving a nonlinear optimization model. The model is artfully designed so that agents of different fleets need not engage in complicated multilateral communications or make guesses about external vehicles’ flight intents to maintain effective inter-vehicle separation. For a complex routing problem, the framework is able to support centralized fleet routing, decentralized vehicle self-routing, and any other agent-vehicle configuration in between, allowing for customized trade-off between response time and traffic efficiency. Innovative algorithmic enhancements for solving the agent’s nonconvex routing problem are prescribed with detailed annotation. The effectiveness and noteworthy properties of the framework are demonstrated by several simulation experiments.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100058"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000261/pdfft?md5=e74f9e283138db8bab09feaf99004b23&pid=1-s2.0-S2192437621000261-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132901269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
ACS-OPHS: Ant Colony System for the Orienteering Problem with hotel selection 带酒店选择的定向运动问题的蚁群系统
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100036
Somayeh Sohrabi, Koorush Ziarati, Morteza Keshtkaran
{"title":"ACS-OPHS: Ant Colony System for the Orienteering Problem with hotel selection","authors":"Somayeh Sohrabi,&nbsp;Koorush Ziarati,&nbsp;Morteza Keshtkaran","doi":"10.1016/j.ejtl.2021.100036","DOIUrl":"10.1016/j.ejtl.2021.100036","url":null,"abstract":"<div><p>In this paper, an algorithm, called ACS-OPHS, is proposed to tackle the Orienteering Problem with Hotel Selection (OPHS). This algorithm is strongly based on the Ant Colony System (ACS); however, it differs from the ACS in the way the paths are constructed, in tuning a parameter of the transition rule and in the pheromone trails updating rules. The ACS-OPHS uses a bi-directional search strategy and employs a novel and fast approach to identify all feasible intermediate hotels in an offline manner. Moreover, in the ACS-OPHS, the relative importance of exploitation versus exploration is determined according to the progress of the algorithm in approaching to the global optima. The ACS-OPHS is a simple and well-performing approach to solve the OPHS. Concerning the standard benchmark instances, it outperforms the state-of-the-art algorithms in several instances and produces competitive solutions in reasonable time. This algorithm also improves the best known results of four instances with unknown optimal solutions.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100036"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100036","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133072221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
The Dynamic Electric Carsharing Relocation Problem 动态电动共享汽车搬迁问题
IF 2.4
EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100055
Simen Hellem , Carl Andreas Julsvoll , Magnus Moan , Henrik Andersson , Kjetil Fagerholt , Giovanni Pantuso
{"title":"The Dynamic Electric Carsharing Relocation Problem","authors":"Simen Hellem ,&nbsp;Carl Andreas Julsvoll ,&nbsp;Magnus Moan ,&nbsp;Henrik Andersson ,&nbsp;Kjetil Fagerholt ,&nbsp;Giovanni Pantuso","doi":"10.1016/j.ejtl.2021.100055","DOIUrl":"10.1016/j.ejtl.2021.100055","url":null,"abstract":"<div><p>This article addresses a relocation and recharging problem faced by modern carsharing operators who manage a fleet of electric vehicles. As customers utilize the fleet, batteries are depleted and vehicles are possibly left in low-demand locations. Consequently, carsharing operators need to arrange the charging of depleted batteries and the relocation of poorly positioned vehicles in order to better meet the demand of the customers. Most of these activities require the intervention of dedicated staff. This article provides a framework for planning recharging and relocation activities based on periodically routing and scheduling a number of dedicated staff as a result of updated system information. The periodic planning problem is formulated as a Mixed Integer Linear Program and solved in a rolling-horizon fashion. For the solution of the problem a fast Adaptive Large Neighborhood Search heuristic is proposed. Tests based on data for the city of Oslo show that the heuristic can deliver, in reasonable computational time, high quality solutions for instances compatible with real-life planning problems.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100055"},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000248/pdfft?md5=a2326fe8316bc17cfb75786a0b30194b&pid=1-s2.0-S2192437621000248-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123045067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
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学术官方微信