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

Abstract EN

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.