EURO Journal on Transportation and Logistics最新文献

{"title":"Where and when does demand-responsive transport work best? A parametric analysis using agent-based modelling","authors":"Giovanni Calabrò ,&nbsp;Michela Le Pira ,&nbsp;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":"2026-01-01","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}

{"title":"Evaluation of reserved loading areas for last mile delivery","authors":"Mark Laskow ,&nbsp;Julian Golak ,&nbsp;Arne Schulz","doi":"10.1016/j.ejtl.2026.100176","DOIUrl":"10.1016/j.ejtl.2026.100176","url":null,"abstract":"<div><div>The increasing volume of parcels leads to challenges due to unauthorized parking especially in cities. This paper considers the concept of loading areas which are the only allowed parking spaces for delivery services. Loading areas are installed by cities and include one or several parking spaces. Via a smartphone app these parking spaces can be reserved and opened (bollards) by companies or drivers. We introduce a model to collaboratively assign parking times in loading areas. The model is investigated in a comprehensive computational study and compared with the state-of-the-art, where delivery services may stop in unauthorized positions, and loading areas without collaborative reservation with a first-come-first-serve scheme. Our results show that the concept can be a useful solution for the trade-off between safety (no unauthorized parking) and tour duration. Tour durations can be improved substantially by collaborative planning, an increased number of loading areas and parking spaces, and high delivery speeds between loading areas and customers.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100176"},"PeriodicalIF":2.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146173382","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":"The Dial-A-Ride Problem with transfers and walking","authors":"Idan Meshulami,&nbsp;Mor Kaspi","doi":"10.1016/j.ejtl.2026.100186","DOIUrl":"10.1016/j.ejtl.2026.100186","url":null,"abstract":"<div><div>This paper introduces the Dial-a-Ride Problem with Transfers and Walking (DARPTW), a generalization of the classical DARP in which passenger itineraries may include multiple transfers and walking segments. The objective is to minimize a bi-criteria function comprising total vehicle travel time and the total journey time of all users. Incorporating transfers and walking provides operational flexibility, enabling load balancing, reduced service areas, and walking shortcuts to avoid unnecessary vehicle detours, but also substantially increases problem complexity, as DARPTW generalizes the already NP-hard DARP.</div><div>To address this challenge, we propose an Adaptive Large Neighborhood Search (ALNS) framework that integrates a feasibility check and a scheduling heuristic. The feasibility check is accurate and computationally efficient, while the scheduler is highly efficient, allowing the approach to support iterative or near real-time routing. Computational experiments based on real-world data from Bubble-Dan in Tel Aviv demonstrate that ALNS consistently produces high-quality feasible solutions across diverse instances and scales with problem size, whereas exact methods quickly become intractable. A focused analysis of transfer policies shows that transfers are most beneficial under constrained conditions, such as limited walking flexibility or vehicle capacity, where they improve feasibility and routing efficiency.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100186"},"PeriodicalIF":2.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148950608","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 dynamic electric dial-a-ride problem with optional service upgrades","authors":"Christian Ackermann,&nbsp;Julia Rieck","doi":"10.1016/j.ejtl.2026.100187","DOIUrl":"10.1016/j.ejtl.2026.100187","url":null,"abstract":"<div><div>We study a dynamic dial-a-ride problem with electric vehicles, capacitated charging stations, and optional service upgrades that allow customers to reduce waiting times or ride alone for an additional fee. To optimize fleet availability, we propose a centralized a priori charging strategy that coordinates charging processes across the fleet, determining when, where, and how many vehicles should charge in parallel. A large neighborhood search improves routing decisions, while approximate dynamic programming methods guide request and service upgrade acceptance. A policy function approximation rejects requests if their additional profit does not exceed absolute and relative thresholds, while a cost function approximation decides about service upgrades based on their long-term impact on solution quality. Computational experiments show that a priori charging increases profitability between 6% and 33% while reducing rejection rates between 40% and 70% compared to commonly used threshold-based methods. Approximate dynamic programming-based acceptance increases profitability between 0.5% and 3.6% while maintaining low rejection rates.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100187"},"PeriodicalIF":2.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149050965","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":"BHAMSLE: A Breakpoint Heuristic Algorithm for maximum simulated likelihood estimation of advanced discrete choice models","authors":"Tom Haering,&nbsp;Michel Bierlaire","doi":"10.1016/j.ejtl.2026.100184","DOIUrl":"10.1016/j.ejtl.2026.100184","url":null,"abstract":"<div><div>Maximum simulated likelihood estimation (MSLE) is inherently complex due to the presence of multiple local maxima, which hinder standard optimization methods. One solution is to reformulate MSLE as a mixed-integer linear program (MILP), enabling the use of combinatorial techniques to obtain globally optimal solutions. However, this approach introduces two difficulties: (1) the reliance on simulation-based approximation, which is unavoidable when dealing with continuous mixtures and does not pose a fundamental limitation, and (2) the computational intractability of large-scale instances. To address the latter, we adapt the Breakpoint Heuristic Algorithm (BHA), originally developed for choice-based pricing, which has proven effective in solving similar MILPs with high accuracy and reduced computational time. The resulting method, the BHA for MSLE (or BHAMSLE for short), exploits the problem’s combinatorial structure by identifying decision-making breakpoints in a coordinate descent framework. Numerical experiments show that BHAMSLE significantly outperforms state-of-the-art global optimization methods that do not exploit this structure. Our approach delivers strong initialization points for estimation, yielding higher log-likelihoods, more stable and interpretable estimates, and improved recovery of latent segments, even in models with mixed parameters and restricted choice sets.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100184"},"PeriodicalIF":2.9,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148565587","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":"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":"A three-dimensional container loading algorithm for solving logistics packing problem","authors":"Ying Ma,&nbsp;Yu Zhou,&nbsp;Qiwei Fang,&nbsp;Shengwei Xia,&nbsp;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}

{"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":"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":"Introduction to the special issue on 50 years of EURO","authors":"D. Feillet","doi":"10.1016/j.ejtl.2025.100170","DOIUrl":"10.1016/j.ejtl.2025.100170","url":null,"abstract":"","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100170"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145789894","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}