Ant colony search algorithm for unit commitment | |
| Author | Thanathip Sum-im |
| Call Number | AIT RSPR no.ET-02-10 |
| Subject(s) | Units Algorithms |
| Note | A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Environment, Resources and Development |
| Publisher | Asian Institute of Technology |
| Series Statement | Research studies project report ; no. ET-02-10 |
| Abstract | In this research study, Ant Colony Search Algorithm (ACSA) is proposed to solve thermal unit commitment problem. ACSA is a new co-operative agent approach, which is derived from the theoretical biology on the topic of ant trail formation and foraging methods. In the ACSA, a set of co-operating agents called "ants" co-operates to find good solution to unit commitment problem of thermal units. The merits of ACSA are parallel search and optimization capabilities. In this study, the problem is decomposed in two subproblems. The unit commitment sub-problem is solved by the ant colony search algorithm method and the economic dispatch sub-problem is solved by the lambda-iteration method. The total production cost of the proposed method is cheaper than those of Dynamic Programming (DP), Lagrange Relaxation (LR) and Genetic Algorithm (GA) on the ten generating units system. |
| Year | 2002 |
| Corresponding Series Added Entry | Asian Institute of Technology. Research studies project report ; no. ET-02-10 |
| Type | Research Study Project Report (RSPR) |
| School | School of Environment, Resources, and Development (SERD) |
| Department | Department of Energy and Climate Change (Former title: Department of Energy, Environment, and Climate Change (DEECC)) |
| Academic Program/FoS | Energy Technology (ET) |
| Chairperson(s) | Weerakorn Ongsakul |
| Examination Committee(s) | Surapong Chirarattananon; Shrestha, Ram M. |
| Scholarship Donor(s) | - |
| Degree | Research report (M.Sc.) - Asian Institute of Technology, 2002 |