A Novel Quantum-Inspired Approximate Dynamic Programming Algorithm for Unit Commitment Problems

DOI

10.2991/icmemtc-16.2016.248How to use a DOI?

Keywords

Approximate Dynamic Programming; Quantum Computing; Unit Commitment

Abstract

A novel quantum-inspired approximate dynamic programming algorithm (ADP) is proposed for solving unit commitment (UC) problems. The quantum computing theory is applied to tackle some new issues rising from ADP. In details, the unit states in UC problems are expressed by the quantum superposition. Then, the collapsing principle of quantum measurement is applied to solve the Bellman equation of ADP speedily. Based on the quantum rotation gate, the pre-decision states of the ADP are generated by quantum amplitude amplification technology. In the proposal algorithm, the quantum computation balances between state space exploration and exploitation automatically. Test cases of UC are performed to verify the feasibility of the proposal approximate algorithm for the range of 10 to 100 units with 24-hour with ramp rate constraints. The experimental results show that the quantum-inspired ADP algorithm can find the better sub-optimal solutions of large scale UC problems within a reasonable time.

Copyright

© 2016, 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  - Hua Qin
PY  - 2016/04
DA  - 2016/04
TI  - A Novel Quantum-Inspired Approximate Dynamic Programming Algorithm for Unit Commitment Problems
BT  - Proceedings of the 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control
PB  - Atlantis Press
SP  - 1257
EP  - 1262
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmemtc-16.2016.248
DO  - 10.2991/icmemtc-16.2016.248
ID  - Qin2016/04
ER  -