Andreas Bärmann , Alexander Martin , Jonasz Staszek
{"title":"A decomposition approach for integrated locomotive scheduling and driver assignment in rail freight transport","authors":"Andreas Bärmann , Alexander Martin , Jonasz Staszek","doi":"10.1016/j.ejtl.2024.100145","DOIUrl":"10.1016/j.ejtl.2024.100145","url":null,"abstract":"<div><div>In this work, we consider the integrated problem of locomotive scheduling and driver assignment in rail freight companies. Our aim is to compute an optimal simultaneous assignment of locomotives and drivers to the trains listed in a given order-book. Mathematically, this leads to the combination of a set-packing problem with compatibility constraints and a multi-commodity-flow problem. We develop a binary-programming formulation to model the given task and improve it by performing a clique-based tightening of the original set-packing inequalities. The objective function of this model makes sure that as many trains as possible are running. To handle the computational complexity of the problem, we introduce a novel decomposition approach which decomposes the problem into a master locomotive scheduling problem and a subproblem for driver assignment. It exploits the fact that the master problem is empirically much easier to solve than the subproblem. For any fixed solution of the master problem, we can use the subproblem to either confirm feasibility of the master solution or to derive valid inequalities from various constraint classes to cut the infeasible master solution off and reiterate. To further improve solution times, we also develop a presolve heuristic. We demonstrate the potential of the presented method by solving a large-scale real-world problem instance provided by our industry partner DB Cargo Polska S.A., as well as a set of derived realistic instances.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100145"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142561283","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":"The role of traffic simulation in shaping effective and sustainable innovative urban delivery interventions","authors":"Yijie Su , Hadi Ghaderi , Hussein Dia","doi":"10.1016/j.ejtl.2024.100130","DOIUrl":"10.1016/j.ejtl.2024.100130","url":null,"abstract":"<div><p>Cities around the globe face major last mile delivery (LMD) challenges as a result of surging online commerce activity, increased parcel delivery demands, lack of parking capacity, and severe traffic congestion particularly in inner city areas. Although a number of innovative solutions and pathways have been proposed to address these challenges, their full impacts are still not well understood due to the lack of comprehensive field studies and real-world data on their performance. Traffic simulation techniques, which are widely used to model and evaluate the impacts of a wide range of urban mobility interventions, offer opportunities to investigate the impacts of city logistics interventions. However, research evidence on this topic remains fragmented, hindering constructive analysis of the role of traffic simulation and modelling in shaping sustainable urban delivery interventions. Given the growing research interest in the nexus of traffic simulation and city logistics, this paper aims to identify and evaluate primary studies related to the simulation forms, evolution, effectiveness, and their feasibility in evaluating the impacts of urban delivery interventions. The paper achieves this through a holistic systematic review that consolidates diverse perspectives on the topic. The paper analysed 79 articles, published by December 2023, that have used traffic simulation to model and evaluate a wide range of city logistics interventions. The review identified five main themes in the literature surrounding development and applications of traffic simulation, namely their use in evaluating the role of information and communication technologies, evaluations of advances in types and forms of delivery vehicles, their application in supporting policy interventions, evaluations of innovations in city logistics facilities and impacts of the collaborative economy. The review also helped in gaining insights about urban delivery interventions and their impacts as stand-alone or in combination with other solutions. The analysis confirms the validity and versatility of traffic simulation as an approach to model the impacts of urban delivery interventions on traffic flow, delivery service and customers, but also the sustainability implications of interventions. The paper also provides a future research agenda to guide future studies in developing and evaluating applications of various interventions with the leverage of traffic simulation.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100130"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000050/pdfft?md5=153f2eeaae2dedbd9d5892150aafc08e&pid=1-s2.0-S2192437624000050-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140125317","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":"Bundles generation and pricing in crowdshipping","authors":"Giusy Macrina , Claudia Archetti , Francesca Guerriero","doi":"10.1016/j.ejtl.2024.100142","DOIUrl":"10.1016/j.ejtl.2024.100142","url":null,"abstract":"<div><p>Crowdshipping is a new delivery paradigm that exploits the capacity of ordinary people who offer their own vehicles and free time to perform deliveries against compensation. In this work, we consider a peer-to-peer logistic platform where a company receives orders from its customers and assigns them to occasional drivers (ODs), or crowdshippers, who perform the delivery operations. We first investigate the problem of deciding how the orders should be partitioned into bundles, where a bundle is a set of orders assigned to the same OD. Then, we focus on the problem of determining the compensation associated with each bundle, with the purpose of minimizing the total delivery costs. The pricing scheme is based on the assumption that each OD is associated with a <em>willingness-to-serve</em> function, which is modeled as a random variable that gives the probability that the OD accepts to deliver the bundle given the compensation value. This random variable captures the estimation of the <em>willingness-to-serve</em> function that the company has elaborated, for example on the basis of historical data. If the compensation offered by the company is greater than or equal to the <em>willingness-to-serve</em> value, the OD performs the delivery, otherwise she/he refuses. In case no OD is available to deliver a bundle, then all packages in the bundle are offered to a third-party delivery company. We simulate two auction systems for the assignment of bundles to ODs: a static and a dynamic auction. In exhaustive simulation tests, we compare different pricing schemes as well as the two auction systems, and outline several managerial insights.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100142"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000177/pdfft?md5=c5cefe6620309fb3b6c6fb0260aced5a&pid=1-s2.0-S2192437624000177-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142021465","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 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}
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}
Homayoun Shaabani , Lars Magnus Hvattum , Gilbert Laporte , Arild Hoff
{"title":"Stability metrics for a maritime inventory routing problem under sailing time uncertainty","authors":"Homayoun Shaabani , Lars Magnus Hvattum , Gilbert Laporte , Arild Hoff","doi":"10.1016/j.ejtl.2024.100146","DOIUrl":"10.1016/j.ejtl.2024.100146","url":null,"abstract":"<div><div>We study a multi-product maritime inventory routing problem (MIRP) with sailing time uncertainty. We explicitly consider the replanning that happens after uncertainty is revealed. The objective is to determine the stability of the adjusted plans after the occurrence of an uncertain event and to evaluate the effect of incorporating different stability metrics in the rescheduling process. Five stability metrics are introduced, and mathematical formulations of the MIRP incorporating each metric are presented. A reoptimization framework is then used to analyze the impact of each stability metric. Calculations are performed using 360 instances. The main result is that adjustments to the original plan occur at no additional cost almost 50% of the time. If decision makers want a more stable plan, they should accept a 5% cost deterioration, resulting in 20% more stable solutions.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100146"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142425625","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":"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}
{"title":"Modeling optimal drone fleet size considering stochastic demand","authors":"Yuval Hadas , Miguel A. Figliozzi","doi":"10.1016/j.ejtl.2024.100127","DOIUrl":"https://doi.org/10.1016/j.ejtl.2024.100127","url":null,"abstract":"<div><p>The last mile delivery is particularly challenging for stochastic deliveries with narrow time windows. This topic is timely due to the rise of e-commerce and courier type services and the impacts of fleet size and vehicle type on delivery costs. A novel contribution of this research is to provide an optimization approach, extending the newsvendor model, to provide an optimal drone fleet sizing solution with stochastic demand in terms of number of deliveries and deliveries weight or payload from one central depot. The solutions obtained are robust, as shown in a comprehensive sensitivity analysis.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100127"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000025/pdfft?md5=6d30acb57ad7b3327b4e21a0e63766ce&pid=1-s2.0-S2192437624000025-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140295925","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":"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}
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}