期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 300, 期 2, 页码 713-726出版社
ELSEVIER
DOI: 10.1016/j.ejor.2021.10.007
关键词
OR in energy; Day-ahead electricity market clearing problem; Mixed-integer linear programming; Benders decomposition
This study focuses on the day-ahead electricity market clearing problem in the European electricity markets. The Benders decomposition algorithm is revisited and new valid inequalities are developed to enhance its performance. Experiments are conducted using instances that mimic the characteristics of past bids in the Turkish day-ahead electricity market. Comparison among different algorithms shows that the price-based cuts improve the performance of the Benders decomposition algorithm and outperform the primal-dual algorithm.
We study the day-ahead electricity market clearing problem under the prevailing market design in the European electricity markets. We revisit the Benders decomposition algorithm that has been used to solve this problem. We develop new valid inequalities that substantially improve the performance of the algorithm. We generate instances that mimic the characteristics of past bids of the Turkish day-ahead electricity market and conduct experiments. We use two leading mixed-integer programming solvers, IBM ILOG Cplex and Gurobi, in order to assess the impact of employed solver on the algorithm performance. We compare the performances of our algorithm, the primal-dual algorithm, and the Benders decomposition algorithm using the existing cuts from the literature. The extensive experiments we conduct demonstrate that the price-based cuts we develop improve the performance of the Benders decomposition algorithm and outperform the primal-dual algorithm. (C) 2021 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据