Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem

摘要

A hybrid ant colony optimization (ACO) algorithm is applied to a well known job-shop scheduling problem: MT10 (Muth -Thompson). The ACO tries to preserve and improve existing solutions, and a postprocessing algorithm is applied to the tour of an ant upon its completion. Studies are performed to see what effect visibility has on the outcome with regards to the ACO part of the algorithm. (C) 2006 Elsevier Inc. All rights reserved.