Study on scheduling algorithm for multiple handling requests of single automated guided vehicles

作     者：陆远 Feng Kuikui Hu Ying Lu Yuan

作者机构：College of Electrical and Mechanical EngineeringNanchang University 

出 版 物：《High Technology Letters》 (高技术通讯（英文版）)

年 卷 期：2019年第25卷第3期

页      面：334-339页

核心收录：

学科分类：0710[理学-生物学] 0831[工学-生物医学工程（可授工学、理学、医学学位）] 0810[工学-信息与通信工程] 1205[管理学-图书情报与档案管理] 07[理学] 0807[工学-动力工程及工程热物理] 0805[工学-材料科学与工程（可授工学、理学学位）] 0802[工学-机械工程] 0836[工学-生物工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 0702[理学-物理学] 

基　　金：Supported by the National Natural Science Foundation of China(No.51765043) 

主　　题：automated guided vehicle(AGV) flexible manufacturing scheduling policy makespan genetic algorithm priority 

摘      要：To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport requests in this paper. Firstly, a workshop scheduling mechanism of AGV is analyzed and a mathematical model is established using Genetic Algorithm. According to several sets of transport priority of AGV, processes of FMS are encoded, and fitness function, selection, crossover, and variation methods are designed. The transport priority which has the least impact on scheduling results is determined based on the simulation analysis of Genetic Algorithm, and the makespan, the longest waiting time, and optimal route of the car are calculated. According to the actual processing situation of the workshop, feasibility of this method is verified successfully to provide an effective solution to the scheduling problem of single AGV.