基于遗传算法的立体车库车位调度研究

Study on Cubic-park Dispatch Based on Genetic Algorithm

立体车库的车位调度是一个比较复杂的问题,遗传算法是搜索立体车库最短路径的有效方法之一。对传统的GA结构加以改进,利用一种改良的OX交叉算子加快算法的收敛速度,利用变换变异算子维持群体的多样性防止算法早熟收敛。仿真实验结果验证了算法的有效性。

The cubic-park dispatch algorithm is a complicated program and genetic algorithm is a good method to sought out the shortest route. The algorithm structure of traditional genetic algorithm is improved in this paper. By employing an ameliorated OX operator and exchange mutation operator, the convergent speed is accelerated and the colony’s variety is maintained to prevent the prematurity. The emulation results prove the validity of the algorithm.