Conference Paper

An improved quantum-behaved particle swarm optimization algorithm

Sch. of Comput. & Inf., Shanghai Second Polytech. Univ., Shanghai, China
DOI: 10.1109/CAR.2010.5456744 Conference: Informatics in Control, Automation and Robotics (CAR), 2010 2nd International Asia Conference on, Volume: 2
Source: IEEE Xplore


Quantum-behaved particle swarm optimization (QPSO) algorithm is a global convergence guaranteed algorithm, which shows good search ability in many optimization problems. In this paper, we present an improved QPSO algorithm, called IQPSO, by combining QPSO and an opposition-based learning concept. Experimental studies on four well-known benchmark problems show that IQPSO achieves better results than QPSO and other variants of PSO on majority of test problems.

13 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Diverse forms of opposition are already existent virtually everywhere around us, and utilizing opposite numbers to accelerate an optimization method is a new idea. Since 2005, opposition-based learning is a fast growing research field in which a variety of new theoretical models and technical methods have been studied for dealing with complex and significant problems. As a result, an increasing number of works have thus proposed. This paper provides a survey on the state-of-the-art of research, reported in the specialized literature to date, related to this framework. This overview covers basic concepts, theoretical foundation, combinations with intelligent algorithms, and typical application fields. A number of challenges that can be undertaken to help move the field forward are discussed according to the current state of the opposition-based learning.
    Engineering Applications of Artificial Intelligence 03/2014; 29. DOI:10.1016/j.engappai.2013.12.004 · 2.21 Impact Factor