Scheduling Resources Based on Improved Genetic Algorithm
Zeng Yi · Jisuanji fangzhen · 2008
To solve resource scheduling problem, usually the greed algorithm, genetic algorithm etc are used. But greed algorithm cannot guarantee to get the best solution. As to genetic algorithm, if being used directly, it will search a large solution space inefficiently, so the best solution can not be got rapidly. A new method is proposed in this thesis. Firstly, the possible solutions based on greed algorithm can be got. Then the candidate solutions can be obtained after detecting all the conflicts and resolving them. At last, by using the improved genetic algorithm, the best solution for the problem willl be gained. It is indicated that this method can reduce the research space, get the best solution rapidly and can prevent the degeneration of the population efficiently. This method plays an important role in dealing with exceptional tasks.