Search

In rough set theory, a construct is an attribute subset with the same ability to discern objects belonging to different classes as the whole set of attributes, while maintaining the similarity between objects belonging to the same class. Although algorithms for reducts computation can be adapted to compute constructs, practical problems exist where these algorithms cannot compute all constructs within a reasonable time frame. Therefore, this paper introduces an algorithm for computing all constructs of a decision system. The results of experiments with various decision systems (both artificial and real-world) suggest that our algorithm is, in most cases, faster than the state-of-the-art algorithms when the simplified binary discernibility–similarity matrix has a density of less than 0.29. [ABSTRACT FROM AUTHOR]

Hybridized algorithms are commonly employed to improve the performance of any existing method. However, an optimal learning algorithm composed of evolutionary and swarm intelligence can radically improve the quality of the final neuron states and has not received creative attention yet. Considering this issue, this paper presents a novel metaheuristics algorithm combined with several objectives—introduced as the Hybrid Election Algorithm (HEA)—with great results in solving optimization and combinatorial problems over a binary search space. The core and underpinning ideas of this proposed HEA are inspired by socio-political phenomena, consisting of creative and powerful mechanisms to achieve the optimal result. A non-systematic logical structure can find a better phenomenon in the study of logic programming. In this regard, a non-systematic structure known as Random k Satisfiability (RANkSAT) with higher-order is hosted here to overcome the interpretability and dissimilarity compared to a systematic, logical structure in a Discrete Hopfield Neural Network (DHNN). The novelty of this study is to introduce a new multi-objective Hybrid Election Algorithm that achieves the highest fitness value and can boost the storage capacity of DHNN along with a diversified logical structure embedded with RANkSAT representation. To attain such goals, the proposed algorithm tested four different types of algorithms, such as evolutionary types (Genetic Algorithm (GA)), swarm intelligence types (Artificial Bee Colony algorithm), population-based (traditional Election Algorithm (EA)) and the Exhaustive Search (ES) model. To check the performance of the proposed HEA model, several performance metrics, such as training–testing, energy, similarity analysis and statistical analysis, such as the Friedman test with convergence analysis, have been examined and analyzed. Based on the experimental and statistical results, the proposed HEA model outperformed all the mentioned four models in this research. [ABSTRACT FROM AUTHOR]

The paper introduces a new approach to enhance optimization algorithms when solving the piecewise linearization problem of a given function. Eight swarm intelligence algorithms were selected to be experimentally compared. The problem is represented by the calculation of the distance between the original function and the estimation from the piecewise linear function. Here, the piecewise linearization of 2D functions is studied. Each of the employed swarm intelligence algorithms is enhanced by a newly proposed automatic detection of the number of piecewise linear parts that determine the discretization points to calculate the distance between the original and piecewise linear function. The original algorithms and their enhanced variants are compared on several examples of piecewise linearization problems. The results show that the enhanced approach performs sufficiently better when it creates a very promising approximation of functions. Moreover, the degree of precision is slightly decreased by the focus on the speed of the optimization process. [ABSTRACT FROM AUTHOR]

Among all the conventional maximum power point tracking (MPPT) techniques for a photovoltaic (PV) system that have been proposed, incremental conductance (INC) and perturb and observe (P&O) are the most popular because of their simplicity and ease of implementation. However, under partial shading conditions (PSCs), these MPPT algorithms fail to track the global maximum power point (GMPP) and instead converge into local maximum power points (LMPPs), resulting in considerable PV power loss. This paper presents a new hybrid MPPT technique combining the artificial bee colony (ABC) and P&O algorithms named ABC-P&O. The P&O technique is used to track the MPP under uniform irradiance, and only during irradiance variations is the ABC algorithm employed. The effectiveness of the proposed hybrid algorithm at tracking the GMPP, under both uniform and nonuniform irradiance conditions, was assessed by hardware-in-the-loop (HIL) tests employed by a dc–dc boost converter. Then, the ABC-P&O strategy was applied to obtain the voltage reference for the outer PI control loop, which provided the current reference to the discrete-time sliding-mode current control. The ABC-P&O algorithm has a reasonable computational cost, allowing the use of a commercial, low-priced digital signal controller (DSC) with outer voltage and inner current control loops. Many challenging tests validated that the proposed ABC-P&O technique converges fast to the GMPP with high efficiency and superior performance under different PSCs. [ABSTRACT FROM AUTHOR]

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the intention of improving its exploitation tendency. Furthermore, the shuffle mutation operator is applied to the created solutions in both bee phases to help the search achieve a better balance between the global exploration and local exploitation abilities and to provide a valuable convergence speed. The experimental results, obtained by testing on seven integer programming problems and ten minimax problems, show that the overall performance of the proposed approach is superior to the ABC. Additionally, it obtains competitive results compared with other state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

This paper deals with the numerical solutions and convergence analysis for general singular Lane–Emden type models of fractional order, with appropriate constraint initial conditions. A modified reproducing kernel discretization technique is used for dealing with the fractional Atangana–Baleanu–Caputo operator. In this tendency, novel operational algorithms are built and discussed for covering such singular models in spite of the operator optimality used. Several numerical applications using the well-known fractional Lane–Emden type models are examined, to expound the feasibility and suitability of the approach. From a numerical viewpoint, the obtained results indicate that the method is intelligent and has several features stability for dealing with many fractional models emerging in physics and mathematics, using the new presented derivative. [ABSTRACT FROM AUTHOR]