An Elitist Transposon Quantum-Based Particle Swarm Optimization Algorithm for Economic Dispatch Problems

Angus Wu and Zhen-Lun Yang

Complexity, 2018, vol. 2018, 1-15

Abstract:

Population-based optimization algorithms are useful tools in solving engineering problems. This paper presents an elitist transposon quantum-based particle swarm algorithm to solve economic dispatch (ED) problems. It is a complex and highly nonlinear constrained optimization problem. The proposed approach, double elitist breeding quantum-based particle swarm optimization (DEB-QPSO), makes use of two elitist breeding strategies to promote the diversity of the swarm so as to enhance the global search ability and an improved efficient heuristic handling technique to manage the equality and inequality constraints of ED problems. Investigating on 15-unit, 40-unit, and 140-unit widely used test systems, through performance comparison, the proposed DEB-QPSO algorithm is able to obtain higher-quality solutions efficiently and stably superior than the other the state-of-the-art algorithms.

Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2018/7276585.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2018/7276585.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:7276585

DOI: 10.1155/2018/7276585

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().