2018
DOI: 10.1155/2018/6303596
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Lagrangian Relaxation Algorithm for the Robust Generation Self-Scheduling Problem

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 re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 37 publications
0
2
0
Order By: Relevance
“…The generation self-scheduling problem plays an important role in the daily-operation planning of generation companies in the deregulated electricity market. A typical generation self-scheduling problem is deciding the operation of generation units according to electricity prices and the physical characteristics of generation units, with the objective of maximizing total profits [28,29]. Effective generation self-scheduling can promote the economic operation of generation companies.…”
Section: Work and Contribution Of The Papermentioning
confidence: 99%
“…The generation self-scheduling problem plays an important role in the daily-operation planning of generation companies in the deregulated electricity market. A typical generation self-scheduling problem is deciding the operation of generation units according to electricity prices and the physical characteristics of generation units, with the objective of maximizing total profits [28,29]. Effective generation self-scheduling can promote the economic operation of generation companies.…”
Section: Work and Contribution Of The Papermentioning
confidence: 99%
“…Many mathematical methods have been proposed to resolve scheduling problems [7]; some works have approached the FJSSP using the branch and bound method [8], linear programming [9], or Lagrangian relaxation [10]. These methods ensure global convergence and have worked very well in solving small instances, but their computational time makes them impractical for problems with dozens of scheduling operations [6].…”
Section: Introductionmentioning
confidence: 99%