A New Ant Colony Optimization Algorithm with an Escape Mechanism for Scheduling Problems

Ant colony optimization (ACO) algorithm is an evolutionary technology often used to resolve difficult combinatorial optimization problems, such as single machine scheduling problems, flow shop or job shop scheduling problems, etc. In this study, we propose a new ACO algorithm with ail escape mechanism modifying the pheromone updating rules to escape local optimal solutions. The proposed method is used to resolve a single machine total weighted tardiness problem, it flow shop scheduling problem for makespan minimization, and a job shop scheduling problem for makespan minimization. Compared with existing algorithms, the proposed algorithm will resolve the scheduling problems with less artificial ants and obtain better or at least the same, Solution quality.