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

J. Heinonen*, F. Pettersson

*Korresponderande författare för detta arbete

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

87 Citeringar (Scopus)

Sammanfattning

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.

OriginalspråkEngelska
Sidor (från-till)989-998
Antal sidor10
TidskriftApplied Mathematics and Computation
Volym187
Utgåva2
DOI
StatusPublicerad - 15 apr 2007
MoE-publikationstypA1 Tidskriftsartikel-refererad

Fingeravtryck Fördjupa i forskningsämnen för ”Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här