A fast technique for unit commitment problem by extended priority list

Senjyu, Tomonobu; Shimabukuro, K.; Uezato, K.; Funabashi, Toshihisa

doi:10.1109/tpwrs.2003.811000

Cited by 386 publications

(96 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Based on the Cost In the beginning, the candidate units are built for each hour to satisfy (4)(5)(6), and the minimum online unit at time t is determined by using (10). Next, the cheaper unit will be turn on with high priority.…”

Section: Production Of All Possible Candidate Units For Each Time Periodmentioning

confidence: 99%

“…It involves the determination of an optimum start-up and shut-down schedule of generating units that minimizes operating cost, while satisfying a set of system constraints over a time period [1] [2]. Numerous efficient and robust UC methods have been developed and can be classified into two main categories [3]: The first category represents numerical optimization techniques such as priority list methods (PL) [4] [5] [6], dynamic programming method (DP) [7] [8], Lagrangian relaxation (LR) [9] [10] [11], and the popular branch-and-bound method (BB) [12] [13] [14] [15]. The PL method is fast but highly heuristic and gives schedules with relatively high operation costs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Hybrid Unit Commitment Approach Incorporating Modified Priority List with Charged System Search Methods

Wu¹,

Chih-Cheng²,

Lin³

et al. 2017

SGRE

View full text Add to dashboard Cite

This paper presents a new hybrid approach that combines Modified Priority List (MPL) with Charged System Search (CSS), termed MPL-CSS, to solve one of the most crucial power system's operational optimization problems, known as unit commitment (UC) scheduling. The UC scheduling problem is a mixed-integer nonlinear problem, highly-dimensional and extremely constrained. Existing meta-heuristic UC solution methods have the problems of stopping at a local optimum and slow convergence when applied to largescale, heavily-constrained UC applications. In the first step of the proposed method, initial hourly optimum solutions of UC are obtained by Modified Priority List (MPL); however, the obtained UC solution may still be possible to be further improved. Therefore, in the second step, the CSS is utilized to achieve higher quality solutions. The UC is formulated as mixed integer linear programming to ensure the tractability of the results. The proposed method is successfully applied to a popular test system up to 100 units generators for both 24-hr and 168-hr system. Computational results show that both solution cost and execution time are superior to those of published methods.

show abstract

Section: Production Of All Possible Candidate Units For Each Time Periodmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Hybrid Unit Commitment Approach Incorporating Modified Priority List with Charged System Search Methods

Wu¹,

Chih-Cheng²,

Lin³

et al. 2017

SGRE

View full text Add to dashboard Cite

show abstract

“…Artificial intelligence methods such as fuzzy and expert systems and neural networks have also been used [31]- [32]. Priority list methods [33] were among the first methods applied for the solution of the UC problem.…”

Section: B Literature Overviewmentioning

confidence: 99%

Qualification and Quantification of Reserves in Power Systems Under High Wind Generation Penetration Considering Demand Response

Paterakis

Erdinç

Bakirtzis

et al. 2015

IEEE Trans. Sustain. Energy

View full text Add to dashboard Cite

The presence of high levels of renewable energy resources (RES) and especially wind power production poses technical and economic challenges to system operators, which under this fact have to procure more ancillary services (AS) through various balancing mechanisms, in order to maintain the generationconsumption balance and to guarantee the security of the grid. Traditionally, these critical services had been procured only from the generation side, yet the current perception has begun to recognize the demand side as an important asset that can improve the reliability of a power system, offering notable advantages. In this study, a two-stage stochastic programming model, representing the day-ahead market clearing procedure on an hourly basis and the actual minute-to-minute operation of the power system, is developed comprising different services that specifically address various disturbance sources of the normal operation of a power system, namely intra-hour load variation, intra-hour wind variation, as well as generating unit and transmission line outages.

show abstract

“…This certainly verifies that the proposed approach has favorable stability and the decline of value function (12) is permanent in the searching process. Figure 3 provides the comparison of the daily costs obtained by SDP [4], PL [7], DP [8], SF [16] and the proposed ADP approach for the modified IEEE 118-bus system in case 1. The less cost indicates that the proposed approach can provide high-quality solutions in comparison with other methods.…”

Section: Efficiency Testmentioning

confidence: 99%

“…But the calculation efficiency needs to be improved further for unit commitment due to the "curse of dimension" problem. In response to this situation, the truncation technique [6] is proposed, which cut combinations of 0 -1 variables based on priority order [7]. Then a heuristic improvement of adjusting truncated window size according to the incremental load demands in adjacent hours is presented in [8].…”

Section: Introductionmentioning

confidence: 99%

Extended Sequential Truncation Technique for Adaptive Dynamic Programming Based Security-Constrained Unit Commitment with Optimal Power Flow Constraints

Long¹,

Wang²

2014

JPEE

View full text Add to dashboard Cite

Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to the "curse of dimension" problem of dynamic programming, the approach solves the Bellman's equation of SCUC approximately by solving a sequence of simplified single stage optimization problems. An extended sequential truncation technique is proposed to explore the state space of the approach, which is superior to traditional sequential truncation in daily cost for unit commitment. Different test cases from 30 to 300 buses over a 24 h horizon are analyzed. Extensive numerical comparisons show that the proposed approach is capable of obtaining the optimal unit commitment schedules without any network and bus voltage violations, and minimizing the operation cost as well.

show abstract

A fast technique for unit commitment problem by extended priority list

Cited by 386 publications

References 10 publications

A Hybrid Unit Commitment Approach Incorporating Modified Priority List with Charged System Search Methods

A Hybrid Unit Commitment Approach Incorporating Modified Priority List with Charged System Search Methods

Qualification and Quantification of Reserves in Power Systems Under High Wind Generation Penetration Considering Demand Response

Extended Sequential Truncation Technique for Adaptive Dynamic Programming Based Security-Constrained Unit Commitment with Optimal Power Flow Constraints

Contact Info

Product

Resources

About