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

A multimodal solution approach for mitigating the impact of planned maintenance on metro rail attractiveness 一种减轻计划维修对地铁轨道吸引力影响的多式联运解决方案

IF 2.4

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

Alice Consilvio , Lorenzo Calabrò , Angela Di Febbraro , Nicola Sacco

{"title":"A multimodal solution approach for mitigating the impact of planned maintenance on metro rail attractiveness","authors":"Alice Consilvio , Lorenzo Calabrò , Angela Di Febbraro , Nicola Sacco","doi":"10.1016/j.ejtl.2021.100047","DOIUrl":"10.1016/j.ejtl.2021.100047","url":null,"abstract":"<div><p>The possible unavailability of urban rail-based transport services due to planned maintenance activities may have significant consequences on the perceived quality of service, thus affecting railway attractiveness.</p><p>To cope with the mitigation of planned service interruptions and to guarantee a seamless journey and a good travel experience for passengers, it is possible to exploit the existing services differently and/or provide additional on-demand services, such as temporary supplemental bus lines.</p><p>In this context, this paper aims to develop a mathematical programming model for planning service interruptions due to maintenance considering passenger transport demand dynamics. In particular, the proposed approach deals with service interruptions characterized by a long duration for which timetable adaption strategies are not applicable, suggesting mitigation actions that exploit the already existing services and/or the activation of additional ones, with the aim of minimizing users’ inconvenience. In doing so, the planned infrastructure status (i.e., available or under maintenance), as well as the forecasted transport demand, are taken into account to adapt the service accordingly by offering a multimodal transport solution to passengers.</p><p>To find the best solution, a decomposition solution approach is proposed in combination with a multistage cooperative framework with feedback that models the negotiation process between the involved actors.</p><p>Finally, the applicability of the proposed approach to real case studies is discussed based on some performance indicators.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100047"},"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.100047","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72578237","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

MILP models for the Dial-a-ride problem with transfers 带传输的“拨号乘车”问题的MILP模型

IF 2.4

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

Jacopo Pierotti, J. Theresia van Essen

{"title":"MILP models for the Dial-a-ride problem with transfers","authors":"Jacopo Pierotti, J. Theresia van Essen","doi":"10.1016/j.ejtl.2021.100037","DOIUrl":"10.1016/j.ejtl.2021.100037","url":null,"abstract":"<div><p>Automated vehicles are becoming a reality. Expectations are that AVs will ultimately transform personal mobility from privately owned assets to on-demand services. This transformation will enhance the possibility of sharing trips, leading to shared AVs (SAVs). The preeminent aim of this paper is to lay foundations for fast and efficient algorithms to be used in such new driving conditions. These algorithms must be able to solve Dial-a-Ride problems with transfers (DARPT). Hence, they should efficiently assign passengers to vehicles and routes while also: administering vehicles dispatch, determining convenient parking for idling vehicles and managing vehicle routing in real-time. In this paper, we develop two integer linear programming models (one in continuous time and one in discrete time) and their extensions to solve the DARPT. Our models take into account routing, service times, constraints on maximum route time-span, unserved requests, preferred arrival and departure time, nonconstant travel times, convenient parking while optimizing routing costs and quality of the service. The models are tested on instances based on Google Maps data by solving them with a commercial solver. The results of these tests are the starting point for validating the performance of forthcoming, ad hoc metaheuristics to be used in real-life sized scenarios.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100037"},"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.100037","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117136388","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}

引用次数: 4

The stochastic liner shipping fleet repositioning problem with uncertain container demands and travel times 具有不确定集装箱需求和行程时间的随机班轮船队重新定位问题

IF 2.4

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

Stefan Kuhlemann , Jana Ksciuk , Kevin Tierney , Achim Koberstein

{"title":"The stochastic liner shipping fleet repositioning problem with uncertain container demands and travel times","authors":"Stefan Kuhlemann , Jana Ksciuk , Kevin Tierney , Achim Koberstein","doi":"10.1016/j.ejtl.2021.100052","DOIUrl":"10.1016/j.ejtl.2021.100052","url":null,"abstract":"<div><p>Liner shipping repositioning is the costly process of moving container ships between services in a liner shipping network to adjust the network to the changing demands of customers. Existing deterministic models for the liner shipping fleet repositioning problem (LSFRP) ignore the inherent uncertainty present in the input parameters. Assuming these parameters are deterministic could lead to extra costs when plans computed by a deterministic model are realized. We introduce an optimization model for the stochastic LSFRP that handles uncertainty regarding container demands and ship travel times. We extend existing LSFRP instances with uncertain parameters and use this new dataset to evaluate our model. We demonstrate the influence of uncertain demand and travel times on the resulting repositioning plans. Furthermore, we show that stochastic optimization generates solutions yielding up to ten times higher expected values and more robust solutions, measured against the CVaR90 objective, for decision-makers in the liner shipping industry compared to the application of deterministic optimization in the literature.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100052"},"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.100052","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121553880","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

Modelling and comparison of stability metrics for a re-optimisation approach of the Inventory Routing Problem under demand uncertainty 需求不确定性下库存路径问题再优化方法的稳定性指标建模与比较

IF 2.4

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

Faycal A. Touzout, Anne-Laure Ladier, Khaled Hadj-Hamou

{"title":"Modelling and comparison of stability metrics for a re-optimisation approach of the Inventory Routing Problem under demand uncertainty","authors":"Faycal A. Touzout, Anne-Laure Ladier, Khaled Hadj-Hamou","doi":"10.1016/j.ejtl.2021.100050","DOIUrl":"10.1016/j.ejtl.2021.100050","url":null,"abstract":"<div><p>The inventory routing problem (IRP) is an optimisation problem that integrates transportation and inventory management decisions. When subjected to unexpected events such as demand changes, the <em>a posteriori</em> approach consists in re-optimising including the data related to this event; the challenge is to ensure that the obtained solution does not deviate too much from the original one, lest that creates important organisational issues. Therefore, a stability metric is needed when re-optimising IRP models. This article proposes a panel of stability metrics adapted from the scheduling, routing and inventory management literature to fit the requirements of the IRP and proposes mathematical formulations for the most relevant ones. A framework of comparison is proposed to validate and compare these metrics over a benchmark of 3000 instances generated from the literature. A strong correlation between the metrics is observed. Moreover, the results show that ensuring the stability of the re-optimised solutions has little impact on the initial objective, the total cost.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100050"},"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.100050","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127261478","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}

引用次数: 2

Axle Weights in combined Vehicle Routing and Container Loading Problems 组合车辆路线和集装箱装载问题中的轴重

IF 2.4

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

Corinna Krebs , Jan Fabian Ehmke

{"title":"Axle Weights in combined Vehicle Routing and Container Loading Problems","authors":"Corinna Krebs , Jan Fabian Ehmke","doi":"10.1016/j.ejtl.2021.100043","DOIUrl":"https://doi.org/10.1016/j.ejtl.2021.100043","url":null,"abstract":"<div><p>Overloaded axles not only lead to increased erosion on the road surface, but also to an increased braking distance and more serious accidents due to higher impact energy. Therefore, the load on axles should be already considered during the planning phase and thus before loading the truck in order to prevent overloading. Hereby, a detailed 2D or 3D planning of the vehicle cargo space is required. We model the Axle Weight Constraint for trucks with and without trailers based on the Science of Statics and provide flexible formulas for different axle configurations of trucks. We include the Axle Weight Constraint into the combined Vehicle Routing and Container Loading Problem (“2L-CVRP” and “3L-CVRP”). A hybrid heuristic approach is used where an outer Adaptive Large Neighbourhood Search tackles the routing problem and an inner Deepest-Bottom-Left-Fill algorithm solves the packing problem. Moreover, to ensure feasibility, we show that the Axle Weight Constraint must be checked after each placement of an item. The impact of the Axle Weight Constraint is also evaluated.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100043"},"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.100043","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136518812","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}

引用次数: 13

The Baggage Belt Assignment Problem 行李带分配问题

IF 2.4

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

David Pisinger , Rosario Scatamacchia

{"title":"The Baggage Belt Assignment Problem","authors":"David Pisinger , Rosario Scatamacchia","doi":"10.1016/j.ejtl.2021.100041","DOIUrl":"10.1016/j.ejtl.2021.100041","url":null,"abstract":"<div><p>We consider the problem of assigning flights to baggage belts in the baggage reclaim area of an airport. The problem is originated by a real-life application in Copenhagen airport. The objective is to construct a robust schedule taking passenger and airline preferences into account. We consider a number of business and fairness constraints, avoiding congestion, and ensuring a good passenger flow. Robustness of the solutions is achieved by matching the delivery time with the expected arrival time of passengers, and by adding sufficient buffer time between two flights scheduled on the same belt. We denote this problem as the Baggage Belt Assignment Problem (BBAP). We first derive a general Integer Linear Programming (ILP) formulation for the problem. Then, we propose a Branch-and-Price (B&P) algorithm based on a reformulation of the ILP model tackled by Column Generation. Our approach relies on an effective dynamic programming algorithm for handling the pricing problems. We tested the proposed algorithm on a set of real-life data from Copenhagen airport as well as on a set of instances inspired by the real data. Our B&P scheme outperforms a commercial solver launched on the ILP formulation of the problem and is effective in delivering high quality solutions in limited computational times, making it possible to use the solution approach in daily operations in medium-sized and large airports.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100041"},"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.100041","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124186428","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}

引用次数: 2

Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows 带时间窗的广义车辆路径问题的大邻域搜索与精确方法

IF 2.4

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

Dorian Dumez , Christian Tilk , Stefan Irnich , Fabien Lehuédé , Olivier Péton

{"title":"Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows","authors":"Dorian Dumez , Christian Tilk , Stefan Irnich , Fabien Lehuédé , Olivier Péton","doi":"10.1016/j.ejtl.2021.100040","DOIUrl":"10.1016/j.ejtl.2021.100040","url":null,"abstract":"<div><p>Delivery options are at the heart of the generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests are shipped to alternative delivery locations which can also have different time windows. Recently, the vehicle routing problem with delivery options was introduced into the scientific literature. It extends the GVRPTW by capacities of shared locations and by specifying service-level constraints defined by the customers’ preferences for delivery options. The vehicle routing problem with delivery options also generalizes the vehicle routing problem with home roaming delivery locations and the vehicle routing problem with multiple time windows. For all these GVRPTW variants, we present a widely applicable matheuristic that relies on a large neighborhood search (LNS) employing several problem-tailored destruction operators. Most of the time, the LNS performs relatively small and fast moves, but when the solution has not been improved for many iterations, a larger destruction move is applied to arrive in a different region of the search space. Moreover, an adaptive layer of the LNS embeds two exact components: First, a set-partitioning formulation is used to combine previously found routes to new solutions. Second, the Balas-Simonetti neighborhood is adapted to further improve already good solutions. These new components are in the focus of our work and we perform an exhaustive computational study to evaluate four configurations of the new matheuristic on several benchmark instances of the above-mentioned variants. On all the benchmark sets, our matheuristic is competitive with the previous state-of-the-art methods. In summary, the four configurations provide 81 new best-known solutions.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100040"},"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.100040","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115047021","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}

引用次数: 10

The vehicle routing problem with relaxed priority rules 放宽优先规则下的车辆路径问题

IF 2.4

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

Thanh Tan Doan , Nathalie Bostel , Minh Hoàng Hà

引用次数: 6

Erratum regarding missing Declaration of competing interest statements in previously published articles 关于先前发表的文章中缺少竞争利益声明的勘误表

IF 2.4

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

引用次数: 0

Integrating vehicle routing into intermodal service network design with stochastic transit times 基于随机运输时间的车辆路径与多式联运服务网络设计

IF 2.4

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

Jan Philipp Müller , Ralf Elbert , Simon Emde

{"title":"Integrating vehicle routing into intermodal service network design with stochastic transit times","authors":"Jan Philipp Müller , Ralf Elbert , Simon Emde","doi":"10.1016/j.ejtl.2021.100046","DOIUrl":"10.1016/j.ejtl.2021.100046","url":null,"abstract":"<div><p>Service network design is an important optimization problem for intermodal freight transportation on a tactical level. It includes the decisions on choosing transportation modes and paths for commodities throughout the intermodal network. We present a stochastic service network design model with an integrated vehicle routing problem (SSND-VRP), which simultaneously covers transportation service choice and tour planning decisions for road transportation under consideration of uncertain transportation times. A sample average approximation approach is combined with an iterated local search in order to solve problem instances in a real-world case study for three intermodal road-rail networks in Central Europe. Results of the SSND-VRP are compared with its expected value model and a successive planning approach, demonstrating the possible cost reductions and the decrease in missed intermodal services that are achieved by the integrated stochastic model. In further parameter variation experiments we show that the attractiveness of rail transportation is highly sensitive to changes in intermodal costs, whereas the impact of delay reductions of the railway services is relatively low.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"10 ","pages":"Article 100046"},"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.100046","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128395504","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