An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization
Rights accessOpen Access
This paper presents a high performing Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we considered four strategies for the food source phase and two strategies for each of the three remaining phases (employed bees, onlookers and scouts). One of the strategies tested in the food source phase and one implemented in the employed bees phase are new. Both have been proved to be very effective for the problem at hand. The initialization scheme named HPF2(¿, µ) in particular, which is used to construct the initial food sources, is shown in the computational evaluation to be one of the main procedures that allow the DABC_RCT to obtain good solutions for this problem. To find the best configuration of the algorithm, we used design of experiments (DOE). This technique has been used extensively in the literature to calibrate the parameters of the algorithms but not to select its configuration. Comparing it with other algorithms proposed for this problem in the literature demonstrates the effectiveness and superiority of the DABC_RCT
CitationRibas, I.; Companys , R.; Tort-Martorell, J. An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization. "Expert systems with applications", 01 Setembre 2015, vol. 42, núm. 15-16, p. 6155-6167.
- Departament d'Organització d'Empreses - Articles de revista 
- Departament d'Estadística i Investigació Operativa - Articles de revista 
- ADBD - Anàlisi de Dades Complexes per a les Decisions Empresarials - Articles de revista 
- EOLI - Enginyeria d'Organització i Logística Industrial - Articles de revista