A Particle Pair Optimization Algorithm

Hai Yan Quan; Zeng Li Liu

doi:10.4028/www.scientific.net/AMR.655-657.959

Paper Titles

Asymmetric Separators and Asymmetric Separator Spaces
p.936

Bacterial Foraging Algorithm Based on PSO with Adaptive Inertia Weigh for Solving Nonlinear Equations Systems
p.940

Bacterial Foraging Algorithm Based on Quantum-Behaved Particle Swarm Optimization for Global Optimization
p.948

Robust Optimization Based on an Improved Genetic Algorithm
p.955

A Particle Pair Optimization Algorithm
p.959

A Kind of Classification Algorithms of Data Mining and Quantitative Analysis
p.963

Image Recognition Based on Chaotic-Particle Swarm-Optimization-Neural Network Algorithm
p.969

Denoising Power Quality Signal Using Savitzky-Golay Based on Virtual Instrument
p.974

Researches on Channel Mismatch Effects in Time-Interleaved ADC System
p.978

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 655-657A Particle Pair Optimization Algorithm

A Particle Pair Optimization Algorithm

Abstract:

The paper proposes a particle pair optimization (PPO) algorithm for numerical optimization. In the paper, a particle pair search(PPS) is designed. Based on PPS, the competitive roulette strategy is employed to the selection of particle pair from swarm, and a particle pair optimization algorithm is proposed. In the experiments, PPO is applied to solve the 12 benchmark problem, and compared with fast evolutionary programming (FEP). The results demonstrate that PPO algorithm can find optima or close-to-optimal solutions of the complex functions with high-dimension, and the search of PPO is stable and efficient.

You might also be interested in these eBooks

Engineering Solutions for Manufacturing Processes

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 655-657)

Pages:

959-962

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.655-657.959

Citation:

Cite this paper

Online since:

January 2013

Authors:

Hai Yan Quan, Zeng Li Liu

Keywords:

Competitive Roulette Strategy, Numerical Optimization, Particle Pair Search, Swarm Optimization Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Holland J H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Application to Biology, Control and Artificial Intelligence, 2nd edition. Cambridge, MA: MIT Press, (1992).

Google Scholar

[2] Kennedy J, Mendes R. Population structure and particle swarm performance. Proc. of the IEEE CEC [C]. 2002: 1671-1676.

Google Scholar

[3] K V Price, R M Storn, J A Lampinen (Eds. ). Differential Evolution: A Practical Approach to Global Optimization [M]. Springer Natural Computing Series, (2005).

Google Scholar

[4] Dervis Karaboga, Bahriye Basturk. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 2007; 39(3): 459-471.

DOI: 10.1007/s10898-007-9149-x

Google Scholar

[5] X Yao, Y Liu, and G Lin. Evolutionary programming made faster. IEEE Trans. Evolutionary Computation [J], 1999, Vol. 3(No. 2): 82–102.

DOI: 10.1109/4235.771163

Google Scholar

[6] Y. W. Leung and Y. Wang. An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput. 2001; 5(1): 41–53.

DOI: 10.1109/4235.910464

Google Scholar