198 research outputs found
Characterisation of large changes in wind power for the day-ahead market using a fuzzy logic approach
Wind power has become one of the renewable resources with a major growth in the electricity market. However, due to its inherent variability, forecasting techniques are necessary for the optimum scheduling of the electric grid, specially during ramp events. These large changes in wind power may not be captured by wind power point forecasts even with very high resolution Numerical Weather Prediction (NWP) models. In this paper, a fuzzy approach for wind power ramp characterisation is presented. The main benefit of this technique is that it avoids the binary definition of ramp event, allowing to identify changes in power out- put that can potentially turn into ramp events when the total percentage of change to be considered a ramp event is not met. To study the application of this technique, wind power forecasts were obtained and their corresponding error estimated using Genetic Programming (GP) and Quantile Regression Forests. The error distributions were incorporated into the characterisation process, which according to the results, improve significantly the ramp capture. Results are presented using colour maps, which provide a useful way to interpret the characteristics of the ramp events
A Novel Grouping Harmony Search Algorithm for Clustering Problems
The problem of partitioning a data set into disjoint groups or clusters of related items plays a key role in data analytics, in particular when the information retrieval becomes crucial for further data analysis. In this context, clustering approaches aim at obtaining a good parti- tion of the data based on multiple criteria. One of the most challenging aspects of clustering techniques is the inference of the optimal number of clusters. In this regard, a number of clustering methods from the literature assume that the number of clusters is known a priori and sub- sequently assign instances to clusters based on distance, density or any other criterion. This paper proposes to override any prior assumption on the number of clusters or groups in the data at hand by hybridizing the grouping encoding strategy and the Harmony Search (HS) algorithm. The resulting hybrid approach optimally infers the number of clusters by means of the tailored design of the HS operators, which estimates this important structural clustering parameter as an implicit byproduct of the instance-to-cluster mapping performed by the algorithm. Apart from inferring the optimal number of clusters, simulation results ver- ify that the proposed scheme achieves a better performance than other na ̈ıve clustering techniques in synthetic scenarios and widely known data repositories
Cost-efficient deployment of multi-hop wireless networks over disaster areas using multi-objective meta-heuristics
Nowadays there is a global concern with the growing frequency and magnitude of natural disasters, many of them associated with climate change at a global scale. When tackled during a stringent economic era, the allocation of resources to efficiently deal with such disaster situations (e.g., brigades, vehicles and other support equipment for fire events) undergoes severe budgetary limitations which, in several proven cases, have lead to personal casualties due to a reduced support equipment. As such, the lack of enough communication resources to cover the disaster area at hand may cause a risky radio isolation of the deployed teams and ultimately fatal implications, as occurred in different recent episodes in Spain and USA during the last decade. This issue becomes even more dramatic when understood jointly with the strong budget cuts lately imposed by national authorities. In this context, this article postulates cost-efficient multi-hop communications as a technological solution to provide extended radio coverage to the deployed teams over disaster areas. Specifically, a Harmony Search (HS) based scheme is proposed to determine the optimal number, position and model of a set of wireless relays that must be deployed over a large-scale disaster area. The approach presented in this paper operates under a Pareto-optimal strategy, so a number of different deployments is then produced by balancing between redundant coverage and economical cost of the deployment. This information can assist authorities in their resource provisioning and/or operation duties. The performance of different heuristic operators to enhance the proposed HS algorithm are assessed and discussed by means of extensive simulations over synthetically generated scenarios, as well as over a more realistic, orography-aware setup constructed with LIDAR (Laser Imaging Detection and Ranging) data captured in the city center of Bilbao (Spain)
On the Creation of Diverse Ensembles for Nonstationary Environments using Bio-inspired Heuristics
Recently the relevance of adaptive models for dynamic data environments has turned into a hot topic due to the vast number of sce- narios generating nonstationary data streams. When a change (concept drift) in data distribution occurs, the ensembles of models trained over these data sources are obsolete and do not adapt suitably to the new distribution of the data. Although most of the research on the field is focused on the detection of this drift to re-train the ensemble, it is widely known the importance of the diversity in the ensemble shortly after the drift in order to reduce the initial drop in accuracy. In a Big Data sce- nario in which data can be huge (and also the number of past models), achieving the most diverse ensemble implies the calculus of all possible combinations of models, which is not an easy task to carry out quickly in the long term. This challenge can be formulated as an optimization prob- lem, for which bio-inspired algorithms can play one of the key roles in these adaptive algorithms. Precisely this is the goal of this manuscript: to validate the relevance of the diversity right after drifts, and to un- veil how to achieve a highly diverse ensemble by using a self-learning optimization technique
Evolutionary optimization of service times in interactive voice response systems
A call center is a system used by companies to provide a number of services to customers, which may vary from providing simple information to gathering and dealing with complaints or more complex transactions. The design of this kind of system is an important task, since the trend is that companies and institutions choose call centers as the primary option for customer relationship management. This paper presents an evolutionary algorithm based on Dandelion encoding to obtain near-optimal service trees which represent the structure of the desired call center. We introduce several modifications to the original Dandelion encoding in order to adapt it to the specific problem of service tree design. Two search space size reduction procedures improve the performance of the algorithm. Systematic experiments have been tackled in order to show the performance of our approach: first, we tackle different synthetic instances, where we discuss and analyze several aspects of the proposed evolutionary algorithm, and second, we tackle a real application, the design of the call center of an Italian telecommunications company. In all the experiments carried out we compare our approach with a lower bound for the problem based on information theory, and also with the results of a Huffman algorithm we have used for reference
A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem
This paper proposes an evolutionary algorithm with Dandelion-encoding to tackle the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem. This problem has been recently proposed, and consists of finding several broadcast trees from a source node, jointly considering traffic and delay constraints in trees. A version of the problem in which the source node is also included in the optimization process is considered as well in the paper. The Dandelion code used in the proposed evolutionary algorithm has been recently proposed as an effective way of encoding trees in evolutionary algorithms. Good properties of locality has been reported on this encoding, which makes it very effective to solve problems in which the solutions can be expressed in form of trees. In the paper we describe the main characteristics of the algorithm, the implementation of the Dandelion-encoding to tackled the DC-CMST problem and a modification needed to include the source node in the optimization. In the experimental section of this article we compare the results obtained by our evolutionary with that of a recently proposed heuristic for the DC-CMST. the Least Cost (LC) algorithm. We show that our Dandelion-encoded evolutionary algorithm is able to obtain better results that the LC in all the instances tackled. (C) 2008 Elsevier B.V. All rights reserved
A Hybrid Coral Reefs Optimization – Variable Neighborhood Search Approach for the Unequal Area Facility Layout Problem
The Unequal Area Facility Layout Problem (UA-FLP) is a relevant optimization problem related to industrial design, that deals with obtaining the most effective allocation of facilities, that make up the rectangular manufacturing plant layout. The UA-FLP is known to be a hard optimization problem, where meta-heuristic approaches are a good option to obtain competitive solutions. Many of these computational approaches, however, usually fall into local optima, and suffer from lack of diversity in their population, mainly due to the huge search spaces and hard fitness landscapes produced by the traditional representation of UA-FLP. To solve these issues, in this paper we propose a novel hybrid meta-heuristic approach, which combines a Coral Reefs Optimization algorithm (CRO) with a Variable Neighborhood Search (VNS) and a new representation for the problem, called Relaxed Flexible Bay Structure (RFBS), which simplifies the encoding and makes its fitness landscape more affordable. Thus, the use of VNS allows more intensive exploitation of the searching space with an affordable computational cost, as well as the RFBS allows better management of the free space into the plant layout. This combined strategy has been tested over a set of UA-FLP instances of different sizes, which have been previously tackled in the literature with alternative meta-heuristics. The tests results show very good performance in all cases
A novel adaptive density-based ACO algorithm with minimal encoding redundancy for clustering problems
In the so-called Big Data paradigm descriptive analytics are widely conceived as techniques and models aimed at discovering knowledge within unlabeled datasets (e.g. patterns, similarities, etc) of utmost help for subsequent predictive and prescriptive methods. One of these techniques is clustering, which hinges on different multi-dimensional measures of similarity between unsupervised data instances so as to blindly collect them in groups of clusters. Among the myriad of clustering approaches reported in the literature this manuscript focuses on those relying on bio-inspired meta-heuristics, which have been lately shown to outperform traditional clustering schemes in terms of convergence, adaptability and parallelization. Specifically this work presents a new clustering approach based on the processing fundamentals of the Ant Colony Optimization (ACO) algorithm, i.e. stigmergy via pheromone trails and progressive construction of solutions through a graph. The novelty of the proposed scheme beyond previous research on ACO-based clustering lies on a significantly pruned graph that not only minimizes the representation redundancy of the problem at hand, but also allows for an embedded estimation of the number of clusters within the data. However, this approach imposes a modified ant behavior so as to account for the optimality of entire paths rather than that of single steps within the graph. Simulation results over conventional datasets will evince the promising performance of our approach and motivate further research aimed at its applicability to real scenarios
Hybridizing Cartesian Genetic Programming and Harmony Search for Adaptive Feature Construction in Supervised Learning Problems
The advent of the so-called Big Data paradigm has motivated a flurry of research aimed at enhancing machine learning models by following very di- verse approaches. In this context this work focuses on the automatic con- struction of features in supervised learning problems, which differs from the conventional selection of features in that new characteristics with enhanced predictive power are inferred from the original dataset. In particular this manuscript proposes a new iterative feature construction approach based on a self-learning meta-heuristic algorithm (Harmony Search) and a solution encoding strategy (correspondingly, Cartesian Genetic Programming) suited to represent combinations of features by means of constant-length solution vectors. The proposed feature construction algorithm, coined as Adaptive Cartesian Harmony Search (ACHS), incorporates modifications that allow exploiting the estimated predictive importance of intermediate solutions and, ultimately, attaining better convergence rate in its iterative learning proce- dure. The performance of the proposed ACHS scheme is assessed and com- pared to that rendered by the state of the art in a toy example and three practical use cases from the literature. The excellent performance figures obtained in these problems shed light on the widespread applicability of the proposed scheme to supervised learning with legacy datasets composed by already refined characteristics
A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks
This paper explores the feasibility of a particular implemen- tation of a Grouping Harmony Search (GHS) algorithm to assign re- sources (codes, aggregate capacity, power) to users in Wide-band Code Division Multiple Access (WCDMA) networks. We use a problem for- mulation that takes into account a detailed modeling of loads factors, including all the interference terms, which strongly depend on the as- signment to be done. The GHS algorithm aims at minimizing a weighted cost function, which is composed of not only the detailed load factors but also resource utilization ratios (for aggregate capacity, codes, power), and the fraction of users without service. The proposed GHS is based on a particular encoding scheme (suitable for the problem formulation) and tailored Harmony Memory Considering Rate and Pitch Adjusting Rate processes. The experimental work shows that the proposed GHS algorithm exhibits a superior performance than that of the conventional approach, which minimizes only the load factors
- …