Curvature Flight Path for Particle Swarm Optimisation
Authors: 
Cheng Wai Kheng, Day Chyi Ku, Hui Fuang Ng, Mahmoud Khattab, Siang Yew ChongAuthors Info & Claims
Pages 29 - 36
Abstract
An optimisation is a process of finding maxima or minima of the objective function. Particle Swarm Optimisation (PSO) is a nature-inspired, meta-heuristic, black box optimisation algorithm used to search for global minimum or maximum in the solution space. The sampling strategy in this algorithm mimics the flying pattern of a swarm, where each sample is generated randomly according to uniform distribution among three different locations, which marks the current particle location, the individual best found location, and the best found location for the entire swam over all generation. The PSO has known disadvantage of premature convergence in problems with high correlated design variables (high epistatis). However, there is limited research conducted in finding the main reason why the algorithm fails to locate better solutions in these problems. In this paper, we propose to change the traditional triangular flight trajectory of PSO to an elliptical flight path. The new flying method is tested and compared with the traditional triangular flight trajectory of PSO on five high epistatis benchmark problems. Our results show that the samples generated from the elliptical flight path are generally better than the traditional triangular flight trajectory of PSO in term of average fitness and the fitness of best found solution.
References
[1]
A. Banks, J. Vincent, and C. Anyakoha. A review of particle swarm optimization. part i: background and development. Natural Computing, 6(4):467--484, 2007.
[2]
X. Chen, Q. Gu, J. Qi, and D. Chen. Applying particle swarm optimization to pairwise testing. In Computer Software and Applications Conference (COMPSAC), 2010 IEEE 34th Annual, pages 107--116, July 2010.
[3]
M. Daneshyari and G. G. Yen. Cultural-based multiobjective particle swarm optimization. IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics, 41(2):553--567, 2011.
[4]
M. Daneshyari and G. G. Yen. Cultural multiobjective pso with sensitivity analysis for parameters using additive binary epsion indicator. International Journal of Computational Intelligence and Applications, 10(2):121--139, 2011.
[5]
M. Daneshyari and G. G. Yen. Cultural based particle swarm for dynamic optimization problems. International Journal of Systems Science, 43(7):1284--1304, 2012.
[6]
Y. F. M. Ding. Phase angle-encoded and quantum-behaved particle swarm optimization applied to three-dimensional route planning for uav. IEEE Transactions on Systems. Man and Cybernetics- Part A: Systems and Humans, 42(2):511--526, 2012.
[7]
Z. X. Fengrui Zhang, Jiangshu Cao. An improved particle swarm optimization filtering algorithm. In International Conference on Communications, Circuits and Systems (ICCCAS), volume 2, pages 173--177, 2013.
[8]
R. Gras. How efficient are genetic algorithms to solve high epistasis deceptive problems? In Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on, pages 242--249, June 2008.
[9]
N. Hansen. Cma-es source code. https://www.lri.fr/hansen/purecmaes.m, 2003--2009. Accessed: 2016-01--17.
[10]
N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evol. Comput., 9(2):159--195, June 2001.
[11]
K. A. D. Jong. Evolutionary Computation: A Unified Approach. Prentice Hall of India Private Limited, 2006.
[12]
A. A. Kadkol and G. G. Yen. A cultural-based particle swarm optimization framework for dynamic, constrained multi-objective optimization. International Journal of Swarm Intelligence Research, 3(1):1--29, 2012.
[13]
J. Kennedy and R. Eberhart. Particle swarm optimization. In Proceeding of IEEE International Conference on neural networks, volume 4, pages 1942--1948, 1995.
[14]
G. R. Maarten Keijzer, Juan J. Merelo Guervós and M. Schoenauer. Evolving objects:a general purpose evolutionary computation library. Artificial Evolution, 2310:829--888, 2002.
[15]
T. no free lunch and problem description length. Fitness-distance-ratio based particle swarm optimization. In In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 565--570, 2001.
[16]
J. Nocedal and S. Wright. Numerical Optimization. Springer-Verlag, 1999.
[17]
K. V. Thanmaya Peram and C. K. Mohan. Fitness-distance-ratio based particle swarm optimization. In Proceedings of the 2003 IEEESwarm Intelligence Symposium, volume 3, pages 174--181, 2003.
[18]
D. Wierstra, T. Schaul, T. Glasmachers, Y. Sun, J. Peters, and J. Schmidhuber. Natural evolution strategies. The Journal of Machine Learning Research, 15(1):949--980, 2014.
[19]
W. T. V. William H. Press, Saul A. Teukolsky and B. P. Flannery. Numerical Recipes. Cambridge University Press, 2007.
[20]
D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67--82, 1997.
[21]
X.-S. Yang. Firefly algorithms for multimodal optimization. In In Stochastic Algorithms: Foundations and Applications (SAGA 2009), pages 169--178, 2009.
[22]
X.-S. Yang. A new metaheuristic bat-inspired algorithm. In In Nature Inspired Cooperative Strategies for Optimization (NISCO2010), pages 65--74, 2010.
[23]
X.-S. Yang and S. Deb. Cuckoo search via lévy flights. In In World Congress on Nature and Biological Inspired Computing (NaBIC2009), pages 210--214, 2009.
[24]
G. G. Yen and Z. He. Performance metrics ensemble for multiobjective evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 18(1):131 -- 144, 2014.
Index Terms
- Curvature Flight Path for Particle Swarm Optimisation
Recommendations
An enhanced particle swarm optimization with levy flight for global optimization
Enhanced PSO with levy flight.Random walk of the particles.High convergence rate.Provides solution accuracy and robust. Hüseyin Haklı and Harun Uguz (2014) proposed a novel approach for global function optimization using particle swarm optimization with ...
A fuzzy adaptive turbulent particle swarm optimisation
Particle Swarm Optimisation (PSO) algorithm is a stochastic search technique, which has exhibited good performance across a wide range of applications. However, very often for multimodal problems involving high dimensions, the algorithm tends to suffer ...
Dynamic task scheduling with load balancing using parallel orthogonal particle swarm optimisation
This paper presents a novel approach for dynamic task scheduling using particle swarm optimisation. Particle swarm optimisation (PSO) is a population-based meta-heuristic method which can be used to solve np-hard problems. The algorithm has been ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2016
1196 pages
ISBN:9781450342063
DOI:10.1145/2908812
- Editor:
- Tobias Friedrich,
- General Chair:
- Frank Neumann,
- Program Chair:
- Andrew M. Sutton
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 July 2016
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- UTARRF
Conference
GECCO '16
Sponsor:
Acceptance Rates
GECCO '16 Paper Acceptance Rate 137 of 381 submissions, 36%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 136Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in