925 research outputs found
Firefly Algorithm, Stochastic Test Functions and Design Optimisation
Modern optimisation algorithms are often metaheuristic, and they are very
promising in solving NP-hard optimization problems. In this paper, we show how
to use the recently developed Firefly Algorithm to solve nonlinear design
problems. For the standard pressure vessel design optimisation, the optimal
solution found by FA is far better than the best solution obtained previously
in literature. In addition, we also propose a few new test functions with
either singularity or stochastic components but with known global optimality,
and thus they can be used to validate new optimisation algorithms. Possible
topics for further research are also discussed.Comment: 12 pages, 11 figure
Bat Algorithm for Multi-objective Optimisation
Engineering optimization is typically multiobjective and multidisciplinary
with complex constraints, and the solution of such complex problems requires
efficient optimization algorithms. Recently, Xin-She Yang proposed a
bat-inspired algorithm for solving nonlinear, global optimisation problems. In
this paper, we extend this algorithm to solve multiobjective optimisation
problems. The proposed multiobjective bat algorithm (MOBA) is first validated
against a subset of test functions, and then applied to solve multiobjective
design problems such as welded beam design. Simulation results suggest that the
proposed algorithm works efficiently.Comment: 12 pages. arXiv admin note: text overlap with arXiv:1004.417
Bat Algorithm: Literature Review and Applications
Bat algorithm (BA) is a bio-inspired algorithm developed by Yang in 2010 and
BA has been found to be very efficient. As a result, the literature has
expanded significantly in the last 3 years. This paper provides a timely review
of the bat algorithm and its new variants. A wide range of diverse applications
and case studies are also reviewed and summarized briefly here. Further
research topics are also discussed.Comment: 10 page
Enhancing security of MME handover via fractional programming and Firefly algorithm
Key update and residence management have been investigated as an effective solution to cope with desynchronisation attacks in Mobility Management Entity (MME) handovers. In this paper, we first analyse the impacts of the Key Update Interval (KUI) and MME Residence Interval (MRI) on handover processes and their secrecy performance in terms of the Number of Exposed Packets (NEP), Signaling Overhead Rate (SOR) and Outage Probability of Vulnerability (OPV). Specifically, the bounds of the derived NEP and SOR not only capture their behaviours at the boundary of the KUI and MRI, but also show the trade-off between the NEP and SOR. Additionally, through the analysis of the OPV, it is shown that the handover security can be enhanced by shortening the KUI and the desynchonisation attacks can be avoided with high-mobility users. The above facts accordingly motivate us to propose a Multi- objective Optimisation (MO) problem to find the optimal KUI and MRI that minimise both the NEP and SOR subject to the constraint on the OPV. To this end, two scalarisation techniques are adopted to transform the proposed MO problem into single- objective optimisation problems, i.e., an achievement-function method via Fractional Programming (FP) and a weighted-sum method. Based on the derived bounds on NEP and SOR, the FP approach can be optimally solved via a simple numerical method. For the weighted-sum method, the Firefly Algorithm (FA) is utilised to find the optimal solution. The results show that both techniques can solve the proposed MO problem with a significantly reduced searching complexity compared to the conventional heuristic iterative search technique
Social Algorithms
This article concerns the review of a special class of swarm intelligence
based algorithms for solving optimization problems and these algorithms can be
referred to as social algorithms. Social algorithms use multiple agents and the
social interactions to design rules for algorithms so as to mimic certain
successful characteristics of the social/biological systems such as ants, bees,
bats, birds and animals.Comment: Encyclopedia of Complexity and Systems Science, 201
A Comprehensive Review of Recent Variants and Modifications of Firefly Algorithm
Swarm intelligence (SI) is an emerging field of biologically-inspired artificial intelligence based on the behavioral models of social insects such as ants, bees, wasps, termites etc. Swarm intelligence is the discipline that deals with natural and artificial systems composed of many individuals that coordinate using decentralized control and self-organization. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. In the last two decades, there has been a growing interest of addressing Dynamic Optimization Problems using SI algorithms due to their adaptation capabilities. This paper presents a broad review on two SI algorithms: 1) Firefly Algorithm (FA) 2) Flower Pollination Algorithm (FPA). FA is inspired from bioluminescence characteristic of fireflies. FPA is inspired from the the pollination behavior of flowering plants. This article aims to give a detailed analysis of different variants of FA and FPA developed by parameter adaptations, modification, hybridization as on date. This paper also addresses the applications of these algorithms in various fields. In addition, literatures found that most of the cases that used FA and FPA technique have outperformed compare to other metaheuristic algorithms
- …