Abstract
This paper presents a C++ application programming interface for a co-evolutionary algorithm for solution and scenario generation in stochastic problems. Based on a two-space biased random-key genetic algorithm, it involves two types of populations that are mutually impacted by the fitness calculations. In the solution population, high-quality solutions evolve, representing first-stage decisions evaluated by their performance in the face of the scenario population. The scenario population ultimately generates a diverse set of scenarios regarding their impact on the solutions. This application allows the straightforward implementation of this algorithm, where the user needs only to define the problem-dependent decoding procedure and may adjust the risk profile of the decision-maker. This paper presents the co-evolutionary algorithm and structures the interface. We also present some experiments that validate the impact of relevant features of the application.

Abstract
First-mile logistics tackles the movement of products from retailers to a warehouse or distri-bution centre. This first step towards the end customer has been pushed by large e-commerce platforms forming extensive networks of partners and is critical for fast deliveries. First-mile pickup requires efficient methods different from those developed for last-mile delivery, among other reasons due to the complexity of cargo features and volume - increasing the relevance of advanced packing methods. More importantly, the problem is essentially dynamic and the pickup process, in which the vehicle is initially empty, is much more flexible to react to disruptions arising when the vehicles are en route. We model the static first-mile pickup problem as a vehicle routing problem for a hetero-geneous fleet, with time windows and three-dimensional packing constraints. Moreover, we propose an approach to tackle the dynamic problem, in which the routes can be modified to accommodate disruptions - new customers' demands and modified requests of known customers that are arriving while the initially established routes are being covered. We propose three reactive strategies for addressing the disruptions depending on the number of vehicles available, and study their results on a newly generated benchmark for dynamic problems. The results allow quantifying the impact of disruptions depending on the strategy used and can help the logistics companies to define their own strategy, considering the characteristics of their customers and products and the available fleet.

Abstract
In cutting processes, one of the strategies to reduce raw material waste is to generate leftovers that are large enough to return to stock for future use. The length of these leftovers is important since waste is expected to be minimal when cutting these objects in the future. However, in several situations, future demand is unknown and evaluating the best length for the leftovers is challenging. Furthermore, it may not be economically feasible to manage a stock of leftovers with multiple lengths that may not result in minimal waste when cut. In this paper, we approached the cutting stock problem with the possibility of generating leftovers as a two-stage stochastic program with recourse. We approximated the demand levels for the different items by employing a finite set of scenarios. Also, we modeled different decisions made before and after uncertainties were revealed. We proposed a mathematical model to represent this problem and developed a column generation approach to solve it. We ran computational experi-ments with randomly generated instances, considering a representative set of scenarios with a varying probability distribution. The results validated the efficiency of the proposed approach and allowed us to derive insights on the value of modeling and tackling uncertainty in this problem. Overall, the results showed that the cutting stock problem with usable leftovers benefits from a modeling approach based on sequential decision-making points and from explicitly considering uncertainty in the model and the solution method. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )

Abstract
Trade promotions are complex marketing agreements between a retailer and a manufacturer aiming to drive up sales. The retailer proposes numerous sales promotions that the manufacturer partially supports through discounts and deductions. In the Portuguese consumer packaged goods (CPG) sector, the proportion of price-promoted sales to regular-priced sales has increased significantly, making proper promotional planning crucial in ensuring manufacturer margins. In this context, a decision support system was developed to aid in the promotional planning process of two key product categories of a Portuguese CPG manufacturer. This system allows the manufacturer’s commercial team to plan and simulate promotional scenarios to better evaluate a proposed trade promotion and negotiate its terms. The simulation is powered by multiple gradient boosting machine models that estimate sales for a given promotion based solely on the scarce data available to the manufacturer. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
When dealing with cutting problems, the generation of usable leftovers proved to be a good strategy for decreasing material waste. Focusing on practical applications, the main challenge in the implementation of this strategy is planning the cutting process to produce leftovers with a high probability of future use without complete information about the demand for any ordered items. We addressed the two-dimensional cutting stock with usable leftovers and uncertainty in demand, a complex and relevant problem recurring in companies due to the unpredictable occurrence of customer orders. To deal with this problem, a two-stage formulation that approximates the uncertain demand by a finite set of possible scenarios was proposed. Also, we proposed a matheuristic to support decision-makers by providing good-quality solutions in reduced time. The results obtained from the computational experiments using instances from the literature allowed us to verify the matheuristic performance, demonstrating that it can be an efficient tool if applied to real-life situations.

Abstract
In the energy production sector, increasing the quantity and efficiency of renewable energies, such as hydropower plants, is crucial to mitigate climate change. This paper proposes a new and flexible model for optimising operational decisions in watershed systems with interconnected dams. We propose a systematic representation of watersheds by a network of different connection points, which is the basis for an efficient Mixed-Integer Linear Programming model. The model is designed to be adaptable to different connections between dams in both main and tributary rivers. It supports decisions on power generation, pumping and water discharge, maximising profit, and considering realistic constraints on water use and factors such as future energy prices and weather conditions. A relax-and-fix heuristic is proposed to solve the model, along with two heuristic variants to accommodate different watershed structures and sizes. Methodological tests with simulated instances validate their performance, with both variants achieving results within 1% of the optimal solution faster than the model for the tested instances. To evaluate the performance of the approaches in a real-world scenario, we analyse the case study of the Cávado watershed (Portugal), providing relevant insights for managing dam operations. The model generally follows the actual decisions made in typical situations and flood scenarios. However, in the case of droughts, it tends to be more conservative, saving water unless necessary or profitable. The model can be used in a decision-support system to provide decision-makers with an integrated view of the entire watershed and optimised solutions to the operational problem at hand.