Ángel M. Pérez-Bellido

Short term wind speed prediction based on evolutionary support vector regression algorithms

Hyper-parameters estimation in regression Support Vector Machines (SVMr) is one of the main problems in the application of this type of algorithms to learning problems. This is a hot topic in which very recent approaches have shown very good results in different applications in fields such as bio-medicine, manufacturing, control, etc. Different evolutionary approaches have been tested to be hybridized with SVMr, though the most used are evolutionary approaches for continuous problems, such as evolutionary strategies or particle swarm optimization algorithms. In this paper we discuss the application of two different evolutionary computation techniques to tackle the hyper-parameters estimation problem in SVMrs. Specifically we test an Evolutionary Programming algorithm (EP) and a Particle Swarm Optimization approach (PSO). We focus the paper on the discussion of the application of the complete evolutionary-SVMr algorithm to a real problem of wind speed prediction in wind turbines of a Spanish wind farm.

Letters: Accurate short-term wind speed prediction by exploiting diversity in input data using banks of artificial neural networks

Wind speed prediction is a very important part of wind parks management. Currently, hybrid physical-statistical wind speed forecasting models are used to this end, some of them using neural networks as the final step to obtain accurate wind speed predictions. In this paper we propose a method to improve the performance of one of these hybrid systems, by exploiting diversity in the input data of the neural network part of the system. The diversity in the data is produced by the physical models of the system, applied with different parameterizations. Two structures of neural network banks are used to exploit the input data diversity. We will show that our method is able to improve the performance of the system, obtaining accurate wind speed predictions better than the one obtained by the system using single neural networks.

Improving the training time of support vector regression algorithms through novel hyper-parameters search space reductions

The selection of hyper-parameters in support vector machines (SVM) is a key point in the training process of these models when applied to regression problems. Unfortunately, an exact method to obtain the optimal set of SVM hyper-parameters is unknown, and search algorithms are usually applied to obtain the best possible set of hyper-parameters. In general these search algorithms are implemented as grid searches, which are time consuming, so the computational cost of the SVM training process increases considerably. This paper presents a novel study of the effect of including reductions in the range of SVM hyper-parameters, in order to reduce the SVM training time, but with the minimum possible impact in its performance. The paper presents reduction in parameter C, by considering its relation with the rest of SVM hyper-parameters (@c and @e), through an approximation of the SVM model. On the other hand, we use some characteristics of the Gaussian kernel function and a previous result in the literature to obtain novel bounds for @c and @e hyper-parameters. The search space reductions proposed are evaluated in different regression problems from UCI and StatLib databases. All the experiments carried out applying the popular LIBSVM solver have shown that our approach reduces the SVM training time, maintaining the SVM performance similar to when the complete range in SVM parameters is considered.

Optimal switch location in mobile communication networks using hybrid genetic algorithms

The optimal positioning of switches in a mobile communication network is an important task, which can save costs and improve the performance of the network. In this paper we propose a model for establishing which are the best nodes of the network for allocating the available switches, and several hybrid genetic algorithms to solve the problem. The proposed model is based on the so-called capacitated p-median problem, which have been previously tackled in the literature. This problem can be split in two subproblems: the selection of the best set of switches, and a terminal assignment problem to evaluate each selection of switches. The hybrid genetic algorithms for solving the problem are formed by a conventional genetic algorithm, with a restricted search, and several local search heuristics. In this work we also develop novel heuristics for solving the terminal assignment problem in a fast and accurate way. Finally, we show that our novel approaches, hybridized with the genetic algorithm, outperform existing algorithms in the literature for the p-median problem.

Team formation based on group technology

This publication contains reprint articles for which IEEE does not hold copyright. Full text is not available on IEEE Xplore for these articles.

A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups

This paper presents a novel application of the hybrid grouping genetic algorithm in a problem related to university timetabling. Specifically, the assignment of students to laboratory groups is tackled. This problem includes an important constraint of capacity, due to laboratories usually have a maximum number of equips or computers available, so the number of total students in a group is constrained to be equal or less than the capacity of the laboratory. In addition, our approach considers the case in which the students provide a sorted list of preferred laboratory groups, so the objective of the assignment must take this point into account. A variation of the problem in which a balanced number of students per group is required (lecturer preferences) is also studied in this paper. The performance of the approach is shown in different test problems and in a real application in a Spanish University.

Efficient aerodynamic design through evolutionary programming and support vector regression algorithms

The shortening of the design cycle and the increase of the performance are nowadays the main challenges in aerodynamic design. The use of evolutionary algorithms (EAs) seems to be appropriate in a preliminary phase, due to their ability to broadly explore the design space and obtain global optima. Evolutionary algorithms have been hybridized with metamodels (or surrogate models) in several works published in the last years, in order to substitute expensive computational fluid dynamics (CFD) simulations. In this paper, an advanced approach for the aerodynamic optimization of aeronautical wing profiles is proposed, consisting of an evolutionary programming algorithm hybridized with a support vector regression algorithm (SVMr) as a metamodel. Specific issues as precision, dataset training size and feasibility of the complete approach are discussed and the potential of global optimization methods (enhanced by metamodels) to achieve innovative shapes that would not be achieved with traditional methods is assessed.

Teaching Advanced Features of Evolutionary Algorithms Using Japanese Puzzles

In this paper, a method to teach advanced features of evolutionary algorithms (EAs), using a famous game known as Japanese puzzles is presented. The authors show that Japanese puzzles are constrained combinatorial optimization problems, that can be solved using EAs with different encodings, and are challenging problems for EAs. Other features, such as special operators and local search heuristics and its hybridization with genetic algorithms, can also be taught using these puzzles. The authors report an experience using this method in a course taught at the Universidad de Alcalaacute, Madrid, Spain

A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem

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.

A comparison of memetic algorithms for the spread spectrum radar polyphase codes design problem

This paper presents three memetic algorithms to solve the spread spectrum radar polyphase code design problem, based on Evolutionary Programming, Particle Swarm Optimization and Differential Evolution, respectively. These global search heuristics are hybridized with a gradient-based local search procedure which includes a dynamic step adaptation procedure to perform accurate and efficient local search for better solutions. We have compared the different memetic algorithms proposed in several numerical examples, and we have also demonstrated the performance of our approaches against existing approaches for this problem.