by Lo Kam Ming. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 107-111). / Chapter 1 --- Introduction --- p.7 / Chapter 1.1 --- The Goal --- p.8 / Chapter 1.2 --- The Work of the Thesis --- p.9 / Chapter 1.3 --- Layout of Thesis --- p.9 / Chapter 2 --- The Unit Commitment Problem --- p.11 / Chapter 2.1 --- What is UCP? --- p.11 / Chapter 2.1.1 --- Why is UCP difficult? --- p.12 / Chapter 2.1.2 --- Costs --- p.12 / Chapter 2.1.3 --- Constraints --- p.13 / Chapter 2.2 --- Mathematical Formulation --- p.15 / Chapter 2.3 --- Literature Review --- p.19 / Chapter 2.3.1 --- Exhaustive Enumeration --- p.19 / Chapter 2.3.2 --- Priority List --- p.20 / Chapter 2.3.3 --- Langragian Relaxation --- p.21 / Chapter 2.3.4 --- Neural Network --- p.21 / Chapter 2.3.5 --- Genetic Algorithms --- p.22 / Chapter 2.3.6 --- Dynamic Programming --- p.22 / Chapter 3 --- Genetic Algorithms --- p.24 / Chapter 3.1 --- Introduction --- p.24 / Chapter 3.1.1 --- Outline of Traditional GA --- p.25 / Chapter 3.2 --- Basic elements --- p.26 / Chapter 3.2.1 --- Coding --- p.26 / Chapter 3.2.2 --- Fitness Function --- p.26 / Chapter 3.2.3 --- Selection and Reproduction --- p.26 / Chapter 3.2.4 --- Mutation --- p.28 / Chapter 3.2.5 --- Replacement --- p.29 / Chapter 3.2.6 --- Epistasis --- p.29 / Chapter 3.2.7 --- A Simple Example --- p.30 / Chapter 3.3 --- Exploration vs Exploitation --- p.33 / Chapter 3.4 --- Constraints Handlings --- p.34 / Chapter 3.4.1 --- Penalty Function --- p.35 / Chapter 3.4.2 --- Proper Encoding --- p.36 / Chapter 3.4.3 --- Repair Algorithms --- p.36 / Chapter 4 --- Dynamic Programming --- p.37 / Chapter 4.1 --- Introduction --- p.37 / Chapter 4.1.1 --- Decomposition --- p.38 / Chapter 4.2 --- Mathematical Formulation --- p.43 / Chapter 4.3 --- A Simple Example --- p.44 / Chapter 5 --- DP Crossover Operator (DPX) --- p.50 / Chapter 5.1 --- Why DP is chosen as the crossover operator --- p.50 / Chapter 5.2 --- What is DPX? --- p.51 / Chapter 5.2.1 --- A Simple Example --- p.51 / Chapter 5.2.2 --- Mechanism of DPX --- p.58 / Chapter 5.3 --- Properties of DPX --- p.63 / Chapter 5.3.1 --- Number of parents --- p.63 / Chapter 5.3.2 --- Crossover Sites --- p.65 / Chapter 5.3.3 --- Perservation of Feasibility --- p.66 / Chapter 6 --- Implementation --- p.69 / Chapter 6.1 --- GA Construction --- p.69 / Chapter 6.1.1 --- Coding --- p.69 / Chapter 6.1.2 --- Fitness Function --- p.70 / Chapter 6.1.3 --- Selection --- p.72 / Chapter 6.1.4 --- Crossover --- p.76 / Chapter 6.1.5 --- Mutation Rate --- p.76 / Chapter 6.1.6 --- Replacement --- p.77 / Chapter 6.2 --- Algorithm --- p.77 / Chapter 6.3 --- Optimal Power Generations for Fuel Costs --- p.80 / Chapter 6.3.1 --- The Simple Scheduling Method --- p.80 / Chapter 7 --- Experimental Results --- p.84 / Chapter 7.1 --- Experiment Details --- p.84 / Chapter 7.2 --- Problem A --- p.86 / Chapter 7.2.1 --- Data Results --- p.86 / Chapter 7.2.2 --- Graphical Results --- p.90 / Chapter 7.2.3 --- Analysis --- p.90 / Chapter 7.3 --- Problem B --- p.92 / Chapter 7.3.1 --- Data Results --- p.92 / Chapter 7.3.2 --- Graphical Results --- p.94 / Chapter 7.3.3 --- Analysis --- p.96 / Chapter 8 --- Conclusion and Future Work --- p.97 / Chapter 8.1 --- Conclusion --- p.97 / Chapter 8.2 --- Future Work --- p.98 / Chapter A --- Problems Parameters --- p.100 / Chapter A.1 --- Problem A --- p.100 / Chapter A.1.1 --- Parameters of Generating Units --- p.101 / Chapter A.2 --- Problem B --- p.103 / Chapter A.2. --- 1 Parameters of Generating Units --- p.104
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_321500 |
| Date | January 1996 |
| Contributors | Lo, Kam Ming., Chinese University of Hong Kong Graduate School. Division of Systems Engineering and Engineering Management. |
| Publisher | Chinese University of Hong Kong |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, [4], 111 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0021 seconds