A novel simultaneous perturbation stochastic approximation particle swarm optimization algorithm for agricultural acreage evaluation

被引:0
|
作者
机构
[1] [1,2,Guo, Yonglong
[2] 1,Liu, Youzhao
[3] Hong, Jianping
[4] Bi, Rutian
[5] Yuan, Shaofeng
来源
Guo, Y. (gyonglong@yeah.net) | 1600年 / Binary Information Press卷 / 11期
关键词
ITS applications - Optimal performance - Particle swarm optimization algorithm - Regression model - Search spaces - Simultaneous perturbation - Simultaneous perturbation stochastic approximation - Stochastic approximations;
D O I
10.12733/jics20103224
中图分类号
学科分类号
摘要
In order to solve the shortcomings of traditional Particle Swarm Optimization (PSO) algorithm, this study is to propose a simultaneous perturbation stochastic approximation particle swarm optimization algorithm and its application in agricultural acreage evaluation. In this experiment, regression model is optimized by simultaneous perturbation stochastic approximation particle swarm optimization algorithm and traditional PSO algorithm respectively to show the superiority of simultaneous perturbation stochastic approximation particle swarm optimization algorithm to traditional particle swarm optimization algorithm in agricultural acreage evaluation. The experimental results show that the optimal performance of simultaneous perturbation stochastic approximation particle swarm optimization algorithm is better than that of traditional particle swarm optimization algorithm and application of simultaneous perturbation stochastic approximation particle swarm optimization algorithm in agricultural acreage evaluation is feasible. 1548-7741/Copyright © 2014 Binary Information Press.
引用
收藏
相关论文
共 50 条
  • [31] Stochastic search, optimization, and the simultaneous perturbation algorithm - A tutorial
    Spall, JC
    INTERNATIONAL CONFERENCE ON INTEGRATION OF KNOWLEDGE INTENSIVE MULTI-AGENT SYSTEMS: KIMAS'03: MODELING, EXPLORATION, AND ENGINEERING, 2003, : 676 - 677
  • [32] Stochastic optimization problem through particle swarm optimization algorithm
    He, Fangguo
    Chen, Wenlue
    NSWCTC 2009: INTERNATIONAL CONFERENCE ON NETWORKS SECURITY, WIRELESS COMMUNICATIONS AND TRUSTED COMPUTING, VOL 2, PROCEEDINGS, 2009, : 692 - 695
  • [33] A novel particle swarm optimization algorithm with stochastic focusing search for real-parameter optimization
    Wang Weibo
    Feng Quanyuan
    Zheng Yongkang
    2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 2008, : 583 - +
  • [34] Simultaneous Replanning with Vectorized Particle Swarm Optimization Algorithm
    Biswas, Surnana
    Anavatti, Sreenatha G.
    Garrott, Matthew A.
    Pratarna, Mahardhika
    2016 14TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION (ICARCV), 2016,
  • [35] A Novel Particle Swarm Optimization Algorithm for Global Optimization
    Wang, Chun-Feng
    Liu, Kui
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2016, 2016
  • [36] Optimal design of arch dams subjected to earthquake loading by a combination of simultaneous perturbation stochastic approximation and particle swarm algorithms
    Seyedpoor, S. M.
    Salajegheh, J.
    Salajegheh, E.
    Gholizadeh, S.
    APPLIED SOFT COMPUTING, 2011, 11 (01) : 39 - 48
  • [37] A Novel Hybrid Particle Swarm Optimization Algorithm
    Chen, Lei
    SUSTAINABLE DEVELOPMENT AND ENVIRONMENT II, PTS 1 AND 2, 2013, 409-410 : 1611 - 1614
  • [38] Gaussian swarm: A novel particle optimization algorithm
    Krohling, RA
    2004 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2004, : 372 - 376
  • [39] Evaluation of a particle swarm algorithm for biomechanical optimization
    Schutte, JF
    Koh, BI
    Reinbolt, JA
    Haftka, RT
    George, AD
    Fregly, BJ
    JOURNAL OF BIOMECHANICAL ENGINEERING-TRANSACTIONS OF THE ASME, 2005, 127 (03): : 465 - 474
  • [40] A Particle Swarm Optimization Algorithm With Novel Expected Fitness Evaluation for Robust Optimization Problems
    Luan, Feng
    Choi, Jong-Ho
    Jung, Hyun-Kyo
    IEEE TRANSACTIONS ON MAGNETICS, 2012, 48 (02) : 331 - 334