Hybrid Task Allocation of an AGV System for Task Groups of an Assembly Line.

Featured Application: The proposed method in this paper has the potential to solve the task-AGV allocation problem in a complex assembly environment where both multiple-AGV cooperative handling tasks and single-AGV handling tasks exist. An AGV system can be used to transport different-size materials in an assembly line. The hybrid task allocation problem is involved in the assembly line, where both single-AGV tasks and multi-AGV tasks exist. However, there is little research on this problem. The goal of solving this problem is to obtain a task allocation scheme with minimum idle time and maximum system throughput. Since all necessary materials must be delivered to the assembly station before the operation can start, the delivery tasks are not independent of each other in a task group serving the operation. To solve the problem above, a hybrid task allocation method based on a task binding strategy and an improved particle swarm optimization (IPSO) is proposed. Firstly, a mathematical model considering the punctuality of material delivery and the cooperative relationship between tasks is established. Secondly, a task binding strategy and four heuristic rules are devised to improve the quality of randomly- and heuristic-generated individuals in the initial population for model optimization. Thirdly, an IPSO is developed to help the optimization algorithm jump out of local optimums. Finally, a simulation is performed to verify the effectiveness of the proposed methods. The simulation results show that a better scheme can be obtained by our hybrid task allocation method, compared to conventional Genetic Algorithms and PSO algorithms. [ABSTRACT FROM AUTHOR]