A Chaos Quantum Immune Algorithm for Generation Expansion Planning

DOI

10.2991/ameii-15.2015.225How to use a DOI?

Keywords

Generation Expansion Planning; Immune Algorithm; Quantum Searching; Chaos Optimization

Abstract

By integrating the ergodicity of chaos searching and the high efficiency of quantum computation into immune optimization, a novel chaos quantum immune algorithm for Generation Expansion Planning computation is presented. In this algorithm, antibodies in colonies are coded by quantum bits and updated by quantum rotation gates. To change phase of qubit, two different chaos variables are introduced into the quantum rotation gate. The one with the relatively small amplitude performs the cloning of excellent individuals to implement the local searching, and the other one with the relatively large amplitude performs the mutation of inferior individuals to realize the global searching. The convergence of the proposed algorithm has been proved. The experimental results indicate that the algorithm remarkably improves the convergence performance and the search efficiency of the immune optimization algorithm.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Li Xiao
PY  - 2015/04
DA  - 2015/04
TI  - A Chaos Quantum Immune Algorithm for Generation Expansion Planning
BT  - Proceedings of the International Conference on Advances in Mechanical Engineering and Industrial Informatics
PB  - Atlantis Press
SP  - 1215
EP  - 1219
SN  - 2352-5401
UR  - https://doi.org/10.2991/ameii-15.2015.225
DO  - 10.2991/ameii-15.2015.225
ID  - Xiao2015/04
ER  -