A Crossbreed Discrete Artificial Bee Colony for Permutation Flow Shop Scheduling Problem to Minimize Total Earliness and Tardiness

Abstract

This paper considers the permutation flow shop scheduling problem to minimize total earliness and tardiness. We initiated a metaheuristic algorithm, namely a crossbreed discrete artificial bee colony. We modifications to the essential artificial bee colony and propose two versions of the crossbreed discrete artificial bee colony. Taguchi experimental design is used to test the performance of this. Several computational experiments using Vallada's benchmark instances have been carried out to prove the performance of the proposed algorithms. The statistical test results show that the proposed algorithms have the largest negative mean of BRE's value, each of -0.1959 for CDABC_ver1 and -0.1954 for CDABC_ver2. It means that the proposed algorithms perform significantly better than other algorithms. The results of the Kruskal Wallis H test show that the proposed algorithm has better performance than some dispatching rules and heuristic algorithms. Furthermore, the proposed algorithms can deliver better results in less time than mathematical model solution.

Improved ABC Algorithm Based 3D Otsu for Breast Mass Segmentation in Mammogram Images

“…In case of NIOA algorithms, the ϵ -greedy strategy selects a random selection with a probability of 1-ϵ (exploration) and the current best candidate from a pool of candidates with a probability of ϵ (exploitation) from Eq. (27). For Example, PSO algorithm is improved by adopting EG policy in case of exploitation-exploration (EE) dilemma [24].…”

“…Garside et al [27] proposed improved version of ABC algorithm CDABC to minimize total earliness and tardiness flow shop scheduling problem. In [28] authors improved ABC to optimal path planning and the results show that the proposed HABC works better than the original ABC in terms of average path length and standard deviation, with a decrease up to 25%.…”