一种灰狼邻域算法求解有电量约束的多AGV柔性车间调度问题

打开文本图片集

中图分类号：TP301.6 文献标志码：A

Abstract： To address the flexible workshop scheduling problem of automated guided vehicles （AGV）， a scheduling model was established with the objective of minimizing the makespan of handling machines， i.e.， the completion time of the scheduling system. A gray wolf neighborhood algorithm based on a greedy strategy was designed to solve this problem. In the initialization stage， vectors ofa certain length were randomly generated and transformed into feasible process and machine codes through the LPV method. Under the greedy strategy， the AGV with the shortest completion time was selected to generate the handling machine code. The gray wolf operator was adopted to update the random vector， and the IPOX of the genetic algorithm and the uniform crossover operator were introduced to cross the process and machine codes. During neighborhood search， one-stage optimization （l-opt） and two-stage optimization （2-opt） were designed to further optimize the operation and machine codes. According to the elite strategy， half of the individuals were retained for the next iteration， and the scheduling result was obtained when the algorithm terminates. The algorithm eficiency was verified through the comparison of solutions by multiple algorithms under the same parameters in 2O examples and the comparison of solutions by a single example under adjusted parameters. The results show that the improved algorithm can effectively solve the AGV scheduling problem，and its solution performance is superior to that of other algorithms.

Keywords： flexible workshop scheduling problem; power constraints：; AGV; gray wolf operator; neighborhood search

柔性车间调度问题由Brucker等[1]在1990 年首次提出，是著名的NP-hard问题。（剩余10779字）