Performance Analyzes of Bee Colony Split-Plot Algorithm  

Oleh:

Hidayat, Trifenaus Prabu ; Sugioko, Andre

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: International Journal of Information and Education Technology vol. 05 no. 07 (Jul. 2015), page 549-552.
Topik: Bee colony; flow shop; scheduling; split-plot; JABFUNG-AS-FT-2015
Fulltext: 566-I109.pdf (635.87KB)

Isi artikel

The Bee Colony Algorithms is a popular algorithm in 2006, in which this algorithm was an approach to solve problems using bee’s behavior. The Bee Colony Algorithm has a quite simple flow, therefore, many studies have carry out modifications for specific problems. This study will modify the Bee Colony Algorithm to become more resembled with the Bee’s behavior, using the split-plot design principle. This study is aiming to look at the performance of the Bee Colony split-plot Algorithm based on the bee’s group behavior. In this study the performance of the Bee Colony algorithm is tested using the case study of the flow shop scheduling with the due date of 3 (three) cases, aiming to minimize the amount of late jobs. This test will be compared with the genetic algorithm. The performance of some groups and the computing time of the Bee Colony’s Algorithm split-plot will be analyzed using the flow shop problem with the aim to minimize the makespan. The study finding has shown that the Bee Colony Algorithm split-plot as proposed has resulted in a performance that resembles the genetic algorithm for the second and the third cases, whereas for the first case, the algorithm bee colony has a better performance with an average of 2,4615 late jobs and for the genetic 2,615 jobs.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali