EURO Journal on Transportation and Logistics最新文献

{"title":"Computing all shortest passenger routes with a tropical Dijkstra algorithm","authors":"Berenike Masing ,&nbsp;Niels Lindner,&nbsp;Enrico Bortoletto","doi":"10.1016/j.ejtl.2025.100163","DOIUrl":"10.1016/j.ejtl.2025.100163","url":null,"abstract":"<div><div>Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question leads to shortest path problems on graphs with interval costs on their arcs and is closely linked to multi-objective optimisation. We introduce a Dijkstra algorithm based on polynomials over the tropical semiring that computes complete or minimal sets of efficient paths. We demonstrate that this approach is computationally feasible by employing it on the public transport network of the city of Wuppertal and instances of the benchmarking set <span>TimPassLib</span>, and we evaluate the resulting sets of passenger routes.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100163"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144932198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"50 years of OR in railway timetabling and rolling stock planning","authors":"Pedro José Correia Duarte ,&nbsp;Stéphane Dauzère-Pérès ,&nbsp;Dennis Huisman ,&nbsp;Carlo Mannino ,&nbsp;Giorgio Sartor ,&nbsp;Norman Weik ,&nbsp;Philipp Widmann","doi":"10.1016/j.ejtl.2025.100155","DOIUrl":"10.1016/j.ejtl.2025.100155","url":null,"abstract":"<div><div>This survey paper discusses the literature on Operations Research (OR) models and algorithms for railway planning in the last decades. Since infrastructure and rolling stock are two resources that are both very capital-intensive and characterize the railway system, we focus on timetabling and rolling stock planning problems. For timetabling, we also classify the literature among two dimensions, namely the decision level (strategic, tactical, operational) and the type of network infrastructure (dependent routes, independent routes). We also discuss robustness aspects in both planning problems.</div><div>We focus the discussion of the literature on the applicability of the models in the European context, where different types of trains (high-speed passenger trains, high-frequent suburban trains and freight trains) often share the same tracks and the organization of the railways is usually split between an infrastructure manager and one or more railway undertakings operating the trains.</div><div>We conclude the paper with some challenges and future research directions.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100155"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143578362","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 general modeling and simulation framework for dynamic vehicle routing","authors":"Markó Horváth ,&nbsp;Tímea Tamási","doi":"10.1016/j.ejtl.2025.100159","DOIUrl":"10.1016/j.ejtl.2025.100159","url":null,"abstract":"<div><div>In dynamic vehicle routing problems (DVRPs), some part of the information is revealed or changed on the fly, and the decision maker has the opportunity to re-plan the vehicle routes during their execution, reflecting on the changes. Accordingly, the solution to a DVRP is a flexible policy rather than a set of fixed routes. A policy is a problem-specific algorithm that is invoked at various decision points in the planning horizon and returns a decision according to the current state. Since DVRPs involve dynamic decision making, a simulator is an essential tool for dynamically testing and evaluating the policies. Despite this, there are few tools available that are specifically designed for this purpose. To fill this gap, we have developed a simulation framework that is suitable for a wide range of dynamic vehicle routing problems and allows to dynamically test different policies for the given problem. In this paper, we present the background of this simulation tool, for which we proposed a general modeling framework suitable for formalizing DVRPs independently of simulation purposes. Our open source simulation tool is already available, easy to use, and easily customizable, making it a useful tool for the research community.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100159"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143936712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"50 years of Operations Research in public transport","authors":"Oded Cats ,&nbsp;Konstantinos Gkiotsalitis ,&nbsp;Anita Schöbel","doi":"10.1016/j.ejtl.2025.100160","DOIUrl":"10.1016/j.ejtl.2025.100160","url":null,"abstract":"<div><div>The planning and operations of public transport has benefited from the development and application of Operations Research (OR) techniques in the past half a century. In this article, we describe OR-related techniques and applications in the public transport domain in the last 50 years (1975–2025) since the origin of the intersection of these two research fields. Following a brief description of the public transport planning process, we outline how different topics, models, and solution approaches have evolved throughout this period. For each topic – varying from network assignment, line planning and crew scheduling to real-time management and demand-responsive transport – we review seminal works, key approaches and developments as well as comment on the applicability thereof and recent trends. In addition, we identify primary cross-cutting themes of research: integrating different planning stages, system resilience, dealing with uncertainties and energy-efficient public transport, as well as pricing and equity considerations. Moreover, reinforcement learning and quantum computing are expected to play an increasingly important role in OR applications in public transport. In the next half a century OR in public transport will undoubtedly continue to evolve in response to the technical developments in the transport sector, the developments in algorithms, software and hardware for computing, and by the challenges society faces.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100160"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144338705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A decomposition approach for integrated locomotive scheduling and driver assignment in rail freight transport","authors":"Andreas Bärmann ,&nbsp;Alexander Martin ,&nbsp;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 ,&nbsp;Hadi Ghaderi ,&nbsp;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 ,&nbsp;Claudia Archetti ,&nbsp;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":"Optimizing Autonomous Transfer Hub Networks: Quantifying the potential impact of self-driving trucks","authors":"Chungjae Lee ,&nbsp;Kevin Dalmeijer ,&nbsp;Pascal Van Hentenryck ,&nbsp;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}

{"title":"Optimization of human-aware logistics and manufacturing systems: A comprehensive review of modeling approaches and applications","authors":"Thibault Prunet ,&nbsp;Nabil Absi ,&nbsp;Valeria Borodin ,&nbsp;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}

{"title":"Stability metrics for a maritime inventory routing problem under sailing time uncertainty","authors":"Homayoun Shaabani ,&nbsp;Lars Magnus Hvattum ,&nbsp;Gilbert Laporte ,&nbsp;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}