Hybrid Artificial Bee Colony Algorithm for a Parallel Batching Distributed Flow-Shop Problem With Deteriorating Jobs
- 8 October 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 50 (6) , 2425-2439
Abstract
In this article, we propose a hybrid artificial bee colony (ABC) algorithm to solve a parallel batching distributed flow-shop problem (DFSP) with deteriorating jobs. In the considered problem, there are two stages as follows: 1) in the first stage, a DFSP is studied and 2) after the first stage has been completed, each job is transferred and assembled in the second stage, where the parallel batching constraint is investigated. In the two stages, the deteriorating job constraint is considered. In the proposed algorithm, first, two types of problem-specific heuristics are proposed, namely, the batch assignment and the right-shifting heuristics, which can substantially improve the makespan. Next, the encoding and decoding approaches are developed according to the problem constraints and objectives. Five types of local search operators are designed for the distributed flow shop and parallel batching stages. In addition, a novel scout bee heuristic that considers the useful information that is collected by the global and local best solutions is investigated, which can enhance searching performance. Finally, based on several well-known benchmarks and realistic industrial instances and via comprehensive computational comparison and statistical analysis, the highly effective performance of the proposed algorithm is favorably compared against several algorithms in terms of both solution quality and population diversity.Keywords
Funding Information
- National Science Foundation of China (61773192, 61873328, 61803192)
- National Natural Science Fund for Distinguished Young Scholars of China (61525304)
- Shandong Province Higher Educational Science and Technology Program (J17KZ005)
- Dongguan Innovative Research Team Program (2018607202007)
- Open Project of Henan Key Laboratory of Intelligent Manufacturing of Mechanical Equipment, Zhengzhou University of Light Industry (IM201906)
- Major Basic Research Projects in Shandong (ZR2018ZB0419)
This publication has 57 references indexed in Scilit:
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activitiesApplied Mathematical Modelling, 2014
- An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problemInternational Journal of Production Economics, 2013
- The Distributed Assembly Permutation Flowshop Scheduling ProblemInternational Journal of Production Research, 2013
- An efficient tabu search algorithm for the distributed permutation flowshop scheduling problemInternational Journal of Production Research, 2013
- A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problemInformation Sciences, 2011
- An iterated greedy algorithm for the flowshop scheduling problem with blockingOmega, 2011
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- A novel clustering approach: Artificial Bee Colony (ABC) algorithmApplied Soft Computing, 2011
- The distributed permutation flowshop scheduling problemComputers & Operations Research, 2010
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007