| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636374 | Applied Mathematics and Computation | 2007 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
J. Heinonen, F. Pettersson,