摘 要：0IE 问题是一个典型的优化组合问题，现在有很多解决的方法。本文针对遗传算法求解0IE 问题进行了研究，对







选择、交叉和变异算子进行了算法设计，最后在_ C- N软件上进行编程实现。结果表明，遗传算法在求解0IE 问题时具有







结果准确、收敛速度快等特点。







关键词：遗传算法；0IE 问题；最优化问题；_ C- N 软-Abstract: 0IE problem is a typical combinatorial optimization, there are many solutions. In this paper, genetic algorithm 0IE conducted a study on the selection, crossover and mutation operators of the algorithm design, and finally _　C-　N software for programming. The results indicate that the genetic algorithm in solving problems with 0IE accurate, fast convergence and so on. Key words: genetic algorithm　0IE problem　optimization problems　_　C-　N Soft