顺序存取设备最优存储的遗传算法

Optimal Storage on Sequential Access Peripheral Based on Genetic Algorithm

顺序存取设备的最优存储是组合优化中的一个重要问题。文章在系统地讨论了顺序存取设备有关理论的基础上 ,设计并实现了该问题的一种新型算法———遗传算法。在这种算法中 ,充分利用了遗传算法的全局搜索能力。实验仿真表明 ,该算法不仅有效 ,而且表现出很强的鲁棒性。

It is well-known that the optimal storage on sequential access peripheral problems is a fundamental problem in combinatorial optimization problems. By the analyzing some properties of sequential access peripheral problems, a new genetic algorithm is presented in which the global research is used sufficiently. The experimental results show that the algorithm is available and strongly robust.