A Hybrid Algorithm of Converse Ant Colony Optimization for Solving JSP

摘要

A hybrid algorithm of converse ant colony optimization (HCACO) is proposed, which is used to overcome the disadvantages of the slow convergence speed and stagnation behavior when solving job shop problem (JSP). In order to improve the probability of escaping from the local optimization, we induct converse ants into the ant colony. At the same time, each solution of ACO with certain probability pursues the process of parallel enhanced SA algorithm to accelerate the coverage speed. Compared with PGA and ACO, HCACO algorithm is simulated for benchmark instances and it illustrates that the hybrid algorithm shows more better and efficient results.