EURO Journal on Transportation and Logistics最新文献

{"title":"On the development and analysis of a comprehensive police patrolling model","authors":"Fatemeh Mousapour,&nbsp;Rajan Batta,&nbsp;Jose L. Walteros","doi":"10.1016/j.ejtl.2025.100153","DOIUrl":"10.1016/j.ejtl.2025.100153","url":null,"abstract":"<div><div>Police patrolling is a combination of <em>proactive</em> and <em>reactive</em> tasks. The initial focus is on the development and analysis of a deterministic model which has <em>proactive</em> patrolling tasks consisting of <em>hot spot</em> and <em>general</em> patrolling duties. Two different formulations are developed to address the problem: a compact arc-based and an extensive path-based formulation embedded in a column generation procedure. These formulations incorporate three metrics of efficiency and fairness: density, equity, and dispersion. Our model has discrete time steps and seeks to make a balance between <em>hot spot</em> and <em>general</em> patrolling duties by defining details of patrolling routes. The model allows a patrol unit to be at a hot spot for multiple consecutive time steps, thereby allowing foot patrolling to be used at a hot spot. We embed the deterministic model in a simulation environment for the purpose of defining <em>proactive</em> patrolling routes while responding to the calls for service. Numerical experiments are conducted to (a) evaluate the computational efficiency of the proposed methods, and (b) explore sensitivity analysis with respect to key parameters. A crime-data based case study is developed to illustrate the utility of the models and methods in a practical situation.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100153"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143104239","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 commodity constrained split delivery vehicle routing problem considering carbon emission: Formulations and a branch-and-cut method","authors":"Kamyla Maria Ferreira ,&nbsp;Claudia Archetti ,&nbsp;Diego Delle Donne ,&nbsp;Reinaldo Morabito ,&nbsp;Pedro Munari","doi":"10.1016/j.ejtl.2025.100154","DOIUrl":"10.1016/j.ejtl.2025.100154","url":null,"abstract":"<div><div>This paper introduces the Green Commodity constrained Split Delivery Vehicle Routing Problem (GC-SDVRP), which involves designing efficient and environmentally friendly delivery routes that reduce the CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> emissions associated with transporting multiple commodities. In this problem, different commodities demanded by a customer can be delivered by one or more vehicles, if beneficial, which poses additional modeling and solution challenges. We propose a relaxed formulation that provides a lower bound on the optimal value of the GC-SDVRP, and adapt two other formulations from the literature to address this problem. Additionally, we develop a branch-and-cut (BC) method based on two of these formulations, and introduce a procedure for deriving feasible solutions to the GC-SDVRP from solutions obtained with the relaxed formulations. The results of computational experiments performed on benchmark instances indicate the superior performance of the BC method based on the proposed formulation. Furthermore, they show that, contrary to the traditional objective of minimizing distance, the GC-SDVRP is significantly easier to solve to optimality and can reduce CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> emissions by 2.59% compared to the problem that minimizes total travel distance. Our investigation also reveals that increasing vehicle capacity improves solution quality in the GC-SDVRP, while split delivery can enable further reductions in CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> emissions. Finally, although increasing the number of commodities imposes challenges in solving the problem, the possibility of split delivery mitigates its impact on the value of the final solution, indicating that an increase in the number of commodities does not necessarily result in higher CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> emissions.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100154"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143488411","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":"Optimal scheduling and motion planning of automated vehicles at intersections","authors":"Federico Gallo,&nbsp;Alessandra Miagostovich,&nbsp;Davide Giglio,&nbsp;Angela Di Febbraro,&nbsp;Nicola Sacco","doi":"10.1016/j.ejtl.2025.100158","DOIUrl":"10.1016/j.ejtl.2025.100158","url":null,"abstract":"<div><div>The ever-growing diffusion of automation in road transport and the spreading of communication technologies applied to road infrastructures toward so-called <em>smart roads</em> is leading to a need for coordination methods for automated vehicles, to fully exploit the potentialities of such technologies to make road transport more efficient, safer, and greener.</div><div>This study focuses on these issues, particularly determining the optimal scheduling and speeds of automated vehicles to cross intersections safely, without stopping and without the need for a traffic signal. To accomplish this, the problem is formulated as a mixed-integer linear programming (MILP) optimization problem for a generic intersection characterized by an arbitrary number of road segments and lanes. In addition, a discussion of the properties of the problem solutions, an application of the proposed approach to a case study, a solution strategy that can be used to solve large problem instances in a reasonable time, and a sensitivity analysis of the primary model parameters are provided. The considered case study shows that the proposed model can effectively avoid vehicle conflicts and increase the intersection capacity up to double with respect to both first-come first-served control policy and signalized intersections.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100158"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144155006","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":"Solving the line planning problem with service-levels using a column generation-based heuristic algorithm","authors":"Hector Gatt ,&nbsp;Jean-Marie Freche ,&nbsp;Fabien Lehuédé ,&nbsp;Thomas G. Yeung","doi":"10.1016/j.ejtl.2025.100164","DOIUrl":"10.1016/j.ejtl.2025.100164","url":null,"abstract":"<div><div>This research investigates the strategic design of bus line networks by incorporating the operational objectives and constraints relevant to network operators. Drawing on industry expertise from a public transportation software company, we formulate the problem as a line planning optimization problem aimed at minimizing network operating costs while simultaneously addressing two critical service quality metrics: the deviation between passengers’ actual travel times and their respective shortest-path travel times, and the proportion of passengers completing trips without transfers. To address problem instances of realistic scale and complexity, we develop and implement a column generation heuristic framework wherein both bus lines and passenger routing paths are generated dynamically throughout the solution process. Our methodological approach combines column generation and column enumeration algorithms, demonstrating computational efficiency when evaluated against established benchmark instances. Furthermore, we present a comprehensive case study examining a medium-sized French municipality, through which we demonstrate the practical integration of real-world design principles within our optimization framework. This empirical analysis yields novel insights regarding the sensitivity of both our proposed parameters and commonly employed parameters in bus network design literature.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100164"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145219476","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":"Stop plan optimisation for three-pattern skip-stop schemes for urban rail transit systems","authors":"Somporn Sahachaiseree ,&nbsp;Mohammad Sadrani ,&nbsp;Constantinos Antoniou","doi":"10.1016/j.ejtl.2024.100149","DOIUrl":"10.1016/j.ejtl.2024.100149","url":null,"abstract":"<div><div>Mass rapid transit systems around the world are typically designed for all-stop operation schemes, in which train overtaking is not possible. To accelerate transit operation, the conventional A/B skip-stop scheme may be planned. This research explores alternative skip-stop schemes with three stop patterns, aiming to better match transit services with the spatial distribution of travel demand. The proposed generalised skip-stop operation model considers both the total cost of passengers and operator. A genetic algorithm is employed to solve the stop-plan optimisation problem, and a heuristic is tailored to determine an optimal dispatch headway for the respective stop plan. Based on computational experiments using synthetic data, the results suggest that skip-stop schemes have the potential to reduce total time costs by about 10%, particularly when there are structured demand concentrations, transit systems can operate safely with low time headway and short-distance demand is low. Although the total-cost saving of the best A/B skip-stop plan found is generally superior to those of other three-pattern skip-stop schemes, a three-pattern skip-stop scheme was found to offer a better total-cost saving in a scenario without short-distance travel demands. Overall, this research offers valuable insights into the potential benefits and limitations of different skip-stop schemes, contributing to a better understanding of their impact on passengers and operators.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100149"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143103819","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":"Accelerating the electric vehicle revolution: Policy implications of charging subsidies and green taxes","authors":"Sanchari Guha Niyogi","doi":"10.1016/j.ejtl.2025.100152","DOIUrl":"10.1016/j.ejtl.2025.100152","url":null,"abstract":"<div><div>Electric vehicles (EVs) are central to global efforts to reduce transportation emissions, yet limited charging infrastructure remains a primary barrier to widespread adoption. Governments worldwide have implemented various subsidies for EV purchasers and manufacturers, alongside green tax schemes, to incentivise infrastructure expansion and boost EV uptake. This research explores the efficacy of policy combinations — specifically purchase-based or per-station subsidies and green taxes — in a duopolistic market setting. By employing a game-theoretic model comprising profit-maximising EV and gasoline vehicle (GV) manufacturers, a population of utility-maximising consumers, and a social welfare-maximising government, we observe that a purchase-based subsidy in combination with a green tax provides a win–win–win outcome for the government and the manufacturers. Incorporating consumers’ EV-related anxieties, our analysis suggests that a green tax, either on its own or combined with subsidies, is the most effective policy for governments aiming to maximise social welfare. In markets characterised by diverse and sometimes misinformed consumers, a policy mix of green taxes and charging subsidies proves especially beneficial when the environmental impact of EV adoption is substantial. Additionally, when accounting for network effects, which could result in congested charging stations, pairing consumer subsidies with a green tax emerges as the preferential policy. Manufacturers and policymakers are provided with multifaceted insights that aid in conceptualising electric mobility.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100152"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422715","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":"Optimal departure time choices as quantiles and expectiles of the travel time distribution","authors":"Maria Osipenko","doi":"10.1016/j.ejtl.2025.100162","DOIUrl":"10.1016/j.ejtl.2025.100162","url":null,"abstract":"<div><div>We consider two alternative preference specifications for optimal departure time choices: the classical asymmetric linear loss for early and late delays, and a new specification based on asymmetric quadratic loss. We demonstrate that the resulting optimal choices correspond to the tail indices of the travel time distribution—quantiles for the asymmetric linear specification and expectiles for the asymmetric quadratic specification. Additionally, we establish a correspondence between the choices induced by these two utility specifications, showing that the asymmetric quadratic preference class is a valid alternative with favorable properties, as demonstrated through examples and applications. For both utility specifications, we derive travel time reliability ratios and present a straightforward computation method using the concepts of <span><math><mi>τ</mi></math></span>-deviation and <span><math><mi>τ</mi></math></span>-variance. Moreover, we test both specifications using departure time choice data, finding that the quadratic loss specification more accurately represents actual departure time choices. Finally, using Montreal travel time data for two alternative routes, we fit a mixture of gamma distributions and compare the behavior of the optimal departure time choices and travel time reliability ratio curves induced by the different utility specifications.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100162"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144879351","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":"Design tasks and their complexity for the European Train Control System with Hybrid Train Detection","authors":"Stefan Engels ,&nbsp;Tom Peham ,&nbsp;Judith Przigoda ,&nbsp;Nils Przigoda ,&nbsp;Robert Wille","doi":"10.1016/j.ejtl.2025.100161","DOIUrl":"10.1016/j.ejtl.2025.100161","url":null,"abstract":"<div><div>Railway networks have become increasingly important in recent times, especially in moving freight and public transportation from road traffic and planes to more environmentally friendly trains. Since expanding the global railway network is time- and resource-consuming, maximizing the rail capacity of the existing infrastructure is desirable. However, simply running more trains is infeasible as certain constraints enforced by the train control system must be satisfied. The capacity of a network depends (amongst others) on the distance between trains allowed by this safety system. While most signaling systems rely on fixed blocks defined by costly hardware, new specifications provided by Level 2 with Hybrid Train Detection of the European Train Control System (ETCS L2 HTD), formerly known as ETCS Hybrid Level 3, allow the usage of virtual subsections. This additional degree of freedom allows for shorter train following times and, thus, more trains on existing railway tracks. On the other hand, new design tasks arise on which automated methods might be helpful for designers of modern railway networks. However, although first approaches exist that solve design problems arising within ETCS L2 HTD, neither formal descriptions nor results on the computational complexity of the corresponding design tasks exist. In this paper, we fill this gap by providing a formal description of design tasks for ETCS L2 HTD and proof that these tasks are NP-complete or NP-hard, respectively. By that, we are providing a solid basis for the future development of methods to solve those tasks, which will be integrated into the <em>Munich Train Control Toolkit</em> available open-source on GitHub at <span><span>https://github.com/cda-tum/mtct</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100161"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144548727","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 for the tactical planning of consolidation-based freight transportation","authors":"Teodor Gabriel Crainic,&nbsp;Walter Rei","doi":"10.1016/j.ejtl.2025.100157","DOIUrl":"10.1016/j.ejtl.2025.100157","url":null,"abstract":"<div><div>Consolidation-based freight transportation supports a large and valuable part of world trade, over short, medium, long, and intercontinental distances, which all societies depend on and thrive on. It is carried out by carriers that supply the resources and services that meet the demands expressed by shippers. Consolidation aims at increased operational and economic efficiency, by combining cargo of different shippers into the same loading units for their complete or partial journeys. The scope of this paper is consolidation-based freight transport and the tactical planning challenges faced by carriers, who need to design a set of scheduled services that profitably and efficiently align the allocation of resources with anticipated shipping needs over a medium to long-term horizon. The tactical plan then guides day-to-day operations and informs strategic decisions. Building it represents a very complex problem, however, that requires powerful decision-support tools. Operations Research, O.R., has a long and rich history of fruitful interactions with the decision-making and planning of freight transportation, leading to significant methodological developments and delivering high-quality solutions within the necessary decision-making time frames. The paper focuses on this history, emphasizing the developments in Service Network Design, SND, the primary O.R. methodology proposed to address the challenges of tactical planning problems pertinent to consolidation-based freight transportation systems. The paper is structured to explore key dimensions in the inherent complexity of carrier tactical planning and the SND innovations developed to address them. These dimensions include the explicit consideration of temporal aspects of system elements and dynamics; integrative decision making, particularly in managing the resources carriers require to support their services and operations; and accounting for the uncertainty that directly impacts the planning of consolidation-based freight transportation systems. The paper offers insights into the main developments over the last 50 years and identifies promising research avenues.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100157"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144089439","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 behavioral models for transportation and logistics","authors":"Léa Ricard,&nbsp;Michel Bierlaire","doi":"10.1016/j.ejtl.2025.100156","DOIUrl":"10.1016/j.ejtl.2025.100156","url":null,"abstract":"<div><div>Fifty years ago, transportation and logistics problems were primarily analyzed either from a supply-side or a demand-side perspective, with the fields of operations research and demand modeling evolving separately. Since then, there has been a growing interest in behavioral optimization models, aiming to integrate both supply and demand aspects. The purpose of this survey is to offer a historical perspective on the evolution of behavioral optimization models in transportation and logistics. It does so by delving into significant works in demand modeling and choice-based optimization, highlighting their interconnections. In particular, we focus on three important optimization applications, namely the facility location problem, the airline scheduling and fleet assignment problem, and the urban transportation planning problem. Additionally, we identify potential avenues for future research to bridge existing gaps in the literature and promote behavioral models in transportation and logistics.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100156"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143739186","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}