Abstract
This work addresses the wind farm (WF) optimization layout considering several substations. It is given a set of wind turbines jointly with a set of substations, and the goal is to obtain the optimal design to minimize the infrastructure cost and the cost of electrical energy losses during the wind farm lifetime. The turbine set is partitioned into subsets to assign to each substation. The cable type and the connections to collect wind turbine-produced energy, forwarding to the corresponding substation, are selected in each subset. The technique proposed uses a genetic algorithm (GA) and an integer linear programming (ILP) model simultaneously. The GA creates a partition in the turbine set and assigns each of the obtained subsets to a substation to optimize a fitness function that corresponds to the minimum total cost of the WF layout. The fitness function evaluation requires solving an ILP model for each substation to determine the optimal cable connection layout. This methodology is applied to four onshore WFs. The obtained results show that the solution performance of the proposed approach reaches up to 0.17% of economic savings when compared to the clustering with ILP approach (an exact approach).

Abstract
Nowadays, semantic segmentation is used increasingly often in exploration by underwater robots. For example, it is used in autonomous navigation so that the robot can recognise the elements of its environment during the mission to avoid collisions. Other applications include the search for archaeological artefacts, the inspection of underwater structures or in species monitoring. Therefore, it is necessary to improve the performance in these tasks as much as possible. To this end, we compare some methods for image quality improvement and data augmentation and test whether higher performance metrics can be achieved with both strategies. The experiments are performed with the SegNet implementation and the SUIM dataset with eight common underwater classes to compare the obtained results with the already known ones. The results obtained with both strategies show that they are beneficial and lead to better performance results by achieving a mean IoU of 56% and an increased overall accuracy of 81.8%. The result for the individual classes shows that there are five classes with an IoU value close to 60% and only one class with an IoU value less than 30%, which is a more reliable result and is easier to use in real contexts.

Abstract
The resource-constrained project scheduling problem (RCPSP) is a well-known scheduling problem that has attracted attention since several decades. Despite the rapid progress of exact and (meta-)heuristic procedures, the problem can still not be solved to optimality for many problem instances of relatively small size. Due to the known complexity, many researchers have proposed fast and efficient meta-heuristic solution procedures that can solve the problem to near optimality. Despite the excellent results obtained in the last decades, little is known why some heuristics perform better than others. However, if researchers better understood why some meta-heuristic procedures generate good solutions for some project instances while still falling short for others, this could lead to insights to improve these meta-heuristics, ultimately leading to stronger algorithms and better overall solution quality. In this study, a new hardness indicator is proposed to measure the difficulty of providing near-optimal solutions for meta-heuristic procedures. The new indicator is based on a new concept that uses the o-distance metric to describe the solution space of the problem instance, and relies on current knowledge for lower and upper bound calculations for problem instances from five known datasets in the literature. This new indicator, which will be called the o -D indicator, will be used not only to measure the hardness of existing project datasets, but also to generate a new benchmark dataset that can be used for future research purposes. The new dataset contains project instances with different values for the o -D indicator, and it will be shown that the value of the o-distance metric actually describes the difficulty of the project instances through two fast and efficient meta-heuristic procedures from the literature.

Abstract
The rapid growth of the scientific literature makes text classification essential specially in the biomedical research domain to help researchers to focus on the latest findings in a fast and efficient way. The potential benefits of using text semantic enrichment to enhance the biomedical document classification is presented in this study. We show the importance of enriching the corpora with semantic information to improve the full-text classification. The approach involves the semantic enrichment of a Medline corpus with a Semantic Repository (SemRep) which extracts semantic predications from biomedical text. The study also addresses the problem of treating highly dimensional data while maintaining the semantic structure of the corpus. Experimental results lead to the sustained conclusion that better results are achieved with full-text instead of using only abstracts and titles. We also conclude that the application of enriched techniques to full-texts significantly improves the task of text classification providing a significant contribution for the biomedical text mining research. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract

Abstract
[No abstract available]