Answers are grounded in this paper and cite their sources.
We describe a Differential Evolution (DE) algorithm for solving U-shaped Assembly Line Balancing Problems -Type 2 (UALBP-2).The minimum cycle time in a just-in-time production line for producing a single product with a certain number of workstations was investigated by developing solution methods and testing on 15 problem sets (101 instances).The problems were divided into 10 medium-scale problem sets (50 instances) and 5 large-scale problem sets (51 instances).When comparing the results with those obtained from the rule-based heuristic; three rules and two rules, the DE algorithm could generate 14 better solutions (28%) in the medium-scale problems, and 3 better solutions (about 6%) in the large-scale problems.In terms of computational time, DE algorithm was faster than rule-based heuristic methods in medium-scale problems.In large problems, our DE algorithm used computational times that were shorter by 73% (for two rules) and 98% (for three rules).
No takes yet. Share an insight, caveat, or question.
Chantarasamai et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: