An evolutionary programming-based tabu search method for solving the unit commitment problem Export

@article{citeulike:788559, abstract = {This paper presents a new approach to solving the short-term unit commitment problem using an evolutionary programming-based tabu search (TS) method. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimization technique for solving unit commitment problem, operates on a system, which is designed to encode each unit's operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all of the units according to their initial status ("flat start"). Here, the parents are obtained from a predefined set of solutions (i.e., each and every solution is adjusted to meet the requirements). Then, a random decommitment is carried out with respect to the unit's minimum downtimes, and TS improves the status by avoiding entrapment in local minima. The best population is selected by evolutionary strategy. The Neyveli Thermal Power Station (NTPS) Unit-II in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different power systems consisting of 10, 26, and 34 generating units. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, Lagrangian relaxation, and simulated annealing and tabu search in reaching proper unit commitment.}, author = {Rajan, C. C. A. and Mohan, M. R.}, citeulike-article-id = {788559}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1266616}, journal = {Power Systems, IEEE Transactions on}, keywords = {dynamic-programming, energy, evolutionary-programming, lagrangian-relaxation, new, tabu-search, unit-commitment}, number = {1}, pages = {577--585}, posted-at = {2006-08-07 10:31:25}, priority = {2}, title = {An evolutionary programming-based tabu search method for solving the unit commitment problem}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1266616}, volume = {19}, year = {2004} }

TY - JOUR ID - citeulike:788559 L3 - citeulike-article-id:788559 N2 - This paper presents a new approach to solving the short-term unit commitment problem using an evolutionary programming-based tabu search (TS) method. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimization technique for solving unit commitment problem, operates on a system, which is designed to encode each unit's operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all of the units according to their initial status ("flat start"). Here, the parents are obtained from a predefined set of solutions (i.e., each and every solution is adjusted to meet the requirements). Then, a random decommitment is carried out with respect to the unit's minimum downtimes, and TS improves the status by avoiding entrapment in local minima. The best population is selected by evolutionary strategy. The Neyveli Thermal Power Station (NTPS) Unit-II in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different power systems consisting of 10, 26, and 34 generating units. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, Lagrangian relaxation, and simulated annealing and tabu search in reaching proper unit commitment. IS - 1 JF - Power Systems, IEEE Transactions on EP - 585 TI - An evolutionary programming-based tabu search method for solving the unit commitment problem VL - 19 SP - 577 KW - dynamic-programming KW - energy KW - evolutionary-programming KW - lagrangian-relaxation KW - new KW - tabu-search KW - unit-commitment AU - Rajan, CCA AU - Mohan, MR PY - 2004/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1266616 ER -