基于变邻域小生境遗传算法的AGV路径网络设计方法

Variable Neighborhood Niche Genetic Algorithm Based AGV Flow Path Design Method

提出一种变邻域搜索与小生境遗传算法结合的混合遗传算法,并采用该算法进行单向AGV路径网络设计。首先建立综合考虑负载和空载路程的路径网络设计模型,使得总路程更符合实际情况。接着对路径网络进行预处理,以提高可行性、降低复杂度。在遗传算法中,采用了小生境淘汰运算以提高多样性,在遗传操作中混合了变邻域搜索策略以提高局部搜索能力。这样既能提高计算效率,又能提高解的质量。两个计算实例验证了所提算法的有效性。

A niche genetic algorithm combined with variable neighborhood search was proposed herein to solve the flow path design of unidirectional AGV systems. Firstly, the formal model was given and both loaded and empty flows were considered in this model. This made the total travel distance more close to the real system. The preprocessing procedure was proposed to improve the feasibility of solution and to reduce computation complexity. Niche competition operation was adopted in the genetic algorithm to diversify the search process and variable neighborhood search was also adopted to improve the local search ability. Thus the computation efficiency is improved and the solution quality is also raised. Two computation experiments validated the effectiveness of the proposed algorithm.