Journal Article10.1109/TEM.2016.2645790
Multiobjective Discrete Artificial Bee Colony Algorithm for Multiobjective Permutation Flow Shop Scheduling Problem With Sequence Dependent Setup Times
Xiangtao Li,Shijing Ma +1 more
70
TL;DR: A novel multiobjectives discrete artificial bee colony algorithm based decomposition, called MODABC/D, is presented to solve the sequence dependent setup times multiobjective permutation flowshop scheduling problem with the objective to minimize makespan and total flowtime.
read more
Abstract: The multiobjective permutation flow shop scheduling problem with sequence dependent setup times has been an object of investigations for decades. This widely studied problem from the scheduling theory links the sophisticated solution algorithms with the moderate real world applications. This paper presents a novel multiobjective discrete artificial bee colony algorithm based decomposition, called MODABC/D , to solve the sequence dependent setup times multiobjective permutation flowshop scheduling problem with the objective to minimize makespan and total flowtime. First, in order to make the standard artificial bee colony algorithm to solve the scheduling problem, a discrete artificial bee colony algorithm is proposed to solve the problem based on the perturbation operation. Then, a problem-specific solution builder heuristic is used to initialize the population to enhance the quality of the initial solution. Finally, a further local search method are comprised of a single local search procedures based on the insertion neighborhood structures to find the better solution for the nonimproved individual. The performance of the proposed algorithms is tested on the well-known benchmark suite of Taillard. The highly effective performance of the multiobjective discrete artificial bee colony algorithm-based decomposition is compared against the state of art algorithms from the existing literature in terms of both coverage value and hypervolume indicator.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems
TL;DR: In this article, the authors provide an extensive review of NSGA-II for selected combinatorial optimization problems viz. assignment problem, allocation problem, travelling salesman problem, vehicle routing problem, scheduling problem, and knapsack problem.
A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop
Jing-jing Wang,Ling Wang +1 more
TL;DR: This paper addresses an energy-efficient scheduling of the distributed permutation flow-shop (EEDPFSP) with the criteria of minimizing both makespan and total energy consumption.
244
Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times
TL;DR: A comprehensive computational campaign against the closely related and state-of-the-art algorithms in the literature shows that both the proposed heuristics and DABC are very effective for solving the problem under consideration.
121
A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times
TL;DR: A machine position-based mathematical model and a discrete artificial bee colony algorithm (DABC) for the DHFSP-SDST to optimise the makespan and results and statistical analyses validate that the DABC outperforms the best performing algorithm in the literature.
97
A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem
TL;DR: A multi-objective optimization model with the objectives of minimizing the makespan and total energy consumption is developed and a multiobjective discrete artificial bee colony algorithm (MDABC) based on decomposition is suggested to solve this complex problem.
94
References
Sediment Transport and Movable Bed s
Oscar Castro-Orgaz,Willi H. Hager +1 more
- 01 Jan 2019
TL;DR: In this article, sediment is either loaded as bed-load with particles sliding, saltating, and rolling over the river bed, or as a suspended-load, where particles move with the turbulent water flow away from the bed.
43K
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Qingfu Zhang,Hui Li +1 more
TL;DR: Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
On the performance of artificial bee colony (ABC) algorithm
Dervis Karaboga,Bahriye Basturk +1 more
- 01 Jan 2008
TL;DR: The simulation results show that the performance of ABC algorithm is comparable to those of differential evolution, particle swarm optimization and evolutionary algorithm and can be efficiently employed to solve engineering problems with high dimensionality.