Abstract
This work proposes a robust methodology for the location and sizing of grid forming (GFM) converters that simultaneously considers the solution costs and the security gains while accounting for the TSO nonlinear cost-security sensitivity. Such methodology, which includes a collection of techniques to reduce the problem dimensionality, formulates the placement problem as a non-linear multi-criteria decision support problem and uses a solution-seeking algorithm based on Bayesian Optimisation to determine the solution. To ease comprehension, a modified version of the IEEE 39 Test System is used as a case study throughout the method's detailed explanation and application example. A sensitivity analysis of the GFM converter's over-current capacity in the solution of the formulated placement problem is also performed. The results show that the proposed method is successful in finding solutions with physical meaning and that respect the decision agent preferences.

Abstract
User studies are paramount for advancing research in software engineering, particularly when evaluating tools and techniques involving programmers. However, researchers face several barriers when performing them despite the existence of supporting tools. We base our study on a set of tools and researcher-reported barriers identified in prior work on user studies in software engineering. In this work, we study how existing tools and their features cope with previously identified barriers. Moreover, we propose new features for the barriers that lack support. We validated our proposal with 102 researchers, achieving statistically significant positive support for all but one feature. We study the current gap between tools and barriers, using features as the bridge. We show there is a significant lack of support for several barriers, as some have no single tool to support them.

Abstract
To achieve carbon neutrality by 2050, commercial buildings have installed photovoltaic systems to reduce carbon emissions and operational costs. Nevertheless, PV generation does not always match the building’s energy demand profile, therefore storage systems are needed to store excess energy and supply it when necessary. This paper presents a Mixed Integer Linear Programming optimisation algorithm designed to schedule the operation of the electric storage system, aiming to minimise the building’s energy-related costs. An annual hourly simulation of the optimised system was performed to assess the cost reduction. To prevent excessive operation of the electric storage system, an approach to penalise low energy charging was studied, with results showing a significant increase in the system’s lifespan.

Abstract
Load forecasting is an asset for sustainable building energy management, as accurate predictions enable efficient energy consumption and con- tribute to decarbonisation efforts. However, data-driven models are often limited by dataset length and quality. This study investigates the effectiveness of transfer learning (TL) for load forecasting in office buildings, with the aim of addressing data scarcity issues and improving forecasting accuracy. The case study consists in a group of eight virtual buildings (VB) located in Porto, Portugal. VB A2 serves as pre-trained base model to transfer knowledge to the remaining VBs, which are analysed in varying degrees of data availability. Our findings indicate that TL can significantly reduce training time, for up to 87%, while maintaining accuracy levels comparable to those of models trained with full dataset, and exhibiting superior performance when com- pared to models trained with scarce data, with average RMSE reduction of 42.76%.

Abstract
This study explores models for synthetic data generation of time series. In order to improve the achieved results, i.e., the data generated, new ways of improvement are explored and different models of synthetic data generation are compared. The model addressed in this work is the Generative Adversarial Networks (GANs), known for generating data similar to the original basis data through the training of a generator. The GANs are applied using the datasets of Quinta de Santa Barbara and the Pinhao region, with the main variables being the Average temperature, Wind direction, Average wind speed, Maximum instantaneous wind speed and Solar radiation. The model allowed to generate missing data in a given period and, in turn, enables to analyze the results and compare them with those of a multiple linear regression method, being able to evaluate the effectiveness of the generated data. In this way, through the study and analysis of the GANs we can see if the model presents effectiveness and accuracy in the synthetic generation of meteorological data. With the proper conclusions of the results, this information can be used in order to improve the search for different models and the ability to generate synthetic time series data, which is representative of the real, original, data.

Abstract
In a survey of Belgian logistics service providers, the efficiency of first-mile pickup operations was identified as a key area for improvement, given the increasing number of returns in e-commerce, which has a significant impact on traffic congestion, carbon emissions, energy consumption and operational costs. However, the complexity of first-mile pickup operations, resulting from the small number of parcels to be collected at each pickup location, customer time windows, and the need to efficiently accommodate the highly heterogeneous cargo inside the vans, has hindered the development of real-world solution approaches. This article tackles this operational problem as a vehicle routing problem with time windows, time-dependent travel durations, and split pickups and integrates practical 3D container loading constraints such as vertical and horizontal stability as well as amore realistic reachability constraint to replace the classical Last In First Out (LIFO) constraint. To solve it, we propose a three-phase heuristic based on a savings constructive heuristic, an extreme point concept for the loading aspect and a General Variable Neighborhood Search as an improvement phase for both routing and packing. Numerical experiments are conducted to assess the performance of the algorithm on benchmark instances and new instances are tested to validate the positive managerial impacts oncost when allowing split pickups and on driver working duration when extending customer time windows. In addition, we show the impacts of considering the reachability constraint oncost and of the variation of speed during peak hours on schedule feasibility.