Abstract
To get products delivered, clients and retailers agree on a delivery time window. We collaborated with an online retailer to develop a real-world application aimed at dynamically determining the delivery fee for each time window while ensuring the explainability of the pricing policy. This sequential decision-making problem arises as new customers continuously arrive. The objective is to maximize the final profit, given by the sum of baskets and delivery fees, discounted by the transportation and fleet costs. As multiple customers share the same delivery route, the costs are distributed among them, complicating the calculation of the marginal cost of each customer. Our study employs Genetic Programming (GP) to create explainable and easy-to-compute pricing policies to determine the delivery fees. These policies, expressed as mathematical formulas, rank price panels - combinations of time slots and corresponding fees - to identify optimal prices for each customer. The inputs to the GP algorithm capture the current state of the system, including factors such as capacity, customer location, and basket value. The resulting expressions offer operational managers a transparent pricing policy that allows them to maximize total profit. © 2025 Elsevier B.V., All rights reserved.

Abstract
The increasing integration of renewable energy sources and decentralized generation requires demand-side flexibility to improve grid stability and balance local energy flows. Local Flexibility Markets (LFMs) provide a framework for optimizing flexibility transactions within energy communities. This paper presents a model for quantifying and pricing residential resources flexibility, enabling prosumers to submit bids in an LFM managed by the Community Manager. The methodology relies on a linear optimization problem, where a Home Energy Management System first determines optimal consumption baselines. Then an iterative sensitivity analysis estimates upward, and downward flexibility bands and sets offer prices per resource. The market operates as two asymmetric voluntary pools, clearing flexibility offers and requests. Results show that Battery Energy Storage Systems and Electric Vehicles provide the most effective flexibility, significantly reducing energy costs. Future research should improve pricing mechanisms and scalability to support LFM adoption in different residential settings.

Abstract
The sustainable utilization of forest biomass for bioenergy production is increasingly challenged by the variability and unpredictability of raw material availability. These challenges are particularly critical in regions like Central Portugal, where seasonality, dispersed resources, and wildfire prevention policies disrupt procurement planning. This study investigates two flexibility strategies-dynamic network reconfiguration and operations postponement-as policy relevant tools to enhance resilience in forest-to-bioenergy supply chains. A novel mathematical model, the mobile Facility Location Problem with dynamic Operations Assignment (mFLP-dOA), is proposed and solved using a scalable matheuristic approach. Applying the model to a real case study, we demonstrate that incorporating temporary intermediate nodes and adaptable processing schedules can reduce costs by up to 17% while improving operational responsiveness and reducing non-productive machine time. The findings offer strategic insights for policymakers, biomass operators, and regional planners aiming to design more adaptive and cost-effective biomass supply systems, particularly under environmental risk scenarios such as summer operation bans. This work supports evidence-based planning and investment in flexible logistics infrastructure for cleaner and more resilient bioenergy supply chains.

Abstract
Renewable energy resources are crucial for addressing global economic and environmental challenges. Energy communities, which unite consumers to pursue shared energy goals, present a promising solution for reducing energy costs and enhancing sustainability. This study analyzes the optimal sizing and operation of energy community resources, formulating the problem as mixed-integer linear programming (MILP) models. Two tools are employed: one for daily operation, calculating energy setpoints for community assets such as battery energy storage systems (BESS) and electric vehicles (EVs), and another for sizing photovoltaic (PV) panels and BESS capacities to minimize costs while optimizing local energy trades. Due to the high computational demands of MILP, three optimization methods are compared: deterministic, hybrid particle swarm optimization (PSO), and evolutionary PSO (EPSO). The hybrid PSO method handles binary and continuous variables efficiently, while EPSO introduces diversity to improve solution quality in complex scenarios. These metaheuristic approaches address the trade-off between solution accuracy and computational effort, providing reliable tools for decision-makers in energy communities.

Abstract
Conflict-free Replicated Data Types (CRDTs) allow optimistic replication in a principled way. Different replicas can proceed independently, being available even under network partitions and always converging deterministically: Replicas that have received the same updates will have equivalent state, even if received in different orders. After a historical tour of the evolution from sequential data types to CRDTs, we present in detail the two main approaches to CRDTs, operation-based and state-based, including two important variations, the pure operation-based and the delta-state based. Intended for prospective CRDT researchers and designers, this article provides solid coverage of the essential concepts, clarifying some misconceptions that frequently occur, but also presents some novel insights gained from considerable experience in designing both specific CRDTs and approaches to CRDTs.

Abstract
This article focuses on the creation and evaluation of synthetic data to address the challenges of imbalanced datasets in machine learning (ML) applications, using fake news detection as a case study. We conducted a thorough literature review on generative adversarial networks (GANs) for tabular data, synthetic data generation methods, and synthetic data quality assessment. By augmenting a public news dataset with synthetic data generated by different GAN architectures, we demonstrate the potential of synthetic data to improve ML models' performance in fake news detection. Our results show a significant improvement in classification performance, especially in the underrepresented class. We also modify and extend a data usage approach to evaluate the quality of synthetic data and investigate the relationship between synthetic data quality and data augmentation performance in classification tasks. We found a positive correlation between synthetic data quality and performance in the underrepresented class, highlighting the importance of high-quality synthetic data for effective data augmentation.