Search

In this paper, we tackle a problem of frequency assignment in Wi-Fi networks with a novel evolutionary-type algorithm. In this version of the problem, we consider the interferences originated by the access points, and also by the clients and all the 11 available channels in the 2.4 GHz Wi-Fi frequency band. The proposed evolutionary-type algorithm is the Coral Reefs Optimization approach with substrate layer (CRO-SL). It is a recently proposed algorithm, which simulates the processes which occur in real coral reefs, including the reproduction and fight for the space of living corals. This version of the algorithm includes a layer of "substrates" which allows using different search patterns jointly in the algorithm. This way, the CRO-SL is able to apply search patterns such as harmony search, differential evolution, Gaussian-based mutations and other traditional and novel search procedures, including local search algorithms, within a single population of solutions. We show the good performance of the proposed approach in a real case study of Wi-Fi frequency assignment, in the Polytechnic School building of the Universidad de Alcalá (Spain), where different realistic scenarios of the problem have been simulated and successfully solved with the CRO-SL algorithm. [ABSTRACT FROM AUTHOR]

In recent years, the research community has witnessed an explosion of literature dealing with the mimicking of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques. [ABSTRACT FROM AUTHOR]

Abstract In medical imaging there is a special interest in relating information from different images frequently used for diagnosis or treatment. Image registration (IR) involves the transformation of different sets of image data having a shared content into a common coordinate system. The estimation of the optimal transformation is modelled either as a combinatorial or a numerical optimization problem. Since traditional IR methods are constrained by several limitations, other optimization methods have been recently proposed to overcome such shortcomings. In this contribution, we consider the use of a recently proposed and high performance bio-inspired meta-heuristic: the Coral Reef Optimization Algorithm with Substrate Layers (CRO-SL). We adapt the algorithm to the real-coding IR problem variant following both feature-based and intensity-based designs, and perform two thorough experimental studies. Such studies focus on both mono-modal and inter-modal scenarios where the images suffer different types of 3D affine transformations to validate our proposal. The new proposal is benchmarked with state-of-the-art evolutionary and non-evolutionary IR methods. The results show that CRO-SL is a very competitive approach in terms of its robustness, accuracy, and efficiency. [ABSTRACT FROM AUTHOR]

In this work, we describe an approach that allows for optimizing the structure of a smart grid (SG) with renewable energy (RE) generation against abnormal conditions (imbalances between generation and consumption, overloads or failures arising from the inherent SG complexity) by combining the complex network (CN) and evolutionary algorithm (EA) concepts. We propose a novel objective function (to be minimized) that combines cost elements, related to the number of electric cables, and several metrics that quantify properties that are beneficial for SGs (energy exchange at the local scale and high robustness and resilience). The optimized SG structure is obtained by applying an EA in which the chromosome that encodes each potential network (or individual) is the upper triangular matrix of its adjacency matrix. This allows for fully tailoring the crossover and mutation operators. We also propose a domain-specific initial population that includes both small-world and random networks, helping the EA converge quickly. The experimental work points out that the proposed method works well and generates the optimum, synthetic, small-world structure that leads to beneficial properties such as improving both the local energy exchange and the robustness. The optimum structure fulfills a balance between moderate cost and robustness against abnormal conditions. Our approach should be considered as an analysis, planning and decision-making tool to gain insight into smart grid structures so that the low level detailed design is carried out by using electrical engineering techniques. [ABSTRACT FROM AUTHOR]

This paper proposes a novel optimization algorithm for grouping problems, the Grouping Coral Reefs Optimization algorithm, and describes its application to a Mobile Network Deployment Problem (MNDP) under four optimization criteria. These criteria include economical cost and coverage, and also electromagnetic pollution control and capacity constraints imposed at the base stations controllers, which are novel in this study. The Coral Reefs Optimization algorithm (CRO) is a recently-proposed bio-inspired approach for optimization, based on the simulation of the processes that occur in coral reefs, including reproduction, fight for space or depredation. This paper presents a grouping version of the CRO, which has not previously evaluated before. Grouping meta-heuristics are characterized by variable-length encoding solutions, and have been successfully applied to a number of different optimization and assignment problems. The GCRO proposed is a novel contribution to the intelligent systems field, which is able to improve results obtained by two alternative grouping algorithms such as grouping genetic algorithms and grouping Harmony Search. The performance of the proposed GCRO and the algorithms for comparison has been tested with real data in a case study of a MNDP in Alcalá de Henares, Madrid, Spain. [ABSTRACT FROM AUTHOR]

Abstract: This paper proposes the use of a bank of Hopfield networks to solve a class of constraints which appear in combinatorial optimization problems. Specifically, we deal with problems which constraints’ structure can be represented by a binary matrix C, and can be separated in independent substructures. We show that a bank of Hopfield networks can solve these constraints, and also can be easily hybridized with a global search algorithm, such as simulated annealing, to obtain a final solution to the problem. We apply our approach to the solution of a famous logic-type puzzle, the light-up puzzle, where we report improvements over a branch and bound algorithm, and to an important problem which arises in electronic control: the so-called Crossbar Switch Problem. [Copyright &y& Elsevier]

This paper discusses new results about the effect of linear transformations (LTs) over the representation, the spectrum and the performance of standard genetic algorithms (GAs). Unitary LTs are used to set the basic outcomes and, although they can be used for theoretic GA-hard problems, their applicability is shown to be quite limited. Nevertheless, the redundancy of problems can be exploited by means of non-unitary LTs. We also propose an heuristic for construction of non-unitary LTs. Several experiments are performed in order to discuss the theoretical results of the paper. [ABSTRACT FROM AUTHOR]

This article focuses on a twofold approach to improve the performance of genetic algorithms (GAs) in the feature selection problem (FSP). The feature selection problem (FSP) is an open issue in machine learning, which basically consists of finding a subset of input features that describes the underlying system structure as well or better than all available features. There is a more general problem, known as feature extraction problem, in which one has to construct a few features that encode all of the information contained in the available original ones; the FSP is, in fact a particularization of this problem.

This paper deals with the problem of finding the optimal location and sizing of Energy Storage Systems in DC-electrified railway lines. These devices increment the use of the regenerated energy produced by the trains in the braking phases, as they store the energy to later provide to the catenary the excess of regenerated energy, that otherwise would be lost in the rheostats. However, these infrastructures require a high initial investment that, in some cases, may question their profitability. We propose a multi-method ensemble meta-heuristic to obtain the optimal solution to the problem, with a high level of accuracy. Specifically, the Coral Reefs Optimization with Substrate Layers (CRO-SL) is proposed, an evolutionary-type approach able to run different search procedures within the same population. We will evaluate the performance of the CRO-SL in the problem, and we will show that it performs better than the best known existing meta-heuristics for this problem. [ABSTRACT FROM AUTHOR]

Hydro-power plants are able to produce electrical energy in a sustainable way. A known format for producing energy is through generation scheduling, which is a task usually established as a Unit Commitment problem. The challenge in this process is to define the amount of energy that each turbine-generator needs to deliver to the plant, to fulfill the requested electrical dispatch commitment, while coping with the operational restrictions. An optimal generation scheduling for turbine-generators in hydro-power plants can offer a larger amount of energy to be generated with respect to non-optimized schedules, with significantly less water consumption. This work presents an efficient mathematical modelling for generation scheduling in a real hydro-power plant in Brazil. An optimization method based on different versions of the Coral Reefs Optimization algorithm with Substrate Layers (CRO) is proposed as an effective method to tackle this problem. This approach uses different search operators in a single population to refine the search for an optimal scheduling for this problem. We have shown that the solution obtained with the CRO using Gaussian search in exploration is able to produce competitive solutions in terms of energy production. The results obtained show a huge savings of 13.98 billion (liters of water) monthly projected versus the non-optimized scheduling. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we present the application of a hybrid harmony search (HS) algorithm to the Spread-Spectrum Radar Polyphase (SSRP) codes design. Such a design can be formulated as a non-linear max–min optimization problem, hard to be solved using classical numerical techniques. Soft-computing approaches have then been successfully applied to solve the SSRP in the past, such as evolutionary computation techniques, variable neighborhood approaches or tabu search algorithms. In this paper we elaborate on the proposed hybrid HS approach, which consists of a naive implementation of the HS algorithm along with an adaptive-step gradient-guided local search procedure. Intensive computer simulations show that the proposed hybrid HS algorithm is able to outperform existing algorithms for the SSRP design problem (including the best reported so far), with significant differences in large-size SSRP instances. [Copyright &y& Elsevier]