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

Optimizing Autonomous Transfer Hub Networks: Quantifying the potential impact of self-driving trucks 优化自动驾驶转运枢纽网络：量化自动驾驶卡车的潜在影响

IF 2.1

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

Chungjae Lee , Kevin Dalmeijer , Pascal Van Hentenryck , Peibo Zhang

{"title":"Optimizing Autonomous Transfer Hub Networks: Quantifying the potential impact of self-driving trucks","authors":"Chungjae Lee , Kevin Dalmeijer , Pascal Van Hentenryck , Peibo Zhang","doi":"10.1016/j.ejtl.2024.100141","DOIUrl":"10.1016/j.ejtl.2024.100141","url":null,"abstract":"<div><p>Autonomous trucks are expected to fundamentally transform the freight transportation industry. In particular, Autonomous Transfer Hub Networks (ATHNs), which combine autonomous trucks on middle miles with human-driven trucks on the first and last miles, are seen as the most likely deployment pathway for this technology. This paper presents a framework to optimize ATHN operations and evaluate the benefits of autonomous trucking. By exploiting the problem structure, this paper introduces a flow-based optimization model for this purpose that can be solved by blackbox solvers in a matter of hours. The resulting framework is easy to apply and enables the data-driven analysis of large-scale systems. The power of this approach is demonstrated on a system that spans all of the United States over a four-week horizon. The case study quantifies the potential impact of autonomous trucking and shows that ATHNs can have significant benefits over traditional transportation networks.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100141"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000165/pdfft?md5=50e7f65a716bd9bab7d80ed2f378b9a5&pid=1-s2.0-S2192437624000165-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141984797","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

Optimization of human-aware logistics and manufacturing systems: A comprehensive review of modeling approaches and applications 优化人性化物流和制造系统：建模方法和应用综述

IF 2.4

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

Thibault Prunet , Nabil Absi , Valeria Borodin , Diego Cattaruzza

{"title":"Optimization of human-aware logistics and manufacturing systems: A comprehensive review of modeling approaches and applications","authors":"Thibault Prunet , Nabil Absi , Valeria Borodin , Diego Cattaruzza","doi":"10.1016/j.ejtl.2024.100136","DOIUrl":"10.1016/j.ejtl.2024.100136","url":null,"abstract":"<div><p>Historically, Operations Research (OR) discipline has mainly been focusing on economic concerns. Since the early 2000s, human considerations are gaining increasing attention, pushed by the growing societal concerns of sustainable development on the same terms as the economic and ecological ones. This paper is the first part of a work that aims at reviewing the efforts dedicated by the OR community to the integration of human factors into logistics and manufacturing systems. A focus is put on the modeling and solution approaches used to consider human characteristics, their practical relevance, and the complexity induced by their integration within optimization models. The material presented in this work has been retrieved through a semi-systematic search of the literature. Then, a comprehensive analysis of the retrieved corpus is carried out to map the related literature by class of problems encountered in logistics and manufacturing. These include warehousing, vehicle routing, scheduling, production planning, and workforce scheduling and management. We investigate the mathematical programming techniques used to integrate human factors into optimization models. Finally, a number of gaps in the literature are identified, and new suggestions on how to suitably integrate human factors in OR problems encountered in logistics and manufacturing systems are discussed.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100136"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000116/pdfft?md5=cab87a5e90f342a5477bd6eb33939078&pid=1-s2.0-S2192437624000116-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141415045","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

Stability metrics for a maritime inventory routing problem under sailing time uncertainty 航行时间不确定情况下的海上库存路由问题的稳定性指标

IF 2.1

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

Homayoun Shaabani , Lars Magnus Hvattum , Gilbert Laporte , Arild Hoff

引用次数: 0

Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework 利用不可行路径切割，在分支切割框架内精确解决具有现实充电功能的电动汽车路由问题

IF 2.4

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

Arne Schulz

{"title":"Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework","authors":"Arne Schulz","doi":"10.1016/j.ejtl.2024.100131","DOIUrl":"10.1016/j.ejtl.2024.100131","url":null,"abstract":"<div><p>The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging function which does not overestimate the real charging function in any point. As the piecewise linear charging function underestimates the real state-of-charge in some points, such an approximation excludes feasible solutions from the solution space. To overcome this drawback we introduce a new method to determine a piecewise linear charging function overestimating the real charging function in a way that the area between both functions is minimized as well as an adaptation of a known linearization to include the piecewise linear charging function in a branch-and-cut approach. Thereby, we include infeasible solutions in the solution space. To declare them infeasible again we check every integer solution obtained in the branch-and-cut procedure and add an infeasible path cut if the solution is infeasible for the real charging function such that the procedure terminates with an optimal solution for the real charging function. Our approach is evaluated in a computational study in which instances with up to 100 customers were solved to optimality. Moreover, we evaluate the trade-off between a more complex model formulation due to more binary variables if the number of supporting points for the piecewise linear approximation is increased and the higher approximation error if fewer supporting points are used.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100131"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000062/pdfft?md5=cf8749400f8456155ab286abfd962725&pid=1-s2.0-S2192437624000062-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140279825","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

Modeling optimal drone fleet size considering stochastic demand 考虑随机需求的最佳无人机机队规模建模

IF 2.4

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

Yuval Hadas , Miguel A. Figliozzi

引用次数: 0

Capacity requirements and demand management strategies in meal delivery 送餐服务的能力要求和需求管理策略

IF 2.4

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

Ramon Auad , Alan Erera , Martin Savelsbergh

{"title":"Capacity requirements and demand management strategies in meal delivery","authors":"Ramon Auad , Alan Erera , Martin Savelsbergh","doi":"10.1016/j.ejtl.2024.100135","DOIUrl":"https://doi.org/10.1016/j.ejtl.2024.100135","url":null,"abstract":"<div><p>Online restaurant aggregators, which connect diners with restaurants and organize the delivery of ordered meals, have experienced significant growth in recent years. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources, i.e., crowdsourced couriers, to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several questions in meal delivery operations focused on matching the correct levels of supply with demand. To ensure excellent customer service, delivery aggregators may, for example, decide to temporarily decrease demand during an operating day by temporarily reducing the delivery area for one or more restaurants. We show that such simple demand restriction strategies allow a significantly smaller fleet to meet service requirements. To simplify analysis, we focus on problem geometries that enable the use of stylized mixed integer programs to optimally deploy a fleet of couriers serving large numbers of orders. Applying the proposed framework to several scenarios with one and two depots, we conduct an extensive experimental study of the effects on system performance of (i) allowing courier sharing between multiple depots, (ii) relaxing the delivery deadlines of placed orders, and (iii) restricting demand through limited adjustment of the coverage of restaurants. The results demonstrate the potential effectiveness of different dispatch control and demand management mechanisms, in terms of both the required courier fleet size to serve requests and the coverage level of orders.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100135"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000104/pdfft?md5=7b42af90e36c255bf6d3147a2b169514&pid=1-s2.0-S2192437624000104-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141423845","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 metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network 道路网络上具有时间窗口、两支车队和同步性的随时间变化的车辆路由问题的元求和方法

IF 2.1

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

Fernando O. Guillen Reyes , Michel Gendreau , Jean-Yves Potvin

{"title":"A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network","authors":"Fernando O. Guillen Reyes , Michel Gendreau , Jean-Yves Potvin","doi":"10.1016/j.ejtl.2024.100143","DOIUrl":"10.1016/j.ejtl.2024.100143","url":null,"abstract":"<div><div>In this work, we extend the time-dependent vehicle routing problem with time windows on a road network by considering two types of vehicles, large and small, to serve customers. Motivated from city logistics applications, large vehicles are forbidden from the downtown area. Accordingly, goods must be transferred from large to small vehicles to serve downtown customers. This leads to synchronization issues at transfer points, which are special locations without storage capacity. The problem is not a pure two-echelon vehicle routing problem, since customers outside of the downtown area can be served directly by large vehicles. The problem is further compounded by the presence of time-dependent travel times that are defined on the arcs of the road network and are used to model congestion periods. To solve this difficult problem, we propose an adaptation of the Slack Induction by String Removals metaheuristic, which is state-of-the-art for the classical capacitated vehicle routing problem. Computational results on a set of test instances with different characteristics empirically demonstrate the optimization capabilities of this new metaheuristic on a problem which is much more complicated than the capacitated vehicle routing problem.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100143"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142357191","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

Dynamic rebalancing for Bike-sharing systems under inventory interval and target predictions 库存间隔和目标预测下的共享单车系统动态再平衡

IF 2.1

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

Jiaqi Liang , Maria Clara Martins Silva , Daniel Aloise , Sanjay Dominik Jena

{"title":"Dynamic rebalancing for Bike-sharing systems under inventory interval and target predictions","authors":"Jiaqi Liang , Maria Clara Martins Silva , Daniel Aloise , Sanjay Dominik Jena","doi":"10.1016/j.ejtl.2024.100147","DOIUrl":"10.1016/j.ejtl.2024.100147","url":null,"abstract":"<div><div>Bike-sharing systems have become a popular transportation alternative. Unfortunately, station networks are often unbalanced, with some stations being empty, while others being congested. Given the complexity of the underlying planning problems to rebalance station inventories via trucks, many mathematical optimizations models have been proposed, mostly focusing on minimizing the unmet demand. This work explores the benefits of two alternative objectives, which minimize the deviation from an inventory interval and a target inventory, respectively. While the concepts of inventory intervals and targets better fit the planning practices of many system operators, they also naturally introduce a buffer into the station inventory, therefore better responding to stochastic demand fluctuations. We report on extensive computational experiments, evaluating the entire pipeline required for an automatized and data-driven rebalancing process: the use of synthetic and real-world data that relies on varying weather conditions, the prediction of demand and the computation of inventory intervals and targets, different reoptimization modes throughout the planning horizon, and an evaluation within a fine-grained simulator. Results allow for unanimous conclusions, indicating that the proposed approaches reduce unmet demand by up to 34% over classical models.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100147"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142723261","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 Two-echelon Vehicle Routing Problem with time-dependent travel times in the city logistics context 城市物流背景下旅行时间随时间变化的双梯队车辆路由问题

IF 2.4

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

Andres Gutierrez , Nacima Labadie , Christian Prins

{"title":"A Two-echelon Vehicle Routing Problem with time-dependent travel times in the city logistics context","authors":"Andres Gutierrez , Nacima Labadie , Christian Prins","doi":"10.1016/j.ejtl.2024.100133","DOIUrl":"10.1016/j.ejtl.2024.100133","url":null,"abstract":"<div><p>The fast rates at which urban population is growing coupled with increasing demands expressed within cities have given rise to challenging freight transportation problems. The Two-echelon Vehicle Routing Problem (2E-VRP) has been proposed as a scheme to tackle city-related problems. To better evaluate its pertinence in large congested city areas, this work addresses a version of the 2E-VRP in which synchronization is required among the two echelons. Besides, it considers time-dependent travel times at both echelons as well as time windows at customers. Other characteristics such as open routes at second echelon offer a degree of flexibility on the efficiency of the distribution specially when dealing with outsourcing schemes. The primary goal is to minimize the number of vehicles. Meanwhile, travel and waiting times, as well as penalties for late deliveries are minimized as a secondary objective. A two-phase metaheuristic approach is proposed to solve the problem on existing benchmarks; as well on a new set of instances based on real information from the city of Bogota, provided by an industrial partner. The experiments prove that including time-dependent travel times is of utmost importance for practical applications.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100133"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000086/pdfft?md5=9da20a806ab020122e8fe343f1024057&pid=1-s2.0-S2192437624000086-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141134354","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

Optimization of human-aware logistics and manufacturing systems: A survey on the Human-Aware Models 人类感知物流和制造系统的优化：人性化模型调查

IF 2.4

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

Thibault Prunet , Nabil Absi , Valeria Borodin , Diego Cattaruzza

{"title":"Optimization of human-aware logistics and manufacturing systems: A survey on the Human-Aware Models","authors":"Thibault Prunet , Nabil Absi , Valeria Borodin , Diego Cattaruzza","doi":"10.1016/j.ejtl.2024.100137","DOIUrl":"10.1016/j.ejtl.2024.100137","url":null,"abstract":"<div><p>Historically, Operations Research (OR) discipline has mainly been focusing on economic concerns. Since the early 2000s, human considerations are gaining increasing attention, pushed by the growing societal concerns of sustainable development on the same terms as the economic and ecological ones. This paper is the second part of a work that aims at reviewing the efforts dedicated by the OR community to the integration of human aspects into logistics and manufacturing systems. A focus is put on the models proposed to represent and quantify human characteristics, their practical relevance, and the complexity induced by their integration with mathematical optimization models. In this paper, the techniques used in the OR literature to represent the human considerations encountered in logistics and manufacturing systems are surveyed. The existing Human-Aware Models (HAM) are classified and reviewed by domain. Particular attention is paid to the field validity of each method, its relevance to specific use cases, the required data collection, and its usability within mathematical optimization models. Since the surveyed HAMs rely on concepts originating from different related scientific disciplines (e.g., ergonomics, occupational medicine), a brief introduction of these fields of study is proposed together with a work of contextualization that is carried out during the analysis.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100137"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000128/pdfft?md5=6e813c91961f8f212db1f930e85abe4f&pid=1-s2.0-S2192437624000128-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141230289","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