The Improvement of Fruit Fly Optimization Algorithm-Using Bivariable Function as Example

Article Preview

Abstract:

Optimization problems are always the hot issues in various research fields. The aim of this paper is to find the optimal value of the bivariable nonlinear function by means of the improved fruit fly optimization algorithm (G-FOA). Some better results are obtained. Compared with other algorithms, G-FOA is concise, can quickly find the global optimum with the high accuracy and without falling into local extremum. These advantages make the algorithm has good robustness and applicability.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

2952-2957

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] PAN Wen-chao. Fruit Fly Optimization Algorithm. Taipei: The Sea Press, 2011. pp.10-12.

Google Scholar

[2] PAN Wen-chao. Using Fruit Fly Optimization Algorithm Optimized General Regression Neural Network to Construct the Operating Performance of Enterprises Model. Journal of Taiyuan University of Technology(Social Sciences Edition), 2011, 39(4). pp.1-4.

Google Scholar

[3] Liu Hui. Application of Ant Colony Optimization for Searching All Function Extremum. Sichuan normal university: computational mathematics, (2010).

Google Scholar

[4] LIAN Zhi-gang, JIAO Bin. Particle-swarm optimization algorithm with mixed search. Control Theory & Applications. 2010, 27(10). pp.34-38.

Google Scholar

[5] ZHAO Zhigang, ZHANG Zhenwen and ZHANG Fugang. Simplified particle swarm optimization algorithm with adaptive extended operator. Computer Engineering and Applications, 2011, 47(18). pp.21-24.

Google Scholar

[6] WANG Han Yi, HE San. GA solving globe optimal problems of multi-peak RBF neural network model based on Matlab. Microcomputer & Its Applications. 2010, 13. pp.3-6.

Google Scholar

[7] HUANG Jian-guo, LUO Hang, WANG Hou-jun and LONG Bing. Prediction of Time Sequence Based on GA-BP Neural Net. Journal of University of Electronic Science and Technology of China, 2009, 38(5). pp.687-692.

Google Scholar

[8] ZHAO Ya-min and XU Jia-dong. Modified particle swarm optimization algorithm. Computer Engineering and Applications, 2010, 46(2). pp.31-33.

Google Scholar

[9] SHI Biao, LI Yu-xia, YU Xin-hua and YAN Wang. Short-term load forecast based on modified particle swarm optimizer and back propagation neural network model. Journal of Computer Applications, 2009, 29(4). pp.1036-1039.

DOI: 10.3724/sp.j.1087.2009.01036

Google Scholar

[10] LI Zuo-yong, WANG Jia-yang and GUO Chun. A New Method of BP Network Optimized Based on Particle Swarm Optimization and Simulation Test. Acta Electronica Sinica, 2008, 11(36). pp.2224-2228.

Google Scholar

[11] ZENG Wan-li, WEI Ren-yong and CHEN Hong-ling. Research and Application of BP Neural Network Based on Improved PSO Algorithm. Computer Technology and Development, 2008, 18(4). pp.49-51.

Google Scholar

[12] Zhu Xian and Ma Wei. A Biclustering Optimization Algorithm Based on Simulated Annealing and Cultural Annealing. Computer & Digital Engineering, 2008, 18(4). pp.49-51.

Google Scholar

[13] Feng Jian and Yue Qi. Solving TSP Problem by Using Simulated Annealing Algorithm. Forest Engineering, 2008, 24(01). pp.94-96.

Google Scholar