Abstract
The effectiveness of optimizing complex problems is closely linked to the configuration of parameters in search algorithms, especially when considering metaheuristic optimization models. Although various automated methods for algorithm configuration have been proposed to alleviate users from manually tuning parameters, there is still unexplored potential in dynamically adjusting certain algorithm parameters during execution, which can lead to enhanced performance. The main objective is to comparatively analyze the effectiveness of manual parameter tuning compared to a dynamic online configuration approach based on reinforcement learning. To this end, the State-Action-Reward-State-Action (SARSA) algorithm is adapted to adjust the parameters of a genetic algorithm, namely population size, crossover rate, mutation rate, and number of generations. Tests are conducted with these two methods on benchmark functions commonly used in the literature. Additionally, the proposed model has been evaluated in a practical problem of optimizing energy trading portfolios in the electricity market. Results indicate that the reinforcement learning-based algorithm tends to achieve seemingly better results than manual configuration, while maintaining very similar execution times. This result suggests that online parameter tuning approaches may be more effective and offer a viable alternative for optimization in metaheuristic algorithms. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

Abstract
Omnichannel retailers are reinventing stores to meet the growing demand of the online channel. Several retailers now use stores as supporting distribution centers to offer quicker Buy-Online-Pickup-In-Store (BOPS) and Ship-From-Store (SFS) services. They resort to in-store picking to serve online orders using existing assets. However, in-store picking operations require picker carts traveling through store aisles, competing for store space, and possibly harming the offline customer experience. To learn picking policies that acknowledge interactions between pickers and offline customers, we formalize a new problem called Dynamic In-store Picker Routing Problem (diPRP). This problem considers a picker that tries to pick online orders (seeking) while minimizing customer encounters (hiding) - preserving the offline customer experience. We model the problem as a Markov Decision Process (MDP) and solve it using a hybrid solution approach comprising mathematical programming and reinforcement learning components. Computational experiments on synthetic instances suggest that the algorithm converges to efficient policies. We apply our solution approach in the context of a large European retailer to assess the proposed policies regarding the number of orders picked and customers encountered. The learned policies are also tested in six different retail settings, demonstrating the flexibility of the proposed approach. Our work suggests that retailers should be able to scale the in-store picking of online orders without jeopardizing the experience of offline customers. The policies learned using the proposed solution approach reduced the number of customer encounters by up to 50%, compared to policies solely focused on picking orders. Thus, to pursue omnichannel strategies that adequately trade-off operational efficiency and customer experience, retailers cannot rely on actual simplistic picking strategies, such as choosing the shortest possible route.

Abstract
This paper underscores the critical role of evolving tools for underwater search and rescue. Successful submarine crew rescue hinges on detecting, locating, and obtaining detailed information about the submerged vessel. Robotic systems, particularly ROVs and AUVs, emerge as invaluable tools, offering swift deployment times compared to manned submersibles. This study presents findings from Submarine Escape and Rescue (SMER) field trials conducted during the REPMUS 2023 naval military exercise off the west coast of Portugal, showcasing the effectiveness of these tools in real-world emergency situations. An initial multibeam sonar search from the surface with the Mar Porfundo ship was performed, followed by a close detailed inspection and visual survey with the EVA AUV of a target military submarine (NRP Arp (a) over tildeo) stationed on the sea bottom.

Abstract
Currently, energy consumption in residential buildings is increasingly high. To meet demand, renewable energies are increasingly being used to produce more energy in a sustainable way, which has led to an increase in the load on the distribution network. Thus, with the exponential growth of dependence on technologies, studies on consumption patterns are increasingly common in order to try to understand the needs of the population and, in this way, make a more rational and efficient use of energy. This article aims to find consumption patterns in residential devices, considering specific houses. This work proposes the use of the Apriori algorithm, which allows the creation of several association rules among devices. The results, considering several scenarios in a house with 9 appliances, show that, despite the Apriori algorithm's difficulty in finding associations in household appliances with little time of use, several interesting association rules can be identified, providing relevant insights for future consumption flexibility models applications.

Abstract
Breast cancer, the most prevalent cancer among women, poses a significant healthcare challenge, demanding effective early detection for optimal treatment outcomes. Mammography, the gold standard for breast cancer detection, employs low-dose X-rays to reveal tissue details, particularly cancerous masses and calcium deposits. This work focuses on evaluating the impact of incorporating anatomical knowledge to improve the performance and robustness of a breast cancer classification model. In order to achieve this, a methodology was devised to generate anatomical pseudo-labels, simulating plausible anatomical variations in cancer masses. These variations, encompassing changes in mass size and intensity, closely reflect concepts from the BI-RADs scale. Besides anatomical-based augmentation, we propose a novel loss term promoting the learning of cancer grading by our model. Experiments were conducted on publicly available datasets simulating both in-distribution and out-of-distribution scenarios to thoroughly assess the model's performance under various conditions.

Abstract
Reliability analysis of large power networks requires accurate aggregate models of low voltage (LV) networks to allow for reasonable calculation complexity and to prevent long computational times. However, commonly used lumped load models neglect the differences in spatial distribution of demand, type of phase-connection of served customers and implemented protection system components (e.g., single-pole vs three-pole). This paper proposes a novel use of state enumeration (SE) and Monte Carlo simulation (MCS) techniques to formulate more accurate LV network reliability equivalents. The combined SE and MCS method is illustrated using a generic suburban LV test network, which is realistically represented by a reduced number of system states. This approach allows for a much faster and more accurate reliability assessments, where further reduction of system states results in a single-component equivalent reliability model with the same unavailability as the original LV network. Both mean values and probability distributions of standard reliability indices are calculated, where errors associated with the use of single-line models, as opposed to more detailed three-phase models, are quantified.