An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem.

In real manufacturing environments, the number of automatic guided vehicles (AGV) is limited. Therefore, the scheduling problem that considers a limited number of AGVs is much nearer to real production and very important. In this paper, we studied the flexible job shop scheduling problem with a limited number of AGVs (FJSP-AGV) and propose an improved genetic algorithm (IGA) to minimize makespan. Compared with the classical genetic algorithm, a population diversity check method was specifically designed in IGA. To evaluate the effectiveness and efficiency of IGA, it was compared with the state-of-the-art algorithms for solving five sets of benchmark instances. Experimental results show that the proposed IGA outperforms the state-of-the-art algorithms. More importantly, the current best solutions of 34 benchmark instances of four data sets were updated.