EURO Journal on Transportation and Logistics最新文献

{"title":"On-demand restaurant meal delivery with synchronized multi-orders","authors":"Florentin D. Hildebrandt","doi":"10.1016/j.ejtl.2026.100175","DOIUrl":"10.1016/j.ejtl.2026.100175","url":null,"abstract":"<div><div>On-demand restaurant meal delivery platforms, such as DoorDash and Meituan, have recently introduced a multi-order delivery service: Customers may combine delivery requests from different restaurants in a single <em>multi-order</em> with the service promise of a synchronized delivery. However, the platform must not only ensure the synchronization of multi-orders but also improve punctuality and freshness for all customers. This is challenging because, as we show, synchronization, delay, and freshness are conflicting objectives. Uncertainty in the delivery process and unknown future orders further complicate the decision making. This raises several research questions: How does the introduction of a multi-order service affect the overall delivery operations with regard to service quality and operational expenses? How should a multi-order service be strategically rolled out? How can we balance the competing objectives of synchronizing deliveries while minimizing delay and maximizing freshness? To answer the research questions, we propose an effective policy that allows for a careful and controlled balance between the competing objectives and employ it in an extensive computational study. We evaluate the effect of different trade-offs between delay, freshness, and synchronization on delivery operations over varying demand for multi-orders. We observe that enforcing strict synchronization of multi-orders by assigning each multi-order to a single delivery driver is hardly operational feasible. Occasionally using <em>split-deliveries</em> provides the flexibility to better balance all objectives. Our detailed experiments further generate insights on how platforms may roll-out multi-orders as a new service offering without negatively affecting their existing delivery operation while benefiting from reduced operational expenses.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100175"},"PeriodicalIF":2.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146173381","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":"Network design, line planning and timetabling in public transport systems with uncertain parameters: A literature review","authors":"Viera Klasovitá,&nbsp;Francesco Corman","doi":"10.1016/j.ejtl.2026.100174","DOIUrl":"10.1016/j.ejtl.2026.100174","url":null,"abstract":"<div><div>Understanding and addressing uncertainty is crucial for effective public transport design. This literature review examines key aspects of modelling and optimisation on network design, line planning and timetabling under uncertain conditions. We restrict the analysis to the case where some parameters in those mathematical problems have an uncertain value, that is, either characterised as a probability distribution, scenarios, or updated over multiple stages. The literature reveals the use of a wide range of concepts and models, the most common ones being robustness, multi-period planning, and stochastic programming. The research varies significantly in the selection of parameters to be unknown and/or uncertain and, in turn, those that are predetermined and deterministic. A critical analysis leads us to the following insights. The value of including uncertainty in the optimisation is often not quantified, and real-life applications that can estimate its benefits are scarce. The analysis reveals variations in terminology across different papers, with multiple overlapping and/or different concepts benefiting from similar mathematical approaches, highlighting the complexities researchers face. Our analysis indicates that only few articles use data to derive realistic or accurate scenarios and distributions to be used in stochastic optimisation approaches. Despite these complexities, ongoing advancements in modelling and optimisation techniques offer a promising path towards more effective and resilient public transport systems. These improvements ultimately enhance service quality and increase passenger satisfaction.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100174"},"PeriodicalIF":2.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146173379","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":"Vehicle routing problem with multiple fleets and carrier limit","authors":"Gauthier Soleilhac ,&nbsp;Fabien Lehuédé ,&nbsp;Juliette Medina ,&nbsp;Olivier Péton","doi":"10.1016/j.ejtl.2026.100177","DOIUrl":"10.1016/j.ejtl.2026.100177","url":null,"abstract":"<div><div>We address the distribution problem of a company that ships goods from a single depot to multiple customers. This distribution is outsourced to several carriers, each with distinct transportation rates and limited, heterogeneous vehicle fleets. Multiple carriers provide Full-Truckload (FTL) transportation via predefined routes operated by diverse vehicle types, with each carrier offering a limited number of trucks. Additionally, the Less-Than-Truckload (LTL) mode can be used to transport goods from origin to destination. We formulate this problem as a variant of the vehicle routing problem with a private fleet and common carriers. To solve it, we propose a matheuristic approach that combines a Large Neighborhood Search (LNS) metaheuristic with a set partitioning component. Our algorithm integrates filtering strategies to efficiently incorporate specific constraints into the LNS operators. We demonstrate that our method is competitive on established problem benchmarks and introduce new instances. Finally, we present a case study from the French retail industry, illustrating how combining FTL and LTL shipping can generate significant cost savings compared to relying solely on FTL or LTL.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100177"},"PeriodicalIF":2.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147600279","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":"Multi-period stochastic network design for combined natural gas and hydrogen distribution","authors":"Umur Hasturk ,&nbsp;Albert H. Schrotenboer ,&nbsp;Kees Jan Roodbergen ,&nbsp;Evrim Ursavas","doi":"10.1016/j.ejtl.2026.100178","DOIUrl":"10.1016/j.ejtl.2026.100178","url":null,"abstract":"<div><div>Hydrogen is produced from water using renewable electricity. Unlike electricity, hydrogen can be stored in large quantities for long periods. This storage ability acts as a <em>green battery</em>, allowing solar and wind energy to be generated and used at different times. As a result, green hydrogen plays a central role in facilitating a climate-neutral economy. However, the logistics for hydrogen are complex. As new pipelines are developed for hydrogen, there is a trend towards repurposing the natural gas network for hydrogen, due to its economic and environmental benefits. Yet, a rapid conversion could disrupt the balance of natural gas supply and demand. Furthermore, technical and economic developments surrounding the transition contribute additional complexity, which introduces uncertainty in future supply and demand levels for both commodities. To address these challenges, we introduce a multi-period stochastic network design problem for the transition of a natural gas pipeline network into a green hydrogen pipeline network. We develop a progressive-hedging-based metaheuristic to solve the problem. Results demonstrate our matheuristic is efficient, both in computation time and in solution quality. We show that factoring in uncertainty avoids premature expansion and ensures the development of an adequate pipeline network meeting long-term needs. In a case study in the Northern Netherlands for <em>Hydrogen Energy Applications in Valley Environments for Northern Netherlands</em> initiative, we focus on two key scenarios: local production and importation, exploring their impacts on performance indicators. Our case insights exemplify the solid foundation for strategic decision-making in energy transitions through our approach.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100178"},"PeriodicalIF":2.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147706352","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":"Using empirical travel time distributions for calibration of a model of pedestrian dynamics","authors":"Tobias Kretz ,&nbsp;Laura Eckes ,&nbsp;Laura Knappik ,&nbsp;Janis Diz ,&nbsp;Dominic Lipp ,&nbsp;Sven Müller","doi":"10.1016/j.ejtl.2026.100179","DOIUrl":"10.1016/j.ejtl.2026.100179","url":null,"abstract":"<div><div>The social force model is widely applied to simulate pedestrian movements in space and time. In this study, we propose an alternative calibration approach for the social force model by using the base acceleration <span><math><mrow><msub><mrow><mi>a</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>=</mo><mfrac><mrow><msub><mrow><mi>v</mi></mrow><mrow><mn>0</mn></mrow></msub></mrow><mrow><mi>τ</mi></mrow></mfrac></mrow></math></span> as the central parameter. Rather than assigning a fixed reaction time <span><math><mi>τ</mi></math></span> to all agents, as is common practice, we assume a constant <span><math><msub><mrow><mi>a</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> across agent types and compute individual <span><math><mi>τ</mi></math></span> values accordingly. The problem resulting from a fixed <span><math><mi>τ</mi></math></span> is, that when calibrated on macroscopic level, this can lead to microscopically implausible behavior. We therefore calibrate on macroscopic flow rates but evaluate on sub-macroscopic empirical travel-time distributions from a bottleneck experiment to verify whether the constant <span><math><msub><mrow><mi>a</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> parametrization preserves realistic microscopic behavior. The results indicate that our calibration based on a constant <span><math><msub><mrow><mi>a</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> improves the agreement between simulated and empirical data, particularly in the variance and distribution of individual travel times under high occupancy. We define a measure for comparing travel time distributions of the experiment to the two simulation approaches. This overlap measure increases from 0.149 to 0.257 using our proposed approach, corresponding to an improvement of 0.108. The variance of rank changes further supports this: the traditional approach exhibits a standard deviation of 5.63 compared to 2.76 in the experiment, while our approach reduces this to 4.05, lying closer to the empirical data. This suggests that calibrating on <span><math><msub><mrow><mi>a</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> enhances the model’s ability to reproduce realistic microscopic behavior.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"15 ","pages":"Article 100179"},"PeriodicalIF":2.7,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147797930","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":"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":"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}