| Title |
Large Scale Unit Commitment Using Parallel Tabu Search |
| Authors |
김형수(Kim, Hyeong-Su) ; 문경준(Mun, Gyeong-Jun) ; 조덕환(Jo, Deok-Hwan) ; 황기현(Hwang, Gi-Hyeon) ; 박준호(Park, Jun-Ho) |
| Keywords |
Unit Commitment ; Parallel Tabu Search ; Diversification Strategy |
| Abstract |
This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods. |