Zone division models and algorithms in zonal pricing power market
✍ Scribed by Ruiyou Zhang; Shui Han; Jinzhu Zhang; Dingwei Wang
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 100 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1430-144X
- DOI
- 10.1002/etep.236
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Zone division is a major problem in new electricity trading arrangements (NETA) and some other zone‐pricing power markets. However, the research efforts in this field are very limited. Therefore, a kind of zone division problem is primarily studied in this paper. The concept of zone of a node set is proposed and defined as the minimum‐girthed convex polygon containing these nodes, which can help us implement the proximity of nodes within groups in geographical locations. Furthermore, two combinatorial optimization models for given group number and minimizing the group number are built. Two algorithms based on tabu search (TS) and embedded by TS are developed to solve the models. Finally, the models are tested and proved by a real‐life example from the northeastern grid of China. Compared to the existing methods, the proposed method is auto‐operable and electrical‐information based, and hence applicable. Copyright © 2008 John Wiley & Sons, Ltd.