Strategic bidding using fuzzy adaptive gravitational search algorithm in a pool based electricity market

A novel stochastic optimization approach to solve optimal bidding strategy problem in a pool based electricity market using fuzzy adaptive gravitational search algorithm (FAGSA) is presented. Generating companies (suppliers) participate in the bidding process in order to maximize their profits in an electricity market. Each supplier will bid strategically for choosing the bidding coefficients to counter the competitors bidding strategy. The gravitational search algorithm (GSA) is tedious to solve the optimal bidding strategy problem because, the optimum selection of gravitational constant (G). To overcome this problem, FAGSA is applied for the first time to tune the gravitational constant using fuzzy “IF/THEN” rules. The fuzzy rule-based systems are natural candidates to design gravitational constant, because they provide a way to develop decision mechanism based on specific nature of search regions, transitions between their boundaries and completely dependent on the problem. The proposed method is tested on IEEE 30-bus system and 75-bus Indian practical system and compared with GSA, particle swarm optimization (PSO) and genetic algorithm (GA). The results show that, fuzzification of the gravitational constant, improve search behavior, solution quality and reduced computational time compared against standard constant parameter algorithms.     

Simple control rules in a cooperative system for dynamic optimisation problems

The use of centralised, multi-threads cooperative systems, has emerged as a successful alternative to deal with static optimisation problems, avoiding the problem of selecting a particular, isolated strategy. However, when the problem to deal with becomes dynamic in some sense, the question as to whether those systems and the type of control rules employed to control the threads are useful or not remains open.

In this article, we depart from a strategy that joint uses a set of solutions and a set of simple agents, and we propose, compare and test two control rules for updating the former. The rules are a simple replacement frequency mechanism and a fuzzy set based one.

Computational experiments are performed on the moving peaks benchmark problem under different scenarios and the main conclusions are: first, the fuzzy set based rule is better than the frequency based rule and second, both rules are competitive when compared with a state-of-the-art algorithm.     

Harmony search-based hybrid stable adaptive fuzzy tracking controllers for vision-based mobile robot navigation

In this paper the harmony search (HS) algorithm and Lyapunov theory are hybridized together to design a stable adaptive fuzzy tracking control strategy for vision-based navigation of autonomous mobile robots. The proposed variant of HS algorithm, with complete dynamic harmony memory (named here as DyHS algorithm), is utilized to design two self-adaptive fuzzy controllers, for $x$ -direction and $y$ -direction movements of a mobile robot. These fuzzy controllers are optimized, both in their structures and free parameters, such that they can guarantee desired stability and simultaneously they can provide satisfactory tracking performance for the vision-based navigation of mobile robots. In addition, the concurrent and preferential combinations of global-search capability, utilizing DyHS algorithm, and Lyapunov theory-based local search method, are employed simultaneously to provide a high degree of automation in the controller design process. The proposed schemes have been implemented in both simulation and real-life experiments. The results demonstrate the usefulness of the proposed design strategy and shows overall comparable performances, when compared with two other competing stochastic optimization algorithms, namely, genetic algorithm and particle swarm optimization.     

A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification

Fuzzy rule-based systems (FRBSs) are well-known soft computing methods commonly used to tackle classification problems characterized by uncertainties and imprecisions. We propose a hybrid intelligent fruit fly optimization algorithm (FOA) to generate and classify fuzzy rules and select the best rules in a fuzzy if–then rule system. We combine a FOA and a heuristic algorithm in a hybrid intelligent algorithm. The FOA is used to create, evaluate and update triangular fuzzy rule-based and orthogonal fuzzy rule-based systems. The heuristic algorithm is used to calculate the certainty grade of the rules. The parameters in the proposed hybrid algorithm are tuned using the Taguchi method. An experiment with 27 benchmark datasets and a tenfold cross-validation strategy is designed and carried out to compare the proposed hybrid algorithm with nine different FRBSs. The results show that the hybrid algorithm proposed in this study is significantly more accurate than the nine competing FRBSs.

     

Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures

Statistical dependency analysis is the basis of all empirical science. A commonly occurring problem is to find the most significant dependency rules, which describe either positive or negative dependencies between categorical attributes. In medical science, for example, one is interested in genetic factors, which can either predispose or prevent diseases. The requirement of statistical significance is essential, because the discoveries should hold also in future data. Typically, the significance is estimated either by Fisher??s exact test or the ?? ²-measure. The problem is computationally very difficult, because the number of all possible dependency rules increases exponentially with the number of attributes. As a solution, different kinds of restrictions and heuristics have been applied, but a general, scalable search method has been missing. In this paper, we introduce an efficient algorithm, called Kingfisher, for searching for the best non-redundant dependency rules with statistical significance measures. The rules can express either positive or negative dependencies between a set of positive attributes and a single consequent attribute. The algorithm itself is independent from the used goodness measure, but we concentrate on Fisher??s exact test and the ?? ²-measure. The algorithm is based on an application of the branch-and-bound search strategy, supplemented by several pruning properties. Especially, we prove a new lower bound for Fisher??s p and introduce a new effective pruning principle. According to our experiments on classical benchmark data, the algorithm is well scalable and can efficiently handle even dense and high-dimensional data sets. An interesting observation was that Fisher??s exact test did not only produce more reliable rules than the ?? ²-measure, but it also performed the search much faster.     

Machine learning approach to model sport training

The aim of this study was to use a machine learning approach combining fuzzy modeling with an immune algorithm to model sport training, in particular swimming. A proposed algorithm mines the available data and delivers the results in a form of a set of fuzzy rules “IF (fuzzy conditions) THEN (class)”. Fuzzy logic is a powerful method to cope with continuous data, to overcome problem of overlapping class definitions, and to improve the rule comprehensibility. Sport training is modeled at the level of microcycle and training unit by 12 independent attributes. The data was collected in two months (February-March 2008), among swimmers from swimming sections in Wroc?aw, Poland. The swimmers had minimum of 7 years of training and reached the II class level in swimming classification from 2005 to 2008. The goal of the performed experiments was to find the rules answering the question - how does the training unit influence swimmer’s feelings while being in water the next day? The fuzzy rules were inferred for two different scales of the class to be predicted. The effectiveness of the learned set of rules reached 68.66%. The performance, in terms of classification accuracy, of the proposed approach was compared with traditional classifier schemes. The accuracy of the result of compared methods is significantly lower than the accuracy of fuzzy rules obtained by a method presented in this study (paired t-test, P < 0.05).     

Rules discovery in fuzzy classifier systems with PSO for scheduling in grid computational infrastructures

Particle swarm optimization (PSO) is a bio-inspired optimization strategy founded on the movement of particles within swarms. PSO can be encoded in a few lines in most programming languages, it uses only elementary mathematical operations, and it is not costly as regards memory demand and running time. This paper discusses the application of PSO to rules discovery in fuzzy classifier systems (FCSs) instead of the classical genetic approach and it proposes a new strategy, Knowledge Acquisition with Rules as Particles (KARP). In KARP approach every rule is encoded as a particle that moves in the space in order to cooperate in obtaining high quality rule bases and in this way, improving the knowledge and performance of the FCS. The proposed swarm-based strategy is evaluated in a well-known problem of practical importance nowadays where the integration of fuzzy systems is increasingly emerging due to the inherent uncertainty and dynamism of the environment: scheduling in grid distributed computational infrastructures. Simulation results are compared to those of classical genetic learning for fuzzy classifier systems and the greater accuracy and convergence speed of classifier discovery systems using KARP is shown.     

Cut-and-solve: An iterative search strategy for combinatorial optimization problems

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy which we refer to as cut-and-solve and prove optimality and termination for this method. This search is different from traditional tree search as there is no branching. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent solutions. When the constraining of the relaxed problem becomes tight enough, its solution value becomes no better than the incumbent solution value. At this point, the incumbent solution is declared to be optimal. This strategy is easily adapted to be an anytime algorithm as an incumbent solution is found at the root node and continuously updated during the search.Cut-and-solve enjoys two favorable properties. Since there is no branching, there are no “wrong” subtrees in which the search may get lost. Furthermore, its memory requirement is negligible. For these reasons, it has potential for problems that are difficult to solve using depth-first or best-first search tree methods.In this paper, we demonstrate the cut-and-solve strategy by implementing a generic version of it for the Asymmetric Traveling Salesman Problem (ATSP). Our unoptimized implementation outperformed state-of-the-art solvers for five out of seven real-world problem classes of the ATSP. For four of these classes, cut-and-solve was able to solve larger (sometimes substantially larger) problems. Our code is available at our websites.     

Linguistic fuzzy model identification based on PSO with different length of particles

To generate the structure and parameters of fuzzy rule base automatically, a particle swarm optimization algorithm with different length of particles (DLPPSO) is proposed in the paper. The main finding of the proposed approach is that the structure and parameters of a fuzzy rule base can be generated automatically by the proposed PSO. In this method, the best fitness (f_gbest) and the number (N_gbest) of active rules of the best particle in current generation, the best fitness (f_pbesti) which ith particle has achieved so far and the number (N_pbesti) of active rules of it when the best position emerged are utilized to determine the active rules of ith particle in each generation. To increase the diversity of structure, mutation operator is used to change the number of active rules for particles. Compared with some other PSOs with different length of particles, the algorithm has good adaptive performance. To indicate the effectiveness of the give algorithm, a nonlinear function and two time series are used in the simulation experiments. Simulation results demonstrate that the proposed method can approximate the nonlinear function and forecast the time series efficiently.     

基于改进遗传算法的模糊控制器设计

针对模糊控制器的隶属度函数和模糊控制规则的选取及优化缺乏自学习能力与知识采集的手段,以及遗传算法具有自适应、启发式、概率性、迭代式全局收敛的特点,该文章将遗传算法与模糊控制相结合,给出了一种基于改进遗传算法的模糊控制器设计策略.改进算法引入了分裂算子来避免遗传算法在寻优过程中陷入局部最优解,同时对编码方式、选择算子、交叉算子以及变异算子做了相应的调整与改进.并将此改进算法用于优化模糊控制器的隶属度函数与模糊控制规则.仿真结果表明用该改进算法优化后的模糊控制器较用普通遗传算法优化后的模糊控制器具有更好的控制性能.     

A multi-objective genetic algorithm with fuzzy c-means for automatic data clustering

This article presents a multi-objective genetic algorithm which considers the problem of data clustering. A given dataset is automatically assigned into a number of groups in appropriate fuzzy partitions through the fuzzy c-means method. This work has tried to exploit the advantage of fuzzy properties which provide capability to handle overlapping clusters. However, most fuzzy methods are based on compactness and/or separation measures which use only centroid information. The calculation from centroid information only may not be sufficient to differentiate the geometric structures of clusters. The overlap-separation measure using an aggregation operation of fuzzy membership degrees is better equipped to handle this drawback. For another key consideration, we need a mechanism to identify appropriate fuzzy clusters without prior knowledge on the number of clusters. From this requirement, an optimization with single criterion may not be feasible for different cluster shapes. A multi-objective genetic algorithm is therefore appropriate to search for fuzzy partitions in this situation. Apart from the overlap-separation measure, the well-known fuzzy J_m index is also optimized through genetic operations. The algorithm simultaneously optimizes the two criteria to search for optimal clustering solutions. A string of real-coded values is encoded to represent cluster centers. A number of strings with different lengths varied over a range correspond to variable numbers of clusters. These real-coded values are optimized and the Pareto solutions corresponding to a tradeoff between the two objectives are finally produced. As shown in the experiments, the approach provides promising solutions in well-separated, hyperspherical and overlapping clusters from synthetic and real-life data sets. This is demonstrated by the comparison with existing single-objective and multi-objective clustering techniques.     

Optimization of fuzzy rules design using genetic algorithm

Fuzzy rules optimization is a crucial step in the development of a fuzzy model. A simple two inputs fuzzy model will have more than ten thousand possible combinations of fuzzy rules. A fuzzy designer normally uses intuition and trial and error method for the rules assignment. This paper is devoted to the development and implementation of genetic optimization library (GOL) to obtain the optimum set of fuzzy rules. In this context, a fitness calculation to handle maximization and minimization problem is employed. A new fitness-scaling mechanism named as Fitness Mapping is also developed. The developed GOL is applied to a case study involving fuzzy expert system for machinability data selection (Wong SV, Hamouda AMS, Baradie M. Int J Flexi Automat Integr Manuf 1997;5(1/2):79–104). The main characteristics of genetic optimization in fuzzy rule design are presented and discussed. The effect of constraint (rules violation) application is also presented and discussed. Finally, the developed GOL replaces the tedious process of trial and error for better combination of fuzzy rules.     

Rule base reduction for knowledge-based fuzzy controllers with application to a vacuum cleaner

A rule base reduction and tuning algorithm is proposed as a design tool for the knowledge-based fuzzy control of a vacuum cleaner. Given a set of expert-based control rules in a fuzzy rule base structure, proposed algorithm computes the inconsistencies and redundancies in the overall rule set based on a newly proposed measure of equality of the individual fuzzy sets. An inconsistency and redundancy measure is proposed and computed for each rule in the rule base. Then the rules with high inconsistency and redundancy levels are removed from the fuzzy rule base without affecting the overall performance of the controller. The algorithm is successfully tested experimentally for the control of a commercial household vacuum cleaner. Experimental results demonstrate the effective use of the proposed algorithm.     

Top-down mining of frequent closed patterns from very high dimensional data

Frequent pattern mining is an essential theme in data mining. Existing algorithms usually use a bottom-up search strategy. However, for very high dimensional data, this strategy cannot fully utilize the minimum support constraint to prune the rowset search space. In this paper, we propose a new method called top-down mining together with a novel row enumeration tree to make full use of the pruning power of the minimum support constraint. Furthermore, to efficiently check if a rowset is closed, we develop a method called the trace-based method. Based on these methods, an algorithm called TD-Close is designed for mining a complete set of frequent closed patterns. To enhance its performance further, we improve it by using new pruning strategies and new data structures that lead to a new algorithm TTD-Close. Our performance study shows that the top-down strategy is effective in cutting down search space and saving memory space, while the trace-based method facilitates the closeness-checking. As a result, the algorithm TTD-Close outperforms the bottom-up search algorithms such as Carpenter and FPclose in most cases. It also runs faster than TD-Close.     

Spatial query processing for fuzzy objects

Range and nearest neighbor queries are the most common types of spatial queries, which have been investigated extensively in the last decades due to its broad range of applications. In this paper, we study this problem in the context of fuzzy objects that have indeterministic boundaries. Fuzzy objects play an important role in many areas, such as biomedical image databases and GIS communities. Existing research on fuzzy objects mainly focuses on modeling basic fuzzy object types and operations, leaving the processing of more advanced queries largely untouched. In this paper, we propose two new kinds of spatial queries for fuzzy objects, namely single threshold query and continuous threshold query, to determine the query results which qualify at a certain probability threshold and within a probability interval, respectively. For efficient single threshold query processing, we optimize the classical R-tree-based search algorithm by deriving more accurate approximations for the distance function between fuzzy objects and the query object. To enhance the performance of continuous threshold queries, effective pruning rules are developed to reduce the search space and speed up the candidate refinement process. The efficiency of our proposed algorithms as well as the optimization techniques is verified with an extensive set of experiments using both synthetic and real datasets.     

一种模糊神经网络控制器参数的混沌优化设计

通过模糊控制与神经网络相串联的方式构成模糊神经网络系统，然后提出一种基于模拟退火策略的混沌优化算法，将该算法引入模糊神经网络参数域中进行优化，实现混沌粗搜索与细搜索相结合优化目的，体现出具有更强的模糊神经网络参数全局最优解的搜索能力。采用该控制器对一个非线性对象进行控制。仿真实验表明，该方法能有效地实现模糊神经网络控制器参数优化，控制具有无振荡、超调小、调节时间短等优点，算法结构简单，容易实现。     

Efficient Self-Evolving Evolutionary Learning for Neurofuzzy Inference Systems

This study proposes an efficient self-evolving evolutionary learning algorithm (SEELA) for neurofuzzy inference systems (NFISs). The major feature of the proposed SEELA is that it is based on evolutionary algorithms that can determine the number of fuzzy rules and adjust the NFIS parameters. The SEELA consists of structure learning and parameter learning. The structure learning attempts to determine the number of fuzzy rules. A subgroup symbiotic evolution is adopted to yield several variable fuzzy systems, and an elite-based structure strategy is adopted to find a suitable number of fuzzy rules for solving a problem. The parameter learning is to adjust parameters of the NFIS. It is a hybrid evolutionary algorithm of cooperative particle swarm optimization (CPSO) and cultural algorithm, called cultural CPSO (CCPSO). The CCPSO, which uses cooperative behavior among multiple swarms, can increase the global search capacity using the belief space. Experimental results demonstrate that the proposed method performs well in predicting time series and solving nonlinear control problems.      

An events based algorithm for distributing concurrent tasks on multi-core architectures

In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application to a wide range of numerical simulation problems. Such problems involve time stepping or iteration algorithms where synchronization of multiple threads of execution is required. It is shown that traditional approaches to parallelism including message passing and scatter-gather can be improved upon in terms of speed-up and memory management. Using spatial decomposition to create orthogonal computational tasks, a new task management algorithm called H-Dispatch is developed. This algorithm makes efficient use of memory resources by limiting the need for garbage collection and takes optimal advantage of multiple cores by employing a “hungry” pull strategy. The technique is demonstrated on a simple finite difference solver and results are compared to traditional MPI and scatter-gather approaches. The H-Dispatch approach achieves near linear speed-up with results for efficiency of 85% on a 24-core machine. It is noted that the H-Dispatch algorithm is quite general and can be applied to a wide class of computational tasks on heterogeneous architectures involving multi-core and GPGPU hardware.     

Rule extraction by fuzzy modeling algorithm for fuzzy logic control of cisatracurium as a neuromuscular block

This paper provides two rule bases to control administration of cisatracurium, a non-depolarizing neuromuscular blocking agent. One rule base is extracted from the objective approach of fuzzy modeling algorithm (FMA), and the other is from the subjective approach of experts’ clinical experience. First, we established the data-acquisition system to record the manual neuromuscular block control during surgery. After collecting 15 patients data control by cisatracurium, we extracted six rules from these data via FMA. Another rule base also had six rules from experts with clinical anesthesia experience. Each rule-base was combined with three rules regarding the safety of the fuzzy controller. To compare their performance through simulations, we used the patient model established by our previous study which is a combination model consisting of a three-compartment mathematical model based on pharmacokinetics, and the Hill equation based on pharmacodynamics. In order to test the differences between these two rule-bases, the simulation used four disturbances: the different set points, the control interval strategy, the tolerance of noise effect, and the tolerance of delay time effect. The simulation shows that the FMA could successfully extract the fuzzy rules from the clinical data, and its control error is smaller than expert rules for different set point tests. However, the control error is increased and becomes worse when the set points are raised, which means that these two rule-bases are not appropriate to control the higher set points (i.e. T1% of 40 or higher). The t-test also shows that these two rule-bases performance of different set points have significant differences (p<0.05). Moreover, the results for control interval tests show that strategy has a significant influence, especially in reducing the standard deviation of control error. However, in simulations, these two rule-bases are not affected by noise disturbance, and the delay time affects only the overshoot for these two rule-bases.     

Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU

The Grover quantum search algorithm, one of only a few representative quantum algorithms, can speed up many classical algorithms that use search heuristics. No true quantum computer has yet been developed. For the present, simulation is one effective means of verifying the search algorithm. In this work, we focus on the simulation workflow using a compute unified device architecture (CUDA). Two simulation workflow schemes are proposed. These schemes combine the characteristics of the Grover algorithm and the parallelism of general-purpose computing on graphics processing units (GPGPU). We also analyzed the optimization of memory space and memory access from this perspective. We implemented four programs on CUDA to evaluate the performance of schemes and optimization. Through experimentation, we analyzed the organization of threads suited to Grover algorithm simulations, compared the storage costs of the four programs, and validated the effectiveness of optimization. Experimental results also showed that the distinguished program on CUDA outperformed the serial program of libquantum on a CPU with a speedup of up to 23 times (12 times on average), depending on the scale of the simulation.