Solving Optimization Problem with Linear Consecutive-k-out-of-n and Linear Consecutive-(r, s)-out-of-(m, n): F system by Using Genetic Algorithms
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 94 === The linear consecutive-k-out-of-n and the linear consecutive-(r, s)-out-of-(m, n): F system both are enumerated minimum cuts easily. The optimization problem with linear consecutive-k-out-of-n: F system is discussed by many people. They proposed some heuristi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/66909298137678626615 |
| Summary: | 碩士 === 國立清華大學 === 工業工程與工程管理學系 === 94 === The linear consecutive-k-out-of-n and the linear consecutive-(r, s)-out-of-(m, n): F system both are enumerated minimum cuts easily. The optimization problem with linear consecutive-k-out-of-n: F system is discussed by many people. They proposed some heuristic methods for solving problem that are based on reliability importance. We propose the genetic algorithm for solving the optimization problem with linear consecutive-k-out-of-n: F system by introducing with reliability importance.
The population in a genetic algorithm may converge on a local optimal solution and the mechanisms of crossover and mutation are not very effective to search other solution when the algorithm runs long time. We propose a perturbation mechanism to let the population get diverge and solution search scope gets larger to escape the population converges on a local optimal solution.
|
|---|