4,393 research outputs found
Feedback learning particle swarm optimization
This is the authorās version of a work that was accepted for publication in Applied Soft Computing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published and is available at the link below - Copyright @ Elsevier 2011In this paper, a feedback learning particle swarm optimization algorithm with quadratic inertia weight (FLPSO-QIW) is developed to solve optimization problems. The proposed FLPSO-QIW consists of four steps. Firstly, the inertia weight is calculated by a designed quadratic function instead of conventional linearly decreasing function. Secondly, acceleration coefficients are determined not only by the generation number but also by the search environment described by each particleās history best fitness information. Thirdly, the feedback fitness information of each particle is used to automatically design the learning probabilities. Fourthly, an elite stochastic learning (ELS) method is used to refine the solution. The FLPSO-QIW has been comprehensively evaluated on 18 unimodal, multimodal and composite benchmark functions with or without rotation. Compared with various state-of-the-art PSO algorithms, the performance of FLPSO-QIW is promising and competitive. The effects of parameter adaptation, parameter sensitivity and proposed mechanism are discussed in detail.This research was partially supported by the National Natural Science Foundation of PR China (Grant No 60874113), the Research Fund
for the Doctoral Program of Higher Education (Grant No 200802550007), the Key Creative Project of Shanghai Education Community (Grant No 09ZZ66), the Key Foundation Project of Shanghai(Grant No 09JC1400700), the International Science and Technology Cooperation Project of China under Grant 2009DFA32050, and the Alexander von Humboldt Foundation of Germany
Comparison of Evolutionary Optimization Algorithms for FM-TV Broadcasting Antenna Array Null Filling
Broadcasting antenna array null filling is a very
challenging problem for antenna design optimization. This paper
compares five antenna design optimization algorithms (Differential
Evolution, Particle Swarm, Taguchi, Invasive Weed, Adaptive
Invasive Weed) as solutions to the antenna array null filling
problem. The algorithms compared are evolutionary algorithms
which use mechanisms inspired by biological evolution, such as
reproduction, mutation, recombination, and selection. The focus of
the comparison is given to the algorithm with the best results,
nevertheless, it becomes obvious that the algorithm which produces
the best fitness (Invasive Weed Optimization) requires very
substantial computational resources due to its random search
nature
Efficiency Analysis of Swarm Intelligence and Randomization Techniques
Swarm intelligence has becoming a powerful technique in solving design and
scheduling tasks. Metaheuristic algorithms are an integrated part of this
paradigm, and particle swarm optimization is often viewed as an important
landmark. The outstanding performance and efficiency of swarm-based algorithms
inspired many new developments, though mathematical understanding of
metaheuristics remains partly a mystery. In contrast to the classic
deterministic algorithms, metaheuristics such as PSO always use some form of
randomness, and such randomization now employs various techniques. This paper
intends to review and analyze some of the convergence and efficiency associated
with metaheuristics such as firefly algorithm, random walks, and L\'evy
flights. We will discuss how these techniques are used and their implications
for further research.Comment: 10 pages. arXiv admin note: substantial text overlap with
arXiv:1212.0220, arXiv:1208.0527, arXiv:1003.146
Recommended from our members
Design Synthesis of Adaptive Mesoscopic Cellular Structures with Unit Truss Approach and Particle Swarm Optimization Algorithm
Cellular material structures have been engineered at the mesoscopic scale for high performance
and multifunctional capabilities. However, the design of adaptive cellular structures - structures with
cellular configurations, sizes, and shapes designed for a specific geometric and loading context - has
not been sufficiently investigated. In this paper, the authors present a design synthesis method with the
use of unit truss approach and particle swarm optimization algorithm to design adaptive cellular
structures. A critical review is presented to show the pros and cons of the new design synthesis method
and an existing homogenization method. The research extends the application of additive
manufacturing in the design of new materials for high performances and benefits its long-term growth.Mechanical Engineerin
Modeling preference time in middle distance triathlons
Modeling preference time in triathlons means predicting the intermediate
times of particular sports disciplines by a given overall finish time in a
specific triathlon course for the athlete with the known personal best result.
This is a hard task for athletes and sport trainers due to a lot of different
factors that need to be taken into account, e.g., athlete's abilities, health,
mental preparations and even their current sports form. So far, this process
was calculated manually without any specific software tools or using the
artificial intelligence. This paper presents the new solution for modeling
preference time in middle distance triathlons based on particle swarm
optimization algorithm and archive of existing sports results. Initial results
are presented, which suggest the usefulness of proposed approach, while remarks
for future improvements and use are also emphasized.Comment: ISCBI 201
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
- ā¦