5 research outputs found

    A scattering and repulsive swarm intelligence algorithm for solving global optimization problems

    Get PDF
    The firefly algorithm (FA), as a metaheuristic search method, is useful for solving diverse optimization problems. However, it is challenging to use FA in tackling high dimensional optimization problems, and the random movement of FA has a high likelihood to be trapped in local optima. In this research, we propose three improved algorithms, i.e., Repulsive Firefly Algorithm (RFA), Scattering Repulsive Firefly Algorithm (SRFA), and Enhanced SRFA (ESRFA), to mitigate the premature convergence problem of the original FA model. RFA adopts a repulsive force strategy to accelerate fireflies (i.e. solutions) to move away from unpromising search regions, in order to reach global optimality in fewer iterations. SRFA employs a scattering mechanism along with the repulsive force strategy to divert weak neighbouring solutions to new search regions, in order to increase global exploration. Motivated by the survival tactics of hawk-moths, ESRFA incorporates a hovering-driven attractiveness operation, an exploration-driven evading mechanism, and a learning scheme based on the historical best experience in the neighbourhood to further enhance SRFA. Standard and CEC2014 benchmark optimization functions are used for evaluation of the proposed FA-based models. The empirical results indicate that ESRFA, SRFA and RFA significantly outperform the original FA model, a number of state-of-the-art FA variants, and other swarm-based algorithms, which include Simulated Annealing, Cuckoo Search, Particle Swarm, Bat Swarm, Dragonfly, and Ant-Lion Optimization, in diverse challenging benchmark functions

    An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems

    Get PDF
    Recently, interest in solving real-world problems that change over the time, so called dynamic optimisation problems (DOPs), has grown due to their practical applications. A DOP requires an optimisation algorithm that can dynamically adapt to changes and several methodologies have been integrated with population-based algorithms to address these problems. Multi-population algorithms have been widely used, but it is hard to determine the number of populations to be used for a given problem. This paper proposes an adaptive multi-population artificial bee colony (ABC) algorithm for DOPs. ABC is a simple, yet efficient, nature inspired algorithm for addressing numerical optimisation, which has been successfully used for tackling other optimisation problems. The proposed ABC algorithm has the following features. Firstly it uses multi-populations to cope with dynamic changes, and a clearing scheme to maintain the diversity and enhance the exploration process. Secondly, the number of sub-populations changes over time, to adapt to changes in the search space. The moving peaks benchmark DOP is used to verify the performance of the proposed ABC. Experimental results show that the proposed ABC is superior to the ABC on all tested instances. Compared to state of the art methodologies, our proposed ABC algorithm produces very good results

    A New Soft Computing Method for K-Harmonic Means Clustering.

    No full text
    The K-harmonic means clustering algorithm (KHM) is a new clustering method used to group data such that the sum of the harmonic averages of the distances between each entity and all cluster centroids is minimized. Because it is less sensitive to initialization than K-means (KM), many researchers have recently been attracted to studying KHM. In this study, the proposed iSSO-KHM is based on an improved simplified swarm optimization (iSSO) and integrates a variable neighborhood search (VNS) for KHM clustering. As evidence of the utility of the proposed iSSO-KHM, we present extensive computational results on eight benchmark problems. From the computational results, the comparison appears to support the superiority of the proposed iSSO-KHM over previously developed algorithms for all experiments in the literature

    A Case Study of Control and Improved Simplified Swarm Optimization for Economic Dispatch of a Stand-Alone Modular Microgrid

    No full text
    Due to the complex configuration and control framework, the conventional microgrid is not cost-effective for engineering applications with small or medium capacity. A stand-alone modular microgrid with separated AC bus and decentralized control strategy is proposed in this paper. Each module is a self-powered system, which consists of wind and solar power, a storage battery, load and three-port converter. The modules are interconnected by three-port converters to form the microgrid. Characteristics, operation principle, control of the modular microgrid and the three-port converter are analyzed in detail. Distributed storage batteries enable power exchanges among modules to enhance economic returns. Economic dispatch of the stand-alone modular microgrid is a mixed-integer programming problem. A day-ahead operation optimization model including fuel cost, battery operation cost, and power transmission cost is established. Because there are so many constraints, it is difficult to produce a feasible solution and even more difficult to have an improved solution. An improved simplified swarm optimization (iSSO) method is therefore proposed. The iSSO scheme designs the new update mechanism and survival of the fittest policy. The experimental results from the demonstration project on DongAo Island reflect the effectiveness of the stand-alone modular microgrid and the economic dispatch strategy based on the iSSO method
    corecore