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

Formulating multi-class user equilibrium using mixed-integer linear programming 用混合整数线性规划表达多类用户均衡

IF 2.4

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

Xiao Lin , Ludovic Leclercq , Lóránt Tavasszy , Hans van Lint

{"title":"Formulating multi-class user equilibrium using mixed-integer linear programming","authors":"Xiao Lin , Ludovic Leclercq , Lóránt Tavasszy , Hans van Lint","doi":"10.1016/j.ejtl.2022.100097","DOIUrl":"10.1016/j.ejtl.2022.100097","url":null,"abstract":"<div><p>We introduce an approach to formulate and solve the multi-class user equilibrium traffic assignment as a mixed-integer linear programming (MILP) problem. Compared to simulation approaches, the analytical MILP formulation makes the solution of network assignment problems more tractable. When applied in a multi-class context, it obviates the need to assume a symmetrical influence between classes and thereby allows richer traffic behavior to be taken into account. Also, it integrates naturally in optimization problems such as maintenance planning and traffic management. We develop the model and apply it for the Sioux Falls network, showing that it outperforms the traditional Beckmann-based and MSA approaches in smaller-scale problems. Further research opportunities lie in developing extensions of MILP-based assignment, with different variants of user equilibrium or dynamic assignment, and in improving the model and solution algorithms to allow large-scale application.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100097"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S219243762200022X/pdfft?md5=43a9871032da36374820fc98c5ee382c&pid=1-s2.0-S219243762200022X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685876","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 topological approach for identifying pricing controller locations to ensure controllability of transportation networks 一种确定定价控制器位置以确保运输网络可控性的拓扑方法

IF 2.4

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

Xavier Mazur , Marco Rinaldi , Richard D. Connors , Francesco Viti

{"title":"A topological approach for identifying pricing controller locations to ensure controllability of transportation networks","authors":"Xavier Mazur , Marco Rinaldi , Richard D. Connors , Francesco Viti","doi":"10.1016/j.ejtl.2022.100078","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100078","url":null,"abstract":"<div><p>To use efficiently the infrastructure of transportation networks, control strategies have been developed with the aim to reduce negative externalities, such as congestion and pollutant emissions. Previous works demonstrated that the maximum performance achievable by traffic control policies depends on the number and location of controllers employed, which implies the need to determine a set of controllers capable of fully controlling the underlying transportation network. Various approaches have been explored in the literature to locate controllers on networks, however a gap remains in terms of scalability as the methods proposed often exhibit heavy computational complexity. In this paper we aim to propose an approach capable of locating pricing controllers on transportation networks that is scalable, such that it can be applied on large instances, such as city-sized or regional networks. For this purpose, we propose a topology-based approach, adapted from the sensor location problem, as both problems share similar characteristics. We validate our proposed approach by analyzing the performance of controller sets produced on a wide range of artificially generated network ensembles. The analysis we provide reveals that the method proposed, while being easily applicable on large instances, is capable to locate an efficient controller set, and to redirect flows on the network so as to reduce the total time spent by road users.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100078"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000061/pdfft?md5=6eb81aa2e633f03d4a2cdb26a1dc8d5e&pid=1-s2.0-S2192437622000061-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750800","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 branch-and-price algorithm for a team orienteering problem with fixed-wing drones 固定翼无人机团队定向问题的分支价格算法

IF 2.4

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

Kaarthik Sundar , Sujeevraja Sanjeevi, Christopher Montez

引用次数: 6

Ring hierarchical hub network design problem: Exact and heuristic solution methods 环形分层枢纽网络设计问题:精确和启发式解决方法

IF 2.4

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

Alireza Eydi , Amir Khaleghi , Khaled Barzegar

{"title":"Ring hierarchical hub network design problem: Exact and heuristic solution methods","authors":"Alireza Eydi , Amir Khaleghi , Khaled Barzegar","doi":"10.1016/j.ejtl.2022.100096","DOIUrl":"10.1016/j.ejtl.2022.100096","url":null,"abstract":"<div><p>In this paper, we study the hierarchical hub network design problem with a ring-star-star structure. In this problem, the hubs are located in two layers. In the first layer, central hubs (main hubs) are located in a ring structure, and in the second layer, secondary hubs are located. Each secondary hub is allocated to a central hub. Other demand points can also be allocated to each of these hubs (central hubs or secondary hubs). The objective is to minimize transportation costs on the network. This problem applies to communication networks when establishing direct links between demand nodes is not cost-effective, and there are two levels of service for customers. Also, the ring structure is used to reduce costs associated with full communication between central hubs. We present a mixed-integer programming model for the problem and report the results of the problem solving for a numerical example on the CAB dataset. Also, we present three solution methods for the problem. First, by exploiting the decomposable structure of the proposed model, we introduce an accelerated Benders decomposition algorithm. Then, we present a hybrid genetic algorithm that uses the Dijkstra algorithm to evaluate solutions. Next, we present a hybrid variable neighborhood search algorithm that uses the Dijkstra algorithm to calculate the cost of each solution. Also, a relax-and-fix algorithm is proposed to find near-optimal feasible solutions for the problem. Computational results are presented on the USA423 dataset. The results show that the proposed relax-and-fix algorithm can solve instances with up to 100 nodes. Also, the proposed hybrid algorithms can solve instances with up to 423 nodes. The performance of the proposed hybrid variable neighborhood search is better than the proposed hybrid genetic algorithm in solving large-sized instances.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100096"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000218/pdfft?md5=2b394226a408a658bd462d6743c79ffb&pid=1-s2.0-S2192437622000218-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121099779","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

A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty 需求不确定条件下鲁棒单源容量设施选址问题的分支价格算法

IF 2.4

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

Jaehyeon Ryu , Sungsoo Park

引用次数: 6

Rapid fulfillment of online orders in omnichannel grocery retailing 在全渠道杂货零售中快速完成在线订单

IF 2.4

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

Christian Dethlefs , Manuel Ostermeier , Alexander Hübner

{"title":"Rapid fulfillment of online orders in omnichannel grocery retailing","authors":"Christian Dethlefs , Manuel Ostermeier , Alexander Hübner","doi":"10.1016/j.ejtl.2022.100082","DOIUrl":"10.1016/j.ejtl.2022.100082","url":null,"abstract":"<div><p>Establishing innovative fulfillment options for online orders has become a key challenge for bricks-and-mortar retailers. A mere focus on store sales is no longer affordable due to the competition by pure online players. Retailers are continuously developing new approaches for online order fulfillment and last-mile logistics. Further shortening lead times is becoming even more important in this context. One recently developed concept is the omnichannel approach where existing structures are utilized and distribution centers (DCs) and local stores are integrated into a holistic fulfillment concept. This concept is especially relevant when retailers are providing fast delivery services (e.g., same-hour delivery). It resembles a multi-depot vehicle routing problem where all facilities act as depots and orders are assigned based on processing and transportation costs as well as available delivery capacity.</p><p>We address this new concept and present the novel problem for rapid integrated order fulfillment in grocery retailing. We empirically identify decision-relevant costs for order processing in stores and develop an approach for the evaluation of overall fulfillment costs. Our work considers the order assignment to heterogeneous depots and vehicle routing for each depot depending on depot-specific fulfillment costs using a tailored cluster-first-route-second heuristic. We show that integrated rapid order fulfillment can reduce costs by an average of 7.4% compared to order fulfillment from DCs. However, as order processing costs in stores remain a significant cost factor, DCs will always have some relevance and cannot entirely be replaced by delivery from stores. Our results highlight the importance of modeling order processing costs in stores for actual order fulfillment decisions in a heterogeneous network.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100082"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000097/pdfft?md5=f37dd29594fc6abb0fe7d07bc0d4e372&pid=1-s2.0-S2192437622000097-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833564","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

Crane scheduling for end-of-aisle picking: Complexity and efficient solutions based on the vehicle routing problem 通道末端拣选起重机调度:基于车辆路径问题的复杂高效解决方案

IF 2.4

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

Nils Boysen , Simon Emde , Konrad Stephan

{"title":"Crane scheduling for end-of-aisle picking: Complexity and efficient solutions based on the vehicle routing problem","authors":"Nils Boysen , Simon Emde , Konrad Stephan","doi":"10.1016/j.ejtl.2022.100085","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100085","url":null,"abstract":"<div><p>To relieve human order pickers from unproductive walking through a warehouse, parts-to-picker systems deliver demanded stock keeping units (SKUs) toward picking workstations. In a wide-spread parts-to-picker setup, a crane-operated automated storage and retrieval system (ASRS) delivers bins with demanded SKUs toward an end-of-aisle picking workstation and returns them back into the rack once the picks are completed. We consider the scheduling of the crane that operates subsequent dual commands. Each dual command combines a retrieval request for another SKU bin demanded at the picking workstation with a storage request, where a bin that has already been processed and passed through the bin buffer is returned to its dedicated storage position in the ASRS. This system setup in general and the resulting crane scheduling problem in particular have been an active field of research for more than 30 years. We add the following contributions to this stream of research: We finally prove that the crane scheduling problem is strongly NP-hard. Furthermore, we show that, although only a single vehicle (namely, the crane) is applied, the problem is equivalent to the traditional vehicle routing problem (VRP). This opens the rich arsenal of very efficient VRP solvers, which substantially outperform existing tailor-made algorithms from the literature.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100085"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000103/pdfft?md5=1723a64ccf0bfabd72badad387b41ac3&pid=1-s2.0-S2192437622000103-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750386","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

Helicopter recovery in an oil and gas industry: Model and solution approaches 油气行业的直升机回收:模型和解决方案

IF 2.4

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

Jonathan De La Vega , Thiago Vieira , Mateus Santana , Vitória Pureza , Reinaldo Morabito , Roberto Tavares , Yan Bastos , Paulo César Ribas

{"title":"Helicopter recovery in an oil and gas industry: Model and solution approaches","authors":"Jonathan De La Vega , Thiago Vieira , Mateus Santana , Vitória Pureza , Reinaldo Morabito , Roberto Tavares , Yan Bastos , Paulo César Ribas","doi":"10.1016/j.ejtl.2022.100084","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100084","url":null,"abstract":"<div><p>Although optimization techniques have been successfully applied for a number of airline operations, aircraft recovery remains a challenge for both practitioners and researchers due to its complexity and the usual need of a quick response in practical settings. In this paper, we consider the case of a Brazilian oil and gas company that uses a heterogeneous fleet of helicopters for passenger transportation from a few mainland aerodromes to maritime units. The major difficulties in rescheduling delayed flights are resource limitations and realistic features of the company combined with safety and management practices. The problem consists of determining joint daily flight reschedules for all aerodromes that satisfy operational constraints and recovers all pending flights, while minimizing flight transfers among aerodromes, usage of helicopters and overall flight delays. We propose a mixed integer programming (MIP) model, aiming to appropriately represent the problem, and MIP-based local search and two-phase heuristics to cope with larger realistic problem instances. Computational results obtained with instances collected in the case study show the potential of these approaches to deal with this real-life aircraft recovery problem.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100084"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000115/pdfft?md5=7a72e503d599c1f0098aab128f8e47ae&pid=1-s2.0-S2192437622000115-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750816","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

The price of anarchy in truckload transportation spot markets 卡车运输现货市场无政府状态的代价

IF 2.4

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

Michael Haughton , Borzou Rostami , Shervin Espahbod

{"title":"The price of anarchy in truckload transportation spot markets","authors":"Michael Haughton , Borzou Rostami , Shervin Espahbod","doi":"10.1016/j.ejtl.2022.100071","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100071","url":null,"abstract":"<div><p>A concept of relevance to spot markets for truck-based freight transportation services is the <em>price of anarchy</em> (<em>PoA</em>)<em>,</em> which defines the performance inferiority of decentralized market mechanisms for consummating transactions (vis-à-vis centralized mechanisms). To examine this concept in the context of transportation spot markets, this study uses a combination of behavioral experiments and mathematical optimization. The paper's contributions to the research literature for that context involve (1) addressing the case of freight transportation service providers having service requests information spanning multiple periods; (2) analyzing multiple performance measures; (2) accounting for the performance effects of human behavior; and (3) introducing new behavioral experiments as well as novel and effective analytical procedures to tackle truck-to-load assignment problems. Among the paper's most salient findings is that when performance is measured as the market participants' financial outcome, human behavior in buyer-seller interactions could result in a doubling of the <em>PoA</em>.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100071"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000012/pdfft?md5=65f6a971e89fef250347b2d5e7de4c9d&pid=1-s2.0-S2192437622000012-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750808","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

Electric flight scheduling with battery-charging and battery-swapping opportunities 具有电池充电和电池更换机会的电动飞行调度

IF 2.4

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

Mihaela Mitici, Madalena Pereira, Fabrizio Oliviero

{"title":"Electric flight scheduling with battery-charging and battery-swapping opportunities","authors":"Mihaela Mitici, Madalena Pereira, Fabrizio Oliviero","doi":"10.1016/j.ejtl.2022.100074","DOIUrl":"https://doi.org/10.1016/j.ejtl.2022.100074","url":null,"abstract":"<div><p>With the current advances in aircraft design and Lithium-Ion batteries, electric aircraft are expected to serve as a replacement for conventional, short-range aircraft. This paper addresses the main operational challenges for short-range flights operated with electric aircraft: determining the investment needs for a fleet of electric aircraft, and the logistics of charging stations and swap batteries required to support these flights. A mixed-integer linear program with two phases is proposed. In the first phase, a schedule for flight and battery recharge is developed for a fleet of electric aircraft. In the second phase, optimal times for battery charging are determined, together with an optimal sizing of the number of charging stations and swap batteries. We illustrate our model for short-range flights to and from an European airport and for an electric aircraft designed based on the operational characteristics of a conventional, narrow-body aircraft.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"11 ","pages":"Article 100074"},"PeriodicalIF":2.4,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437622000036/pdfft?md5=9d5517088b6f492cad8228e066b885b1&pid=1-s2.0-S2192437622000036-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91750819","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