Problem-specific genetic algorithm for power transmission system planning

摘要

A hypothesis is proposed that the only way for Turing computers to solve efficiently NP complete problems and NP hard problems is to use randomization techniques. By comparison of the popular randomization techniques, it is concluded that genetic algorithm may be the best choice until now. to overcome the disadvantages of conventional genetic algorithms, problem-specific genetic algorithm is suggested. Then, a problem-specific specific genetic algorithm that is developed specially for power transmission system planning problem is proposed.