EURO Journal on Transportation and Logistics最新文献

{"title":"Capacity requirements and demand management strategies in meal delivery","authors":"Ramon Auad ,&nbsp;Alan Erera ,&nbsp;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}

{"title":"A Two-echelon Vehicle Routing Problem with time-dependent travel times in the city logistics context","authors":"Andres Gutierrez ,&nbsp;Nacima Labadie ,&nbsp;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}

{"title":"Optimization of human-aware logistics and manufacturing systems: A survey on the Human-Aware Models","authors":"Thibault Prunet ,&nbsp;Nabil Absi ,&nbsp;Valeria Borodin ,&nbsp;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}

{"title":"Dynamic rebalancing for Bike-sharing systems under inventory interval and target predictions","authors":"Jiaqi Liang ,&nbsp;Maria Clara Martins Silva ,&nbsp;Daniel Aloise ,&nbsp;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}

{"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 ,&nbsp;Michel Gendreau ,&nbsp;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}

{"title":"Optimization of bike-sharing repositioning operations: A reactive real-time approach","authors":"Enrique Jiménez-Meroño,&nbsp;Francesc Soriguera","doi":"10.1016/j.ejtl.2024.100138","DOIUrl":"10.1016/j.ejtl.2024.100138","url":null,"abstract":"<div><p>One of the critical issues in the operation of vehicle-sharing systems is the optimization of the fleet repositioning movements. Repositioning implies the artificial movement of vehicles from places where they accumulate to others in which they are scarce. This yields a higher vehicle availability, without over dimensioning the vehicle fleet and while increasing the vehicle utilization rates. In the particular case of bike-sharing systems, repositioning implies to deploy a fleet of small trucks or vans able to move groups of bicycles from one location to another, with the purpose of maximizing the users’ level of service while minimizing the operating agency costs. This repositioning optimization problem has been previously addressed in the operations research field through Mixed Integer Programing (MIP) and its variants, generally facing two limitations. First, its high computational cost, which prevents achieving direct solutions in realistically large systems. So, it has been necessary to develop heuristics and approximations. And second, its reliance and sensitivity to demand forecasts, with its inherent level of uncertainty. Aiming to overcome these weaknesses, this paper presents a strategy based on a real-time pairwise assignment between repositioning trucks and tasks, in order to optimize the bike-sharing repositioning operations. The proposed method is conceptually simple, less dependent on demand predictions, easily implementable in any coding language and applicable to large systems at a low computational cost. These properties make the method appealing to address the repositioning task assignment in any vehicle-sharing system. On a simulated case study, based on <em>Bicing,</em> the bicycle-sharing system in Barcelona, the proposed strategy has been implemented and compared to the MIP-based routing approach. Results show that the proposed real-time pairwise assignment method is able to significantly improve the performance of the repositioning operations, especially in scenarios where the demand forecast is not accurate. Being based on real-time information, the proposed strategy is flexible enough to solve unpredictable situations. So, the proposed strategy can be implemented as an alternative to MIP-based solutions, or as a complementary strategy for dynamic real-time adaptation of static long-term solutions.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100138"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S219243762400013X/pdfft?md5=3ad1ea7433351575202703da8c7b9a44&pid=1-s2.0-S219243762400013X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141711860","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}

{"title":"A two-stage stochastic programming model for bike-sharing systems with rebalancing","authors":"Rossana Cavagnini ,&nbsp;Francesca Maggioni ,&nbsp;Luca Bertazzi ,&nbsp;Mike Hewitt","doi":"10.1016/j.ejtl.2024.100140","DOIUrl":"10.1016/j.ejtl.2024.100140","url":null,"abstract":"<div><p>We study the problem of determining the target inventory level of stations in a bike-sharing system, when bikes can be rebalanced later during the day. We propose a two-stage stochastic programming formulation, where the target inventory decisions are made at the first stage, while the recourse decisions, related to rebalancing, are made at the second stage. In the literature, the problem of determining the target inventory levels is solved without taking into account the rebalancing problem, or these two problems are solved sequentially. We prove that more efficient bike-sharing systems can be obtained by integrating these two problems. Moreover, we show that our methodology provides better results than the deterministic formulation, and consider an effective matheuristic, based on the solution of the deterministic problem, to solve the stochastic program. Finally, we compare the solutions obtained by our approach with the actual allocation of bikes in the real bike-sharing system of the city of San Francisco. The results show the effectiveness of our approach also in a realistic setting.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100140"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000153/pdfft?md5=2d853fa47dc629567d272625e907f0ca&pid=1-s2.0-S2192437624000153-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141848648","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}

{"title":"Price optimal routing in public transportation","authors":"Ricardo Euler,&nbsp;Niels Lindner,&nbsp;Ralf Borndörfer","doi":"10.1016/j.ejtl.2024.100128","DOIUrl":"https://doi.org/10.1016/j.ejtl.2024.100128","url":null,"abstract":"<div><p>We consider the <em>price-optimal earliest arrival problem</em> in public transit (POEAP) in which we aim to calculate the Pareto-set of journeys with respect to ticket price and arrival time in a public transportation network. Public transit fare structures are often a combination of various fare strategies such as, e.g., distance-based fares, zone-based fares or flat fares. The rules that determine the actual ticket price are often very complex. Accordingly, fare structures are notoriously difficult to model, as it is in general not sufficient to simply assign costs to arcs in a routing graph. Research into POEAP is scarce and usually either relies on heuristics or only considers restrictive fare models that are too limited to cover the full scope of most real-world applications. We therefore introduce <em>conditional fare networks</em> (CFNs), the first framework for representing a large number of real-world fare structures. We show that by relaxing label domination criteria, CFNs can be used as a building block in label-setting multi-objective shortest path algorithms. By the nature of their extensive modeling capabilities, optimizing over CFNs is NP-hard. However, we demonstrate that adapting the multi-criteria RAPTOR (McRAP) algorithm for CFNs yields an algorithm capable of solving POEAP to optimality in less than 400 ms on average on a real-world dataset. By restricting the size of the Pareto-set, running times are further reduced to below 10 ms.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100128"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000037/pdfft?md5=08dea96f25a74fd4b5d9a072b3170c46&pid=1-s2.0-S2192437624000037-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139743773","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}

{"title":"Spatio-temporal prediction of freeway congestion patterns using discrete choice methods","authors":"Barbara Metzger ,&nbsp;Allister Loder ,&nbsp;Lisa Kessler ,&nbsp;Klaus Bogenberger","doi":"10.1016/j.ejtl.2024.100144","DOIUrl":"10.1016/j.ejtl.2024.100144","url":null,"abstract":"<div><div>Predicting freeway traffic states is, so far, based on predicting speeds or traffic volumes with various methodological approaches ranging from statistical modeling to deep learning. Traffic on freeways, however, follows specific patterns in space–time, such as stop-and-go waves or mega jams. These patterns are informative because they propagate in space–time in different ways, e.g., stop and go waves exhibit a typical propagation that can range far ahead in time. If these patterns and their propagation become predictable, this information can improve and enrich traffic state prediction. In this paper, we use a rich data set of congestion patterns on the A9 freeway in Germany near Munich to develop a mixed logit model to predict the probability and then spatio-temporally map the congestion patterns by analyzing the results. As explanatory variables, we use variables characterizing the layout of the freeway and variables describing the presence of previous congestion patterns. We find that a mixed logit model significantly improves the prediction of congestion patterns compared to the prediction of congestion with the average presence of the patterns at a given location or time.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100144"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142318957","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}

{"title":"Inbound traffic capture link-design problem independent of assumptions on users’ route choices","authors":"Ruri Sase,&nbsp;Satoshi Sugiura","doi":"10.1016/j.ejtl.2024.100129","DOIUrl":"10.1016/j.ejtl.2024.100129","url":null,"abstract":"<div><p>In some traffic management situations, a cordon (a set of points at which traffic flows into a given area) is set in a road network to establish a reference for the location of equipment to implement traffic measurements and controls (e.g., traffic volume surveys and congestion charging). However, few studies have focused on the optimum location of a cordon. We devise a problem denoted the inbound traffic capture link-design problem to select the optimum combination of links for inclusion in a cordon. We regard this combination as the minimum number of links that can capture traffic on all routes, under the condition that there is a path between nodes inside the cordon that is not captured. We formulate this model by employing the graph theory concept of the minimum cut, and use the concept of a Steiner tree with auxiliary network flows to express the constraint of ensuring that there is an uncaptured path inside a cordon. After a basic formulation, to obtain an identical cordon, we devise two subsidiary schemes. In addition, we perform a linear relaxation of our method to reduce its computational cost. The results of computational experiments confirm that our model selects the optimal cordon location formed by a combination of capturing links and also outputs an identical cordon as a boundary line of an area. As the model is computationally feasible, even when applied on a large network, we believe it will have a wide range of practical applications.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100129"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000049/pdfft?md5=866665da189a823971e4352d9086ca33&pid=1-s2.0-S2192437624000049-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139815567","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}