An effective discrete invasive weed optimization algorithm for multi-AGVs dispatching problem with specific cases in matrix manufacturing workshop

• A new discrete invasive weed optimization algorithm (DIWO) with rescheduling strategy is proposed. • A dynamic rescheduling strategy is proposed. • A strategy of setting emergency waiting time is proposed. • A heuristic is proposed to dynamically update the task list. • An insertion based local search is used to increase the local search ability. This paper mainly studies the dynamic multiple automatic guided vehicles dispatching problem (AGVDP) with special cases in matrix manufacturing workshop. The purpose is to introduce dynamic strategy into the static dispatching process to improve the ability to deal with special situations in the scheduling process. To solve this problem, a mathematical model is formulated based on actual production. A new discrete invasive weed optimization algorithm (DIWO) with rescheduling strategy is proposed. A dynamic rescheduling strategy is proposed to improve the ability of scheduling system. A strategy of setting emergency waiting time is proposed based on dynamic rescheduling strategy. A heuristic is proposed to dynamically update the task list, which can effectively update the current task list , solving the problem of task update in special cases and the deletion of the task that has been dispatched. An insertion based local search is used to increase the local search ability. A comprehensive simulation experiment based on the 110 instances from an actual production factory validates the effectiveness of the proposed algorithm.