An Improved Lagrangian Relaxation Algorithm for the Robust Generation Self-Scheduling Problem. (22nd July 2018)

• Record Type: Journal Article
• Authors: Che, Ping; Tang, Zhenhao; Gong, Hua; Zhao, Xiaoli
• Other Names: Cabrera-Guerrero Guillermo Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2018(2018)
• Publication Date: 2018-07-22
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2018/6303596
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : The robust generation self-scheduling problem under electricity price uncertainty is usually solved by the commercial solver, which is limited in computation time and memory requirement. This paper proposes an improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem where the quadratic fuel cost and the time-dependent exponential startup cost are considered. By using the optimal duality theory, the robust generation self-scheduling problem, which has a max-min structure, is reformulated as a minimization mixed integer nonlinear programming (MINLP) problem. Upon the reformulation, the Lagrangian relaxation algorithm is developed. To obtain a solvable relaxed problem, the variable splitting technique is introduced before the relaxation. The obtained relaxed problem is decomposed into a linear programming-type subproblem and multiple single-unit subproblems. Each single-unit subproblem is solved optimally by a two-stage backward dynamic programming procedure. The special cases of the problem are discussed and a two-stage algorithm is proposed. The proposed algorithms are tested on test cases of different sizes and the numerical results show that the algorithms can find near-optimal solutions in a reasonable time.