Ant Colony Search Algorithm for Solving Unit Commitment Problem
عنوان مقاله: Ant Colony Search Algorithm for Solving Unit Commitment Problem
شناسه ملی مقاله: JR_IJMEC-3-8_005
منتشر شده در شماره 8 دوره 3 فصل Jul در سال 1392
شناسه ملی مقاله: JR_IJMEC-3-8_005
منتشر شده در شماره 8 دوره 3 فصل Jul در سال 1392
مشخصات نویسندگان مقاله:
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
خلاصه مقاله:
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
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.
کلمات کلیدی: Ant Colony Search Algorithm, unit commitment, cooperating agents
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/443298/