An Improved Ant Colony Optimization for Flexible Job Shop Scheduling Problems
An Improved Ant Colony Optimization (IACO) algorithm is proposed to the Flexible Job Shop Scheduling Problem (FJSSP) in this paper. IACO algorithm provides an effective integration between Ant Colony Optimization (ACO) model and knowledge model. In the IACO algorithm, knowledge model learns some available knowledge from the optimization of ACO, and then employs the existing knowledge to guide the current heuristic searching. The performance of IACO was evaluated by many benchmark instances taken from literature. Final experimental results indicate that the proposed IACO algorithm outperforms some current approaches in the quality of schedules.