A fast technique for unit commitment problem by extended priority list
By Tomonobu Senjyu, Ken Shimabukuro, K. Uezato, Toshihisa Funabashi. IEEE Power Engineering Society General Meeting, 2003
463 citations recorded by the source corpus.
Subfields: Electrical and Electronic Engineering, Management Science and Operations Research, Transportation
View Paper: https://www.semanticscholar.org/paper/cc6560bc77e523ad8ddf8a135711350b62f4e62a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Electrical and Electronic Engineering
- B. Goswami
- Martin Braun
- Adam Wierman
- Sarmila Patra
- Swapan Kumar Goswami
- Stefan Tenbohlen
- A. Deshpande
- Niangjun Chen
In Management Science and Operations Research
In Transportation
Citations in the corpus
- Thinking fast and slow: Optimization decomposition across timescales (2017, background): “For example, in the smart grid cheap “baseload” generators are used to supply the bulk of demand, whereas fast and relatively expensive “peaker” generators are used to quickly correct any imbalances between supply and demand that may arise [29], [35], [41], [8].”
- Genetic algorithm solution to unit commitment problem (2016, methodology): “The widely used c1assical techniques are priority list (PL) [2], branch-and bound (BB) [3], dynamic programming (DP) [4], lagrangian relaxation (LR) [5] and mixed-integer linear programming (MILP) [6].”
- Optimization of unit commitment and economic dispatch in microgrids based on genetic algorithm and mixed integer linear programming (2018, methodology): “The aim of this method is assigning a reasonable probability to each DDG to be online in a time step and a time span based on priority list method [45].”
- Finding multiple optimal solutions to optimal load distribution problem in hydropower plant (2012, background): “In these cases, a small increment in load results in a new dispatch, which may end with the most economical values as determined by the model, but is not acceptable from an operational point of view [21].”
- Differential Evolution Algorithm for Solving Unit Commitment with Ramp Constraints (2008, methodology): “The need for practical cost-effective UC solutions led to the development of many solution methods—the priority list (PL) method [2, 3], the branch and bound (BB) method [4], and the Lagrangian relaxation (LR) method [5].”