Main Article Content
Solving an Assembly Line Balancing Problem by Differential Evolution
This article proposes Differential Evolution (DE) that can increase efficiency of Simple Assembly Line Balancing. A purpose is to find minimal workstations (m), which can be classified as Simple Assembly Line Balancing Problem Type 1 (SALBP-1). To begin, DE will generate initial vector by sampling from real numbers, which those results will undergo Mutation, Crossover and Selection. In this article, we apply each of 3 methods of Mutation which are “DE/Rand”, “DE/Best/1” and “DE/Rand-to-Best/1” with each of 2 methods of Crossover which are Binomial Crossover and Exponential Crossover 2 Position. In Simple Assembly Line Balancing Type 1 which contains 7-111 tasks, 64 problem, we find that the application of “DE/Best/1” with Exponential Crossover provides the best answer within the least amount of time for 59 problems. While the other combinations which are “DE/Rand” with Binomial Crossover, “DE/Best/1” with Binomial Crossover, “DE/Rand-to Best/1” with Binomial Crossover, “DE/rand” with Exponential Crossover and “DE/Rand-to Best/1” with Exponential Crossover, yield the best answer within the least amount of time for 27, 34, 31, 45 and 54 problems, respectively.