Abstract
The Manufacturer's Pallet Loading Problem involves optimising the packing of a maximal number of identical rectangular boxes onto a single rectangular pallet. This problem arises in various logistic operations that involve the storage and transportation of boxed products, where efficient packing can result in substantial cost reductions and improved operational efficiency. Logistics managers anticipate that some boxes can be damaged during handling and transport, so the stability of the pallet load is essential to avoid such damage. The interlocking method is commonly used in practice to improve stability when loading pallets, minimising product damage and reducing the risk of injury to personnel handling the pallet. This study introduces a Mixed Integer Linear Programming model that addresses the Manufacturer's Pallet Loading Problem, promoting static stability through interlocking. Stability is evaluated with respect to the relationship between successive layers of the loading plan, with three types of interlocking incorporated into the mathematical model. Computational experiments with real-world instances were conducted to assess the model's performance using different objective functions and post-optimisation heuristics that target real-world requirements. Three stability metrics were used to evaluate the load plans generated by the mathematical model. The results show the interlocking method's benefits on the pallet loads' stability while maximising the pallet volume usage.

Abstract
This paper addresses a multi-compartment tank-truck loading problem for fuel distribution. The proposed problem aims to quantify and assign products to vehicle compartments and to ensure safety throughout the entire distribution using the vehicle Load Distribution Diagram (LDD) to verify vehicle compliance with safety standards and legislation applicable to the transport of dangerous goods. We propose a mixed-integer linear programming model that incorporates axle weight distribution constraints. A new problem generator was developed to test and validate the mathematical model. In the study, three objective functions were considered: minimize operational costs by minimizing the number of compartments allocated to a filling station, maximize profits by maximizing the amount of fuel delivered, and improve safety along the entire route by minimizing the distance between the front of the tank and the load center of gravity. In addition to evaluating these objectives individually, a lexicographic multi-objective approach was implemented to analyse how companies can systematically balance efficiency, profitability, and safety priorities. The computational study demonstrated that LDD constraints are crucial for ensuring the stability and safety of cargo during distribution. Without these constraints, the solutions fail to meet safety standards in 78% of tests. The multi-objective analysis showed limited conflicts among objectives and provided additional managerial insights. Regardless of problem size or objective function, computational times remained consistently low, averaging below 3 seconds.

Abstract
The authors regret that a minor inconsistency was identified in Algorithm 1 of our published paper during subsequent experiments conducted to further improve the G16 constructive heuristic. Specifically, the original implementation of G16 did not distinguish between regular and merged earliest time windows when computing [Formula presented], which could, in some cases, affect the consistency of [Formula presented], [Formula presented], [Formula presented], [Formula presented], and [Formula presented] for requests simultaneously served at the same location, leading to infeasible routes under specific configurations. The correction is as follows (Algorithm 1, Line 15): Original: [Formula presented] Corrected: [Formula presented] where [Formula presented] denotes the merged earliest time window when a merged time service is applied; otherwise, it equals [Formula presented]. As a result, the total costs obtained with the corrected version of G16 slightly deviate, either positively or negatively, from those originally published. The average percentage gaps between the published and corrected G16 results are 2.55, 0.61, -0.64, 0.42, and -2.27% for instances with 50, 100, 200, 400, and 700 requests, respectively. Complementarily, a Spearman correlation (p = 0.98) and a Wilcoxon signed-rank test (p = 0.106) revealed no statistically significant difference between both sets of results. Therefore, the overall performance patterns and comparative findings discussed in the original paper remain valid. Updated computational results are available in the same Mendeley Data repository (DOI: https:/doi.org/10.17632/7fb9jn2wcs.1). The authors would like to apologise for any inconvenience caused. © 2025 Elsevier B.V.

Abstract
The rapid advancement of warehouse automation has increased the need for intelligent intralogistics solutions that enhance material handling efficiency and optimize space utilization. This research presents a simulation-based methodology that integrates Autonomous Mobile Robots (AMRs) with container loading optimization in a unified decision-support framework that dynamically synchronizes AMR routing with optimized truckload configurations, a feature not commonly addressed jointly in existing literature to improve warehouse operations. By leveraging a hybrid approach combining discrete event and agent-based simulation in FlexSim, the study evaluates the impact of AMR fleet size, routing strategies, and truckload configurations on overall logistics performance. A proof-of-concept industrial case study illustrates how different scenarios influence key performance metrics, such as total operation time and resource utilization. The findings demonstrate that synchronized AMR deployment and optimized container loading strategies contribute to increased throughput, reduced handling time, and enhanced logistics unit utilization. This work provides a framework for dynamic logistics planning, offering valuable insights for companies seeking to enhance warehouse efficiency and sustainability through simulation-driven decision support. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.

Abstract
This special issue showcases state-of-the-art research at the intersection of analytics and retail operations. As the retail landscape becomes increasingly complex - driven by omnichannel strategies, evolving customer expectations, and a surge in data availability - analytics has emerged as a critical enabler of operational efficiency, customer experience, responsiveness, and sustainability and ethics. Collectively, these contributions demonstrate how advanced analytics can support retailers in navigating uncertainty, personalizing services, and scaling up innovation across formats and channels. The articles featured in this issue address a diverse set of decision domains, including warehousing, inventory and assortment planning, and distribution and last-mile delivery. Methodologically, they span descriptive, prescriptive, and hybrid approaches, leveraging tools such as machine learning, stochastic modeling, and dynamic optimization. By grounding models in real-world data and focusing on practical implementation, the issue provides actionable insights for both scholars and practitioners. It also highlights emerging opportunities for future research on behavioral integration, human-machine collaboration, and the ethical dimensions of retail analytics.

Abstract
We study the optimal online service for grocery retailers operating both physical and online stores. The challenge lies in optimizing the size of the online assortment and the delivery fees to maximize profitability across channels, while considering customer, operational, and market dynamics. Using transaction data from a major grocery retailer, we employ an alternative-specific conditional logit model to investigate how delivery fees, assortment size, network characteristics, and customer needs influence store choice and spending across physical and online channels. We develop a profitability model that incorporates online service variables, customer behavior, and operational costs, enabling us to explore optimal strategies under various conditions. By identifying favorable conditions for the online store and analyzing optimal service variables, we provide actionable insights for retailers. Our findings challenge common practices in omnichannel retail. We show that delivery fees should not merely cover costs but can be strategically set higher, particularly for retailers with strong offline presence. Additionally, while reducing fulfillment costs improves profitability, its impact is smaller than expected. Multichannel retailers can offset these costs by passing them on to customers, with minimal overall demand loss, as some customers opt to shop in physical stores rather than abandoning the retailer entirely. Lastly, maximizing the online assortment may not always be optimal, particularly if the operational inefficiencies and costs outweigh the value customers place on variety. Our methodological framework provides retailers the opportunity to align their online services with customer preferences and operational constraints and to leverage customer data in shaping their omnichannel strategies. © 2026 The Author(s)