介绍了一种从遗传算法改进而来的算法——育种算法,它将遗传算法中的选择、交叉及变异这3个过程简化为1个过程。在用于水库优化调度计算时,与经典算法相比较,该算法原理简单,易编程实现,占用计算机内存少,能以较快的速度收敛到全局最优解,是一种有效的搜索算法。 This paper introduces a kind of improved algorithm from genetic algorithm - breeding algorithm, which simplifies the three processes of selection, crossover and mutation in genetic algorithm to one process. Compared with the classical algorithm, the proposed algorithm is simple and easy to program, and it occupies less computer memory and can converge to the global optimal solution at a faster speed when compared with the classical algorithm. It is an effective search algorithm.