A Multi-Objective Artificial Bee Colony Algorithm Incorporating Q-Learning Search for the Flexible Job Shop Scheduling Problems with Multi-Type Automated Guided Vehicles

The flexible job shop scheduling problem (FJSP) with transportation resources such as automated guided vehicles (AGVs) is prevalent in manufacturing enterprises. Multi-type AGVs are widely adopted to transfer jobs and realize the collaboration of different machines, but are often ignored in current research. Therefore, this paper addresses the FJSP with multi-type AGVs (FJSP-MTA). Considering the difficulties caused by the introduction of transportation and the NP-hard nature, the artificial bee colony (ABC) algorithm is adopted as a fundamental solution approach. Accordingly, a Q-learning hybrid multi-objective ABC (Q-HMOABC) algorithm is proposed to deal with the FJSP-MTA. First, to minimize both the makespan and total energy consumption (TEC), this paper proposes a novel mixed-integer linear programming (MILP) model. In Q-HMOABC, a three-layer encoding strategy based on operation sequence, machine assignment, and AGV dispatching with type selection is used. Moreover, during the employed bee phase, Q-learning is employed to update all individuals; during the onlooker bee phase, variable neighborhood search (VNS) is used to update nondominated solutions; and during the scout bee phase, a restart strategy is adopted. Experimental results demonstrate the effectiveness and superiority of Q-HMOABC.