An improved quantum-behaved particle swarm optimization algorithm based on linear interpolation

Shouyong Jiang*, Shengxiang Yang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Quantum-behaved particle swarm optimization (QPSO) has shown to be an effective algorithm for solving global optimization problems that are of high complexity. This paper presents a new QPSO algorithm, denoted LI-QPSO, which employs a model-based linear interpolation method to strengthen the local search ability and improve the precision and convergence performance of the QPSO algorithm. In LI-QPSO, linear interpolation is used to approximate the objective function around a pre-chosen point with high quality in the search space. Then, local search is used to generate a promising trial point around this pre-chosen point, which is then used to update the worst personal best point in the swarm. Experimental results show that the proposed algorithm provides some significant improvements in performance on the tested problems.

Original languageEnglish
Title of host publicationProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages769-775
Number of pages7
ISBN (Electronic)9781479914883
DOIs
Publication statusPublished - 16 Sep 2014
Event2014 IEEE Congress on Evolutionary Computation, CEC 2014 - Beijing, China
Duration: 6 Jul 201411 Jul 2014

Publication series

NameProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

Conference

Conference2014 IEEE Congress on Evolutionary Computation, CEC 2014
Country/TerritoryChina
CityBeijing
Period6/07/1411/07/14

Fingerprint

Dive into the research topics of 'An improved quantum-behaved particle swarm optimization algorithm based on linear interpolation'. Together they form a unique fingerprint.

Cite this