作者: T. Senjyu , A.Y. Saber , T. Miyagi , K. Shimabukuro , N. Urasaki
关键词:
摘要: The paper presents a new approach to the large-scale unit-commitment problem. To reduce computation time and satisfy minimum up/down-time constraint easily, group of units having analogous characteristics is clustered. Then, this ‘clustered compress’ problem solved by means genetic algorithm. Besides, problem-oriented powerful tools such as relaxed-pruned ELD, intelligent mutation, shift operator etc. make proposed more effective with respect both cost execution time. algorithm tested using reported data set. Simulation results for systems up 100-unit are compared previous results. Numerical show an improvement in solution obtained from standard operations.