In this thesis, the Hybrid Genetic Algorithm-Ant Colony Optimization (GACO) approach is presented to solve the unit commitment problem (UC), and comparison with the results obtained using literature methods. Then this thesis applied the ability of the Genetic Algorithm (GA) operated after Ant Colony Optimization (ACO) can promote the ACO efficiency. The objective of GA is to improve the searching quality of ants by optimizing themselves to generate a better result, because the ants produced randomly by pheromone process are not necessary better. This method can not only enhance the neighborhood search, but can also search the optimum solution quickly to advance convergence. The other objective of this thesis is to investigate an influence of emission constraints on generation scheduling. The motivation for this objective comes from the efforts to reduce negative trends in a climate change. In this market structure, the independent power producers have to deal with several complex issues arising from uncertainties in spot market prices, and technical constraints which need to be considered while scheduling generation and trading for the next day. In addition to finding dispatch and unit commitment decisions while maximizing its profit, their scheduling models should include trading decisions like spot-market buy and sell. The model proposed in this thesis build on the combined carbon finance and spot market formulation, and help generators in deciding on when these commitments could be beneficial.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0701109-225434 |
| Date | 01 July 2009 |
| Creators | Li, Yuan-hui |
| Contributors | Chia-Hung Lin, Whei-Min Lin, Ta-Peng Tsao, Chin-Der Yang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701109-225434 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.002 seconds