| Summary: | 碩士 === 中原大學 === 電機工程研究所 === 92 === facts that several constraints have to be satisfied while the variables are discrete. The solutions of such problems can be achieved by adjusting the locations of tie switches and sectionalizing switches. Also the objective function can be described precisely. Because of these characteristics, Genetic Algorithm (GA) can be applied for solving the problems. Genetic Algorithm is used to solve loss minimization and load balancing problems. The solution proposed by traditional GA may result in illegal solution. This will increase the <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a> <a href="http://www.ntsearch.com/search.php?q=time&v=56">time</a> since extra step is needed to ensure that the solutions are all <a href="http://www.ntsearch.com/search.php?q=legal&v=56">legal</a>. In order to overcome this problem, this thesis proposes conditional mutation method. From this method, asexual GA is proposed. From the simulation, it is found that the proposed asexual GA operator can achieve the optimal solution quicker than traditional GA operators.
指導教授楊宏澤蔡孟伸Click Here 可以新增或移除口試委員資訊 論文檔案9178027-new.pdfClick Here 可以新增或移除檔案
|
|---|
