4,739 research outputs found
A Review of the Family of Artificial Fish Swarm Algorithms: Recent Advances and Applications
The Artificial Fish Swarm Algorithm (AFSA) is inspired by the ecological
behaviors of fish schooling in nature, viz., the preying, swarming, following
and random behaviors. Owing to a number of salient properties, which include
flexibility, fast convergence, and insensitivity to the initial parameter
settings, the family of AFSA has emerged as an effective Swarm Intelligence
(SI) methodology that has been widely applied to solve real-world optimization
problems. Since its introduction in 2002, many improved and hybrid AFSA models
have been developed to tackle continuous, binary, and combinatorial
optimization problems. This paper aims to present a concise review of the
family of AFSA, encompassing the original ASFA and its improvements,
continuous, binary, discrete, and hybrid models, as well as the associated
applications. A comprehensive survey on the AFSA from its introduction to 2012
can be found in [1]. As such, we focus on a total of {\color{blue}123} articles
published in high-quality journals since 2013. We also discuss possible AFSA
enhancements and highlight future research directions for the family of
AFSA-based models.Comment: 37 pages, 3 figure
A Winner Determination Algorithm for Combinatorial Auctions Based on Hybrid Artificial Fish Swarm Algorithm
AbstractThe problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm(HAFSA), which is combined with First Suite Heuristic Algorithm (FSHA) and Artificial Fish Swarm Algorithm (AFSA), is proposed to solve the problem after probing it base on the theories of AFSA. Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. Compared with Ant colony Optimization Algorithm, it has a good performance with broad and prosperous application
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
- …