Parallel GA-PSO algorithm to solve the unit commitment problem
Publish place: 7th International Conference on Technology Development in Iranian Electrical Engineering
Publish Year: 1401
نوع سند: مقاله کنفرانسی
زبان: English
View: 284
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ECMCONF07_002
تاریخ نمایه سازی: 17 مرداد 1401
Abstract:
The unit commitment (UC) problem has always been considered as one of the main activities by the system planners. Due to the non-linear and complex nature of the UC, different optimization approaches have been presented to solve the problem. In recent years, metaheuristic algorithms have been attracted because of their efficiency to optimize complex problems. This paper combines the concepts of two algorithms, i.e., the particle swarm optimization (PSO) and genetic algorithm (GA) in a parallel manner and proposes a mixed GA-PSO method to optimize the UC problem. The simulation results have justified the effectiveness and advantages of the proposed method, compared to the individual methods
Authors
Hamidreza Arasteh
Power Systems Operation and Planning Research Department, Niroo Research Institute, Tehran, Iran
Hamed Mirsaeedi
Department of Electrical Engineering, University of Tehran