EURO Journal on Transportation and Logistics最新文献

Where and when does demand-responsive transport work best? A parametric analysis using agent-based modelling 按需运输在何时何地最有效？使用基于代理的建模进行参数化分析

IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-12-22 DOI: 10.1016/j.ejtl.2025.100173

Giovanni Calabrò , Michela Le Pira , Giuseppe Inturri

Demand-Responsive Transport (DRT) presents significant potential to address the inefficiencies of conventional public transport, particularly in low-demand areas where conventional fixed-route services struggle with poor cost-efficiency and coverage. This study develops a unified agent-based modelling (ABM) framework to evaluate DRT performance across different urban contexts, addressing the lack of systematic evaluation tools for context-specific service design. The research introduces a novel parametric ABM integrating a comprehensive real-time matching algorithm that balances passenger utility and operator costs through a composite cost function. Unlike existing approaches, the model incorporates passenger walking behaviour, automatically adjusting service flexibility based on demand intensity whilst enabling systematic comparison across diverse operational scenarios. Three representative contexts are evaluated: small cities (many-to-many demand), large cities during off-peak periods (lower spatial demand density due to expanded service areas), and suburban feeder services (directional many-to-one patterns). Each scenario is analysed across fleet sizes (2–40 vehicles) and demand rates (10–200 requests/hour), with performance assessed through integrated passenger, operator, and economic indicators. Results demonstrate that DRT performance is fundamentally context-dependent. Suburban feeder services emerge as the optimal application, achieving total unit costs of 4–6 € per passenger and requiring minimal fleet investments (4–6 vehicles), representing 40–60 % cost advantages over urban scenarios. Small city operations achieve viable performance with moderate resources (8–12 vehicles, 6–8 €/pax), whilst large city deployments require substantial commitments (16–28 vehicles, 10–18 €/pax). The analysis reveals critical minimum viable fleet thresholds scaling proportionally with urban complexity, with capital investment ratios of 1:2:4 across scenarios, and confirming that spatial density fundamentally determines DRT viability. The findings provide evidence-based guidance for transport authorities, positioning suburban feeder applications as optimal entry points for DRT implementation.

需求响应交通（DRT）具有解决传统公共交通效率低下问题的巨大潜力，特别是在需求低的地区，传统固定路线服务的成本效益和覆盖范围都很低。本研究开发了一个统一的基于智能体的建模（ABM）框架来评估不同城市背景下的DRT绩效，解决了针对特定背景的服务设计缺乏系统评估工具的问题。该研究引入了一种新的参数ABM，该ABM集成了一种综合实时匹配算法，通过复合成本函数平衡乘客效用和运营商成本。与现有的方法不同，该模型结合了乘客的步行行为，根据需求强度自动调整服务灵活性，同时能够在不同的运营场景中进行系统比较。本文评估了三种具有代表性的情景：小城市（多对多需求）、非高峰时期的大城市（由于服务区域扩大，空间需求密度降低）和郊区支线服务（定向多对一模式）。每一种场景都会根据车队规模（2-40辆车）和需求率（10-200个请求/小时）进行分析，并通过综合乘客、运营商和经济指标来评估绩效。结果表明，DRT的性能基本上是上下文相关的。郊区支线服务成为最佳应用，每位乘客的总单位成本为4-6欧元，并且需要最少的车队投资（4-6辆车），比城市方案具有40 - 60%的成本优势。小城市的运营需要适度的资源（8-12辆车，6-8欧元/人），而大城市的部署需要大量的投入（16-28辆车，10-18欧元/人）。分析显示，最小可行车队临界阈值与城市复杂性成正比，不同场景下的资本投资比例为1:2:4，并证实空间密度从根本上决定了DRT的可行性。研究结果为交通管理部门提供了基于证据的指导，将郊区支线应用定位为实施DRT的最佳切入点。

{"title":"Where and when does demand-responsive transport work best? A parametric analysis using agent-based modelling","authors":"Giovanni Calabrò , Michela Le Pira , Giuseppe Inturri","doi":"10.1016/j.ejtl.2025.100173","DOIUrl":"10.1016/j.ejtl.2025.100173","url":null,"abstract":"<div><div>Demand-Responsive Transport (DRT) presents significant potential to address the inefficiencies of conventional public transport, particularly in low-demand areas where conventional fixed-route services struggle with poor cost-efficiency and coverage. This study develops a unified agent-based modelling (ABM) framework to evaluate DRT performance across different urban contexts, addressing the lack of systematic evaluation tools for context-specific service design. The research introduces a novel parametric ABM integrating a comprehensive real-time matching algorithm that balances passenger utility and operator costs through a composite cost function. Unlike existing approaches, the model incorporates passenger walking behaviour, automatically adjusting service flexibility based on demand intensity whilst enabling systematic comparison across diverse operational scenarios. Three representative contexts are evaluated: small cities (many-to-many demand), large cities during off-peak periods (lower spatial demand density due to expanded service areas), and suburban feeder services (directional many-to-one patterns). Each scenario is analysed across fleet sizes (2–40 vehicles) and demand rates (10–200 requests/hour), with performance assessed through integrated passenger, operator, and economic indicators. Results demonstrate that DRT performance is fundamentally context-dependent. Suburban feeder services emerge as the optimal application, achieving total unit costs of 4–6 € per passenger and requiring minimal fleet investments (4–6 vehicles), representing 40–60 % cost advantages over urban scenarios. Small city operations achieve viable performance with moderate resources (8–12 vehicles, 6–8 €/pax), whilst large city deployments require substantial commitments (16–28 vehicles, 10–18 €/pax). The analysis reveals critical minimum viable fleet thresholds scaling proportionally with urban complexity, with capital investment ratios of 1:2:4 across scenarios, and confirming that spatial density fundamentally determines DRT viability. The findings provide evidence-based guidance for transport authorities, positioning suburban feeder applications as optimal entry points for DRT implementation.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100173"},"PeriodicalIF":2.7,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145801980","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}

引用次数: 0

On the development and analysis of a comprehensive police patrolling model 论综合警务巡逻模式的开发与分析

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100153

Fatemeh Mousapour, Rajan Batta, Jose L. Walteros

Police patrolling is a combination of proactive and reactive tasks. The initial focus is on the development and analysis of a deterministic model which has proactive patrolling tasks consisting of hot spot and general 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 hot spot and general 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 proactive 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.

警察巡逻是主动和被动任务的结合。最初的重点是开发和分析一个确定性模型，该模型具有由热点巡逻任务和一般巡逻任务组成的主动巡逻任务。开发了两种不同的配方来解决问题：紧凑的基于弧的和广泛的基于路径的配方嵌入在列生成过程中。这些公式包含了效率和公平的三个指标：密度、公平和分散。我们的模型具有离散的时间步长，并通过定义巡逻路线的细节来寻求在热点和一般巡逻任务之间取得平衡。该模型允许巡逻单元连续多个时间步在热点处，从而允许在热点处使用步行巡逻。我们将确定性模型嵌入到仿真环境中，以便在响应服务呼叫时定义主动巡逻路线。进行了数值实验来(a)评估所提出方法的计算效率，(b)探索对关键参数的敏感性分析。一个基于犯罪数据的案例研究被开发来说明模型和方法在实际情况中的效用。

{"title":"On the development and analysis of a comprehensive police patrolling model","authors":"Fatemeh Mousapour, Rajan Batta, 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}

引用次数: 0

The commodity constrained split delivery vehicle routing problem considering carbon emission: Formulations and a branch-and-cut method 考虑碳排放的商品约束拆分配送车辆路径问题：公式和分支-切割方法

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100154

Kamyla Maria Ferreira , Claudia Archetti , Diego Delle Donne , Reinaldo Morabito , Pedro Munari

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

_{2}

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

_{2}

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

_{2}

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

_{2}

emissions.

本文介绍了绿色商品约束的分割配送车辆路线问题（GC-SDVRP），该问题涉及设计高效环保的配送路线，以减少运输多种商品相关的二氧化碳排放。在这个问题中，客户所需的不同商品可以由一辆或多辆车交付（如果有利的话），这会带来额外的建模和解决方案挑战。我们提出了一个宽松的公式，提供了GC-SDVRP最优值的下界，并采用了文献中的另外两个公式来解决这个问题。此外，我们开发了基于这两个公式的分支-切割（BC）方法，并介绍了从松弛公式得到的解推导GC-SDVRP可行解的过程。在基准实例上进行的计算实验结果表明，基于该公式的BC方法具有优越的性能。此外，他们表明，与最小化距离的传统目标相反，GC-SDVRP比最小化总行驶距离的问题更容易求解到最优，并且可以减少2.59%的二氧化碳排放。我们的调查还显示，增加车辆容量可以提高GC-SDVRP的解决方案质量，而分次交付可以进一步减少二氧化碳排放。最后，尽管增加商品数量对解决问题带来了挑战，但分割交付的可能性减轻了其对最终解决方案价值的影响，这表明增加商品数量并不一定会导致更高的二氧化碳排放。

{"title":"The commodity constrained split delivery vehicle routing problem considering carbon emission: Formulations and a branch-and-cut method","authors":"Kamyla Maria Ferreira , Claudia Archetti , Diego Delle Donne , Reinaldo Morabito , 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}

引用次数: 0

Optimal scheduling and motion planning of automated vehicles at intersections 交叉口自动驾驶车辆最优调度与运动规划

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100158

Federico Gallo, Alessandra Miagostovich, Davide Giglio, Angela Di Febbraro, Nicola Sacco

The ever-growing diffusion of automation in road transport and the spreading of communication technologies applied to road infrastructures toward so-called smart roads 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.

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.

自动化在道路运输中的日益普及，以及应用于道路基础设施的通信技术向所谓的智能道路的传播，导致需要自动车辆的协调方法，以充分利用这些技术的潜力，使道路运输更高效、更安全、更环保。本研究的重点是这些问题，特别是确定自动驾驶汽车的最佳调度和速度，以安全通过十字路口，不停车，不需要交通信号。为了实现这一目标，将该问题表述为具有任意数量路段和车道的通用交叉口的混合整数线性规划（MILP）优化问题。此外，还讨论了问题解的性质，将所提出的方法应用于案例研究，提供了可用于在合理时间内解决大型问题实例的解决策略，并提供了主要模型参数的敏感性分析。算例分析表明，无论在先到先得的控制策略下还是在信号交叉口上，该模型都能有效避免车辆冲突，使交叉口通行能力提高一倍以上。

{"title":"Optimal scheduling and motion planning of automated vehicles at intersections","authors":"Federico Gallo, Alessandra Miagostovich, Davide Giglio, Angela Di Febbraro, 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}

引用次数: 0

A three-dimensional container loading algorithm for solving logistics packing problem 一种求解物流装箱问题的三维集装箱装货算法

IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100167

Ying Ma, Yu Zhou, Qiwei Fang, Shengwei Xia, Wei Chen

In addressing the challenge of large-scale packing of strongly heterogeneous cargo in logistics loading, this paper proposes a three-dimensional container loading algorithm that integrates a block-building heuristic, an optimized placement strategy, and an enhanced genetic algorithm. The proposed approach accounts for six practical constraints inherent in logistics packaging and establishes an optimization model aimed at maximizing container space utilization while adhering to permissible center of gravity deviations. First, a block construction heuristic is employed to preprocess the cargo by aggregating items into larger blocks, thereby significantly reducing problem size and computational complexity. Subsequently, an improved placement strategy, combined with a genetic algorithm, is applied to identify an initial feasible packing layout. Finally, a simulated annealing operator is introduced to further refine the solution through local optimization, thereby obtaining an enhanced loading solutions with improved loading efficiency. Through comparative experiments with other leading algorithms using public datasets, the results demonstrate that the proposed algorithm performs on par with existing methods in solving the three-dimensional packing problem for strongly heterogeneous items while satisfying multiple constraints. It is capable of providing high-quality loading solutions for logistics enterprises and offers valuable insights for addressing more realistic container loading problems in future research.

为解决物流装载中货物异质性较大的大规模装箱问题，提出了一种集块构建启发式、优化布局策略和增强遗传算法于一体的三维集装箱装载算法。提出的方法考虑了物流包装中固有的六个实际约束，并建立了一个优化模型，旨在最大限度地提高集装箱空间利用率，同时坚持允许的重心偏差。首先，采用块构建启发式方法将货物聚合成更大的块进行预处理，从而大大减少了问题的规模和计算复杂度。随后，采用改进的布局策略，结合遗传算法，确定一个初始可行的布局。最后，引入模拟退火算子，通过局部优化进一步细化解，从而得到加载效率提高的增强加载解。通过与其他主要算法在公共数据集上的对比实验，结果表明，该算法在满足多个约束条件的情况下，在解决强异构物品的三维包装问题上与现有方法相当。能够为物流企业提供高质量的装货解决方案，为今后研究更现实的集装箱装货问题提供有价值的见解。

{"title":"A three-dimensional container loading algorithm for solving logistics packing problem","authors":"Ying Ma, Yu Zhou, Qiwei Fang, Shengwei Xia, Wei Chen","doi":"10.1016/j.ejtl.2025.100167","DOIUrl":"10.1016/j.ejtl.2025.100167","url":null,"abstract":"<div><div>In addressing the challenge of large-scale packing of strongly heterogeneous cargo in logistics loading, this paper proposes a three-dimensional container loading algorithm that integrates a block-building heuristic, an optimized placement strategy, and an enhanced genetic algorithm. The proposed approach accounts for six practical constraints inherent in logistics packaging and establishes an optimization model aimed at maximizing container space utilization while adhering to permissible center of gravity deviations. First, a block construction heuristic is employed to preprocess the cargo by aggregating items into larger blocks, thereby significantly reducing problem size and computational complexity. Subsequently, an improved placement strategy, combined with a genetic algorithm, is applied to identify an initial feasible packing layout. Finally, a simulated annealing operator is introduced to further refine the solution through local optimization, thereby obtaining an enhanced loading solutions with improved loading efficiency. Through comparative experiments with other leading algorithms using public datasets, the results demonstrate that the proposed algorithm performs on par with existing methods in solving the three-dimensional packing problem for strongly heterogeneous items while satisfying multiple constraints. It is capable of providing high-quality loading solutions for logistics enterprises and offers valuable insights for addressing more realistic container loading problems in future research.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100167"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145465316","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}

引用次数: 0

Introduction to the special issue on 50 years of EURO 欧元成立50周年特刊简介

IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100170

D. Feillet

引用次数: 0

Solving the line planning problem with service-levels using a column generation-based heuristic algorithm 使用基于列生成的启发式算法解决服务水平的线路规划问题

IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100164

Hector Gatt , Jean-Marie Freche , Fabien Lehuédé , Thomas G. Yeung

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.

本研究结合营运目标与营运业者之约束，探讨巴士线路网路之策略设计。借鉴某公共交通软件公司的行业专业知识，我们将该问题表述为线路规划优化问题，旨在最大限度地降低网络运营成本，同时解决两个关键的服务质量指标：乘客实际出行时间与各自最短路径出行时间之间的偏差，以及乘客完成行程而不换乘的比例。为了解决实际规模和复杂性的问题实例，我们开发并实现了一个列生成启发式框架，其中公交线路和乘客路线路径在整个解决过程中都是动态生成的。我们的方法学方法结合了列生成和列枚举算法，在针对已建立的基准实例进行评估时展示了计算效率。此外，我们提出了一个全面的案例研究，考察了一个中等规模的法国城市，通过这个案例，我们展示了在我们的优化框架中实际整合现实世界的设计原则。这一实证分析产生了关于我们提出的参数和公共汽车网络设计文献中常用参数的敏感性的新见解。

{"title":"Solving the line planning problem with service-levels using a column generation-based heuristic algorithm","authors":"Hector Gatt , Jean-Marie Freche , Fabien Lehuédé , 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}

引用次数: 0

Stop plan optimisation for three-pattern skip-stop schemes for urban rail transit systems 城市轨道交通三种模式跳停方案的停站方案优化

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2024.100149

Somporn Sahachaiseree , Mohammad Sadrani , Constantinos Antoniou

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.

世界各地的快速轨道交通系统通常都是为全站运行方案设计的，在这种情况下，列车超车是不可能的。为加快公交运行，可规划传统的A/B跳停方案。本研究探讨了三种停车模式的跨站方案，旨在更好地匹配交通服务与出行需求的空间分布。所提出的广义跳站运营模型考虑了乘客和运营商的总成本。采用遗传算法求解停车计划优化问题，并采用启发式算法确定各停车计划的最优调度车头。基于合成数据的计算实验结果表明，跳停方案有可能将总时间成本降低约10%，特别是当存在结构化需求集中时，交通系统可以在低时距和短途需求低的情况下安全运行。虽然所发现的最佳A/B跳停方案的总成本节约总体上优于其他三种模式的跳停方案，但在没有短途出行需求的情况下，发现三种模式的跳停方案能提供更好的总成本节约。总的来说，这项研究对不同的跳过站方案的潜在好处和局限性提供了有价值的见解，有助于更好地了解它们对乘客和运营商的影响。

{"title":"Stop plan optimisation for three-pattern skip-stop schemes for urban rail transit systems","authors":"Somporn Sahachaiseree , Mohammad Sadrani , 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}

引用次数: 0

Scheduled service network design for intercontinental rail freight transport 洲际铁路货运定期服务网络设计

IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100165

Jing Shan , Henning Preis , Nikola Bešinović , Jörn Schönberger

Intercontinental rail freight transport has made significant strides in recent years, demonstrating its potential as a critical player in the global supply chain, such as Eurasian rail freight transport. However, Eurasian rail freight transport encounters challenges, including the presence of multiple rail systems with varying railway gauges, and especially in addressing the diverse requirements of the modern global supply chain. The traditional ’one service for all’ operational strategy is incapable of meeting the diverse transport requirements, emphasizing the need for more tailored solutions. We propose a time-space formulated Intercontinental Scheduled Service Network Design (I-SSND) for a relay intercontinental rail freight transport system, which necessitates an extension of the Scheduled Service Network Design (SSND). The I-SSND model, as a practical management tool, aims to move away from the traditional ’China-Europe Block Train’ business model, which offers only standard service, by enabling service differentiation. I-SSND model consider border crossing terminal times as well as train length variability across multiple different rail systems. It allows different orders from different origins to be consolidated at borders and share the same train service for the main transit based on their individual time constraints. The I-SSND model can assess demand variability and potential disruptions in the Eurasian rail network, including extended border crossing times, and evaluate their impact on overall network performance. The initial application of this model in Eurasian rail freight transport has yielded encouraging results. Mixed services demonstrate better performance compared to single standard services; the analysis shows an increase in profit growth and accepted orders. However, uneven demand distribution reduces overall network throughput and poses challenges for efficient capacity utilization, especially when compared to a more evenly distributed demand. Additionally, by integrating delay tolerance in mixed services, various metrics have significantly improved. On average, container acceptance increased by 10.44% and profits by 37.26%. These findings provide actionable managerial insights for intercontinental rail freight and highlight the necessity of establishing an entity to coordinate rail capacity planning across the various national rail networks involved.

近年来，洲际铁路货运取得了重大进展，显示出其作为全球供应链关键参与者的潜力，如欧亚铁路货运。然而，欧亚铁路货运面临挑战，包括存在多种铁路系统，铁路轨距不同，特别是在解决现代全球供应链的多样化要求方面。传统的“为所有人提供一种服务”的运营策略无法满足多样化的运输需求，因此需要更量身定制的解决方案。针对洲际铁路货运系统，提出了一种时空公式化的洲际定期服务网络设计（I-SSND），这需要对洲际定期服务网络设计（SSND）进行扩展。I-SSND模式作为一种实用的管理工具，旨在通过实现服务差异化，摆脱只提供标准服务的传统“中欧班列”商业模式。I-SSND模型考虑了跨多个不同铁路系统的过境终点站时间以及列车长度变化。它允许来自不同来源的不同订单在边境合并，并根据各自的时间限制共享主要过境的同一列车服务。I-SSND模型可以评估欧亚铁路网的需求变化和潜在中断，包括延长过境时间，并评估其对整体网络性能的影响。该模型在欧亚铁路货运中的初步应用取得了令人鼓舞的效果。混合服务比单一标准服务表现出更好的性能；分析显示利润增长和接受订单增加。然而，不均匀的需求分布降低了整体网络吞吐量，并对有效的容量利用提出了挑战，特别是与更均匀分布的需求相比时。此外，通过在混合服务中集成延迟容忍度，各种度量都得到了显著改善。集装箱接收量平均增长10.44%，利润平均增长37.26%。这些发现为洲际铁路货运提供了可行的管理见解，并强调了建立一个实体来协调各个国家铁路网络的铁路运力规划的必要性。

{"title":"Scheduled service network design for intercontinental rail freight transport","authors":"Jing Shan , Henning Preis , Nikola Bešinović , Jörn Schönberger","doi":"10.1016/j.ejtl.2025.100165","DOIUrl":"10.1016/j.ejtl.2025.100165","url":null,"abstract":"<div><div>Intercontinental rail freight transport has made significant strides in recent years, demonstrating its potential as a critical player in the global supply chain, such as Eurasian rail freight transport. However, Eurasian rail freight transport encounters challenges, including the presence of multiple rail systems with varying railway gauges, and especially in addressing the diverse requirements of the modern global supply chain. The traditional ’one service for all’ operational strategy is incapable of meeting the diverse transport requirements, emphasizing the need for more tailored solutions. We propose a time-space formulated Intercontinental Scheduled Service Network Design (I-SSND) for a relay intercontinental rail freight transport system, which necessitates an extension of the Scheduled Service Network Design (SSND). The I-SSND model, as a practical management tool, aims to move away from the traditional ’China-Europe Block Train’ business model, which offers only standard service, by enabling service differentiation. I-SSND model consider border crossing terminal times as well as train length variability across multiple different rail systems. It allows different orders from different origins to be consolidated at borders and share the same train service for the main transit based on their individual time constraints. The I-SSND model can assess demand variability and potential disruptions in the Eurasian rail network, including extended border crossing times, and evaluate their impact on overall network performance. The initial application of this model in Eurasian rail freight transport has yielded encouraging results. Mixed services demonstrate better performance compared to single standard services; the analysis shows an increase in profit growth and accepted orders. However, uneven demand distribution reduces overall network throughput and poses challenges for efficient capacity utilization, especially when compared to a more evenly distributed demand. Additionally, by integrating delay tolerance in mixed services, various metrics have significantly improved. On average, container acceptance increased by 10.44% and profits by 37.26%. These findings provide actionable managerial insights for intercontinental rail freight and highlight the necessity of establishing an entity to coordinate rail capacity planning across the various national rail networks involved.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100165"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145319639","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}

引用次数: 0

An MIP-heuristic approach for solving multiobjective helicopter flight scheduling in an oil and gas company 油气公司直升机多目标飞行调度问题的mip启发式求解方法

IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics

Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100169

Angelo Aliano Filho , Tarley Mansur Fantazzini , Reinaldo Morabito

Oil and gas extraction from offshore platforms usually requires regular helicopter transport to shuttle personnel to these remote sites. Effective organization and scheduling of flights to these maritime units ensure uninterrupted services, enhance operational efficiency, and guarantee service continuity. However, flights are subject to disruptions and might require rescheduling. To assist with decision-making in such situations, we present optimization approaches based on a discrete-time multiobjective integer linear optimization problem. This problem focuses on rescheduling flights from previous days into the current day’s flight schedule, aiming to minimize: (i) transferred flights to upcoming days; (ii) reduce helicopter usage; (iii) the total flight delay. Solving this problem using classic multiobjective scalarization methods for real instances takes several hours. This motivated the development of an MIP-heuristic that efficiently exploits special characteristics of this problem. Numerical results using data from a Brazilian company and in randomly generated instances showed the effectiveness of the proposed approach, producing a variety of high-quality solutions and consuming around 8% of the effort of an exact solution method. A strong conflict between these objectives was also observed. The trade-off analysis carried out made it possible to quantify how much the prioritization of the level of service (objectives (i) and (iii)) impacts helicopter costs and vice versa. Disregarding the subjectivity of the weight given to each goal, the proposed approach and technique proved to be effective in this context, capable of offering a wide range of alternative solutions to help the decision-maker choose a safe decision.

海上平台的石油和天然气开采通常需要定期的直升机运输将人员运送到这些偏远的地点。有效地组织和调度这些海上单位的航班，确保不间断的服务，提高运营效率，保证服务的连续性。然而，航班可能会受到干扰，可能需要重新安排。为了帮助在这种情况下的决策，我们提出了基于离散时间多目标整数线性优化问题的优化方法。这个问题的重点是将前几天的航班重新安排到当天的航班时刻表中，旨在最大限度地减少：(i)将航班转移到即将到来的日子；（ii）减少使用直升机；（iii）航班总延误。用经典的多目标标量化方法求解该问题需要几个小时。这激发了mip启发式方法的发展，该方法有效地利用了该问题的特殊特征。利用一家巴西公司的数据和随机生成的实例的数值结果表明，所提出的方法是有效的，产生了各种高质量的解决方案，并且消耗了精确解决方法的8%左右的工作量。这些目标之间也有强烈的冲突。所进行的权衡分析可以量化服务水平的优先级(目标（i)和（iii））对直升机成本的影响程度，反之亦然。不考虑每个目标权重的主观性，所提出的方法和技术在这种情况下被证明是有效的，能够提供广泛的替代解决方案，以帮助决策者选择一个安全的决策。

{"title":"An MIP-heuristic approach for solving multiobjective helicopter flight scheduling in an oil and gas company","authors":"Angelo Aliano Filho , Tarley Mansur Fantazzini , Reinaldo Morabito","doi":"10.1016/j.ejtl.2025.100169","DOIUrl":"10.1016/j.ejtl.2025.100169","url":null,"abstract":"<div><div>Oil and gas extraction from offshore platforms usually requires regular helicopter transport to shuttle personnel to these remote sites. Effective organization and scheduling of flights to these maritime units ensure uninterrupted services, enhance operational efficiency, and guarantee service continuity. However, flights are subject to disruptions and might require rescheduling. To assist with decision-making in such situations, we present optimization approaches based on a discrete-time multiobjective integer linear optimization problem. This problem focuses on rescheduling flights from previous days into the current day’s flight schedule, aiming to minimize: (i) transferred flights to upcoming days; (ii) reduce helicopter usage; (iii) the total flight delay. Solving this problem using classic multiobjective scalarization methods for real instances takes several hours. This motivated the development of an MIP-heuristic that efficiently exploits special characteristics of this problem. Numerical results using data from a Brazilian company and in randomly generated instances showed the effectiveness of the proposed approach, producing a variety of high-quality solutions and consuming around 8% of the effort of an exact solution method. A strong conflict between these objectives was also observed. The trade-off analysis carried out made it possible to quantify how much the prioritization of the level of service (objectives (i) and (iii)) impacts helicopter costs and vice versa. Disregarding the subjectivity of the weight given to each goal, the proposed approach and technique proved to be effective in this context, capable of offering a wide range of alternative solutions to help the decision-maker choose a safe decision.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100169"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145683885","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}

引用次数: 0