带有多AGV的柔性装配车间调度问题求解

Solving scheduling problems of flexible assembly workshop with multiple AGVs

针对带有多AGV的柔性装配车间的多目标综合调度问题,首先对柔性装配车间的特点和作业流程进行描述,并将多AGV系统引入柔性装配车间,提出一种基于先加工先搬运原则和就近搬运原则的AGV调度策略,然后设置AGV工作的总时间和最大完工时间的复合目标,建立带有多AGV的柔性装配车间多目标综合调度问题的数学模型,最后设计了一种基于工序约束矩阵编码的改进自适应遗传算法,对模型进行求解,验证了算法的有效性。

To solve the multi-objective comprehensive scheduling problem of flexible assembly shop with multiple AGVs,firstly,the characteristics and operation flow of flexible assembly shop was described,and the multi-AGV system was introduced into flexible assembly shop,and an AGV scheduling strategy based on the principle of first processing,first handling and nearby handling was proposed;then,the total time and the maximum completion time of AGV was determined,and the mathematical model of multi-objective comprehensive scheduling of flexible assembly shop with multiple AGVs was established;finally,an improved adaptive genetic algorithm based on process constraint matrix coding was designed to solve the model,and the effectiveness of the algorithm was verified.