Abstract
We consider the problem of selecting bases for firefighting activities (e.g., vigilance, water refill, initial attack) and links between them in the context of wildfire promptness. Bases can be facilities, such as watchtowers and water tanks, or positions from where an initial attack is conducted. It is assumed that it is advantageous to connect bases in such a way that resources (e.g. ground crews) can quickly move between them. The general problem is modelled in a general way as integration of a set covering problem (for selecting the location of the bases) and a travelling salesman problem where the cities are the selected locations and the arcs the links that connect them. We propose a mixed integer programming model where objectives are addressed by lexicographic optimization. The first objective is related to cover potential ignition points with a high estimate of their initial spread rate of the fire at the detection time. Computational experiments are discussed for a scenario, of an actual landscape, with parameters estimated from a fire behaviour model that takes into account slope, fuels, and wind. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.

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
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.