Abstract
Three-Dimensional Packing Problems (3D-PPs) can be applied to effectively reduce logistics costs in various areas, such as airline cargo management and warehouse management. In general, 3D-PP studies can be divided into two different streams: those tackling the off-line problem, where full knowledge about items is available beforehand; and those tackling the on-line (real-time) problem, where items arrive one by one and should be packed immediately without having full prior knowledge about them. During the past decades, off-line and online 3D-PPs have been studied in the literature with various constraints and solution approaches. However, and despite the numerous practical applications of on-line problems in real-world situations, most of the literature to date has focused on off-line problems and is quite sparse when it comes to on-line solution methods. In this regard, and despite the different nature of on-line and off-line problems, some approaches can be applied in both environments. Hence, we conducted an in-depth and updated literature review to identify and structure various constraints and solution methods employed by researchers in off-line and on-line 3D-PPs. Building on this, by bringing together the two separate streams of the literature, we identified several off-line approaches that can be adopted in on-line environments. Additionally, we addressed relevant research gaps and ways to bridge them in the future, which can help to develop this research field.

Abstract
The CrossLog project aims to investigate, study, develop and implement an automated and collaborative cross-docking system (aligned with Industry 4.0) capable of moving and managing the flow of products within the warehouse in the fastest and safest way. In CrossLog, the ability to generate intelligent three-dimensional packing patterns is essential to ensure the flexibility and productivity of the cross-docking system while ensuring the stability of the palletised load. In this work, a heuristic solution approach is proposed to generate efficient pallet packing patterns that simultaneously minimise the total number of pallets required and address the balance of weight and volume between pallets. Computational experiments with data from a real company demonstrate the quality of the proposed solution approach.

Abstract
To maintain high levels of efficiency and compliance with delivery dates, automotive repair shops must have a good system for scheduling their activities. The scheduling of the activities of an automotive repair shop is a very complex task to be performed manually. Throughout this work, a Decision Support System (DSS) was developed and tested that considers two major constraints in an automotive workshop: human resources (technicians) and physical resources (work stalls). The proposed DSS has an embedded MIP model that assigns a technician and a work stall to each job, according to the input conditions. The DSS also generates schedules with the planning of technicians and jobs. The system was tested with real data from an automotive workshop and was able to create plans and schedules not only for the human and physical resources in but also to analyse the limiting resources of the workshop.

Abstract
Additive Layer Manufacturing, particularly Fused Deposition Modelling, faces significant batch loss risks during production. The traditional Concurrent Printing Mode produces all parts simultaneously (layer-by-layer, bottom-to-top), efficiently using printing space but risking complete batch failure if problems occur. In contrast, Sequential Printing Mode produces one part at a time, reducing the risk of total batch loss but utilising printing space less efficiently. In this work, we propose an algorithm that, given a set of parts, performs the nesting of the parts for Concurrent Printing Mode, and for the first time, for the Sequential Printing Mode. A no-fit polygon based approach is used to handle geometry between pairs of parts by using multiple horizontal 2D layer projections of 3D parts, to ensure non-overlapping constraints and prevent machine-part collisions. A Greedy Randomized Adaptive Search Procedure is proposed, tested and benchmarked against a commercial software, using a new set of real-world instances. The approach shows the ability to find high-quality solutions. The approach significantly reduces the number of batches, minimises waste, reduces manufacturing time, and promotes parts quality.

Abstract
The main goal of this paper was to develop, implement, and test a practical framework for large-scale last-mile delivery problems that employ a combination of optimisation and machine learning while focussing on different routing methods. Delivery companies in big cities choose delivery orders based on the tacit knowledge of experienced drivers, since solving a large optimisation model with several variables is not a practical solution to meet their daily needs. This framework includes three phases of districting, sequencing, and routing, and in total 30 different variants were tested in different capacities. Using the power of machine learning, a model is trained and tuned to predict driving road distances, allowing the implementation of the whole framework and improving performance from analysing 2983 stops in several hours to 58,192 stops in less than 15 minutes. The results demonstrated that Inter 1 - Centroids is the best inter-district connection method, and one of the best variants in this framework is variant 26 which managed to decrease up to 34,77% total distances with 79 fewer drivers in a full month analysis compared to the original routes of the delivery company. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

Abstract
At the practical level, the static stability constraint is one of the most important constraints in practical pallet loading problems, such as air cargo palletizing. Approaches to modeling static stability, which range from base support and mechanical equilibrium calculations to physical simulation, differ in workflow, focus, and assumptions, so choosing the right static stability approach has a substantial impact on the quality of the solution and, ultimately, on loading security. To date, little research has investigated the structural differences between approaches. The aim of this paper is to integrate knowledge and shed light on the applicability of the different approaches for the practical scenario of air cargo palletizing. We tackle this problem through (1) a reformulation and extension of static stability toward loading stability, (2) a conceptual analysis of current approaches, and (3) benchmarking that employs an independent multibody simulation on multiple heterogeneous datasets. Our results show that all approaches are prone to structure errors and vary significantly in their premises and information usage. Further, full base support is revealed to be the most restrictive approach by far, while physical simulation achieves the greatest accuracy. Given the trade-off between accuracy and runtime, the mechanical equilibrium approach is a good choice, while partial base support performs best for lower support values.