Solving Distributed Unit Commitment Problem With Walrasian Auction
提出用瓦尔拉斯拍卖让多个自主分布式代理协同求解机组组合问题，能同时决定机组的启停模式和发电水平，实验验证了有效性。
In the process of scheduling multiple generating units, an up/down decision for every generating unit has to be made for every hour on the planning horizon. Once the unit commitment is decided for every generating unit, a generation level (economic dispatch) from the committed unit is calculated to minimize the total operation cost. Such a problem is known as a unit commitment problem (UCP). Because an up/down pattern is expressed with a vector of binary variables, one has to solve a combinatorial optimization problem. Due to electricity liberalization or the introduction of distributed power sources in recent years, the need to solve the UCP by autonomous distributed agents, that is, solving distributed UCP (DUCP), comes about. This paper proposes a method of solving the DUCP with a Walrasian auction. The main feature of the proposed method is that not only a generation-level pattern but also an up/down pattern can be determined. The results of computational experiments show that the DUCP is solved through the cooperation of autonomous distributed agents by using the proposed method.