Ant Colony Search Algorithm for Solving Unit Commitment Problem
Publish place: International Journal of Mechatronics, Electrical and Computer Technology، Vol: 3، Issue: 8
Publish Year: 1392
نوع سند: مقاله ژورنالی
زبان: English
View: 521
This Paper With 15 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJMEC-3-8_005
تاریخ نمایه سازی: 16 فروردین 1395
Abstract:
In this paper Ant Colony Search Algorithm is proposed to solve thermal unit commitment problem. Ant colony search (ACS) studies are inspired from the behavior of real ant colonies that are used to solve function or combinatorial optimization problems. In the ACSA a set of cooperating agents called ants cooperates to find good solution of unit commitment problem of thermal units. The UC problem is to determine a minimal cost turn-on and turn-off schedule of a set of electrical power generating units to meet a load demand while satisfying a set of operational constraints. This proposed approach is a tested on 10 unit power system and compared to conventional methods.
Keywords:
Authors
k lenin
Electrical and Electronics Engineering, Jawaharlal Nehru Technological University, Kukatpally, Hyderabad, India
b Ravindranath Reddy
Electrical and Electronics Engineering, Jawaharlal Nehru Technological University, Kukatpally, Hyderabad, India
m Surya Kalavathi
Electrical and Electronics Engineering, Jawaharlal Nehru Technological University, Kukatpally, Hyderabad, India