University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A new fitness estimation strategy for particle swarm optimization

Sun, C, Zeng, J, Xue, S, Pan, J and Jin, Y (2013) A new fitness estimation strategy for particle swarm optimization Information Sciences, 221. pp. 355-370.

[img] Image
Published.pdf - ["content_typename_UNSPECIFIED" not defined]
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (1MB)
[img] PDF (licence)
SRI_deposit_agreement.pdf
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (33kB)

Abstract

Particle swarm optimization (PSO) is a global metaheuristic that has been proved to be very powerful for optimizing a wide range of problems. However, PSO requires a large number of fitness evaluations to find acceptable (optimal or sub-optimal) solutions. If one single evaluation of the objective function is computationally expensive, the computational cost for the whole optimization run will become prohibitive. FESPSO, a new fitness estimation strategy, is proposed for particle swarm optimization to reduce the number of fitness evaluations, thereby reducing the computational cost. Different from most existing approaches which either construct an approximate model using data or utilize the idea of fitness inheritance, FESPSO estimates the fitness of a particle based on its positional relationship with other particles. More precisely, Once the fitness of a particle is known, either estimated or evaluated using the original objective function, the fitness of its closest neighboring particle will be estimated by the proposed estimation formula. If the fitness of its closest neighboring particle has not been evaluated using the original objective function, the minimum of all estimated fitness values on this position will be adopted. In case of more than one particle is located at the same position, the fitness of only one of them needs to be evaluated or estimated. The performance of the proposed algorithm is examined on eight benchmark problems, and the experimental results show that the proposed algorithm is easy to implement, effective and highly competitive. © 2012 Elsevier Inc. All rights reserved.

Item Type: Article
Authors :
AuthorsEmailORCID
Sun, CUNSPECIFIEDUNSPECIFIED
Zeng, JUNSPECIFIEDUNSPECIFIED
Xue, SUNSPECIFIEDUNSPECIFIED
Pan, JUNSPECIFIEDUNSPECIFIED
Jin, YUNSPECIFIEDUNSPECIFIED
Date : 1 February 2013
Identification Number : https://doi.org/10.1016/j.ins.2012.09.030
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 10:50
Last Modified : 28 Mar 2017 10:50
URI: http://epubs.surrey.ac.uk/id/eprint/806700

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800