Ant Colony Search Algorithm for Solving Unit Commitment Problem

سال انتشار: 1392
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 478

فایل این مقاله در 15 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_IJMEC-3-8_005

تاریخ نمایه سازی: 16 فروردین 1395

چکیده مقاله:

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

نویسندگان

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