EURO Journal on Transportation and Logistics最新文献_第8页

Vehicle sharing systems: A review and a holistic management framework 车辆共享系统:检讨及整体管理架构

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100033

Selin Ataç , Nikola Obrenović , Michel Bierlaire

引用次数: 21

Solving vehicle routing problems with stochastic and correlated travel times and makespan objectives 解决具有随机和相关行程时间和完工时间目标的车辆路线问题

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100029

Iurii Bakach , Ann Melissa Campbell , Jan Fabian Ehmke , Timothy L. Urban

引用次数: 6

A new approach for the traveling salesperson problem with hotel selection 旅游销售人员选择酒店问题的新方法

IF 2.4

EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI: 10.1016/j.ejtl.2021.100062

Augusto Pizano Vieira Beltrão , Luiz Satoru Ochi , José André de Moura Brito , Gustavo Silva Semaan , Nelson Maculan , Augusto César Fadel

{"title":"A new approach for the traveling salesperson problem with hotel selection","authors":"Augusto Pizano Vieira Beltrão , Luiz Satoru Ochi , José André de Moura Brito , Gustavo Silva Semaan , Nelson Maculan , Augusto César Fadel","doi":"10.1016/j.ejtl.2021.100062","DOIUrl":"10.1016/j.ejtl.2021.100062","url":null,"abstract":"<div><p>The Traveling Salesperson Problem with Hotel Selection (TSPHS) corresponds to a variant of the classic Traveling Salesman Problem (TSP) where the salesperson must establish a route in order to visit and attend all customers and return to the point of origin. At the end of each working day, if they had not attended all customers, the salesperson must go to a hotel (and stay there overnight). The objective of TSPHS is to first minimize the number of trips and then to minimize the total time spent. The present work proposes a new heuristic algorithm called BRKGA-LS, that combines characteristics and procedures of well-established metaheuristics and methods of vehicle routing problems. Based on computational experiments, carried out with 131 instances of the literature, the global optimum was achieved in about 90% of the cases where it is known (86 out of 95 instances), and the algorithm was able to improve the results of the literature in 11 of all 36 instances. Additionally, a hypothesis test was performed to validate the results and the good performance of the BRKGA-LS in comparison to other algorithms in the literature. Therefore, the proposed algorithm is a promising alternative for solving the problem addressed.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.4,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000297/pdfft?md5=c9d6e1498c7729aed22b3055df250d5f&pid=1-s2.0-S2192437621000297-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116511152","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}

引用次数: 1

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

引用次数: 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 , Twan Dollevoet , Gábor Maróti , 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":null,"pages":null},"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 , David Rößler , Guido Schryen , 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":null,"pages":null},"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, Pengling Wang, 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":null,"pages":null},"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

引用次数: 0

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":null,"pages":null},"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

引用次数: 5