SOLVING A TWO-SIDED ASSEMBLY LINE BALANCING PROBLEM USING MEMETIC ALGORITHMS
In this research a characterization of the two-sided assembly line problem was made, the well-known TALBP problem. There is a growing interest among researches and assembly line practitioners in the TALBP problem solution because it represents situations that come much closer to real life than the simple assembly line problem, SALBP. Since the complexity of the TALBP problem is superior to that of the SALBP problem, solving it implied searching for solutions using metaheuristics as memetic algorithms, which are supported on genetic algorithms. The proposed solution was implemented in the Matlab program for a motorcycle assembly line at a local firm. By using a constructed algorithm, the optimal solution was obtained in a shorter time than with other recognized heuristics and optimization methods, overcoming all the restrictions and complexities inherent to the problem.
Assembly line balancing memetic algorithms TALBP Heuristic methods
O. Rubiano Ovalle A. Arroyo_Almanza
Industrial Engineering and Statistics School, Universidad del Valle, Cali, Colombia Natural Sciences and Mathematics Dept., Universidad Javeriana, Cali, Colombia
国际会议
上海
英文
1-5
2009-08-02（万方平台首次上网日期，不代表论文的发表时间）