Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing

Abstract An assembly line is a flow-oriented production system in which the productive units performing the operations, referred to as stations, are aligned in a serial manner. The simple assembly line balancing problem (SALBP) is a fundamental version of the general problem which has attracted attention of researchers and practitioners of operations research for almost half a century. With respect to the objective function, the SALBP is further classified into SALBP-1, SALBP-2, SALBP-E and finally SALBP-F. The types of SALBP may be complemented by a secondary objective which consists of smoothing station loads. This objective guarantees a better flow of material. Although there is a great deal of research addressing this problem, most of them consider smoothing station loads as a primary objective. In this paper, a differential evolution algorithm is developed to minimize workload smoothness index in SALBP-2. Also, the algorithm parameters are optimized using the Taguchi method. To validate the proposed algorithm, the results are compared with those of a published heuristic. This comparison indicates effectiveness of the proposed algorithm.

[1]  Herbert Meyr,et al.  Supply chain planning in the German automotive industry , 2004, OR Spectr..

[2]  Ram Rachamadugu,et al.  Improving the equality of workload assignments in assembly lines , 1991 .

[3]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Ezey M. Dar-El,et al.  Mixed model assembly line design in a make-to-order environment , 2002 .

[6]  Andreas C. Nearchou,et al.  Balancing large assembly lines by a new heuristic based on differential evolution method , 2007 .

[7]  Ilker Baybars,et al.  A survey of exact algorithms for the simple assembly line balancing , 1986 .

[8]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[9]  Andreas C. Nearchou,et al.  Multi-objective balancing of assembly lines by population heuristics , 2008 .

[10]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[11]  Tung-Kuan Liu,et al.  Improved immune algorithm for global numerical optimization and job-shop scheduling problems , 2007, Appl. Math. Comput..

[12]  Raid Al-Aomar,et al.  A GA-based parameter design for single machine turning process with high-volume production , 2006, Comput. Ind. Eng..

[13]  Mikell P. Groover,et al.  Automation, Production Systems, and Computer-Integrated Manufacturing , 1987 .

[14]  Armin Scholl,et al.  A survey on problems and methods in generalized assembly line balancing , 2006, Eur. J. Oper. Res..

[15]  James H. Patterson,et al.  Technical Note - Assembly-Line Balancing: Zero-One Programming with Fibonacci Search , 1975, Oper. Res..

[16]  S. Kim,et al.  Optimization of manufacturing parameters for a brake lining using Taguchi method , 2003 .

[17]  Nils Boysen,et al.  A classification of assembly line balancing problems , 2007, Eur. J. Oper. Res..

[18]  Armin Scholl,et al.  Balancing and Sequencing of Assembly Lines , 1995 .

[19]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[20]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[21]  Yeongho Kim,et al.  Genetic algorithms for assembly line balancing with various objectives , 1996 .

[22]  Andreas C. Nearchou,et al.  Meta-heuristics from nature for the loop layout design problem , 2006 .

[23]  M. M. Ali,et al.  A numerical study of some modified differential evolution algorithms , 2006, Eur. J. Oper. Res..

[24]  M. Montaz Ali,et al.  Population set-based global optimization algorithms: some modifications and numerical studies , 2004, Comput. Oper. Res..

[25]  C Merengo,et al.  Balancing and sequencing manual mixed-model assembly lines , 1999 .

[26]  Mostafa Zandieh,et al.  An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness , 2009, Expert Syst. Appl..

[27]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[28]  Andrew Kusiak,et al.  Computational Intelligence in Design and Manufacturing , 2000 .

[29]  Thomas R. Hoffman.  Eureka: a hybrid system for assembly line balancing , 1992 .

[30]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

[31]  Roger V. Johnson.  Assembly line balancing algorithms: computation comparisons , 1981 .

[32]  James R. Jackson,et al.  A Computing Procedure for a Line Balancing Problem , 1956 .

[33]  Rakesh Nagi,et al.  A review of integrated analysis of production-distribution systems , 1999 .

[34]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[35]  Taïcir Loukil,et al.  Differential evolution for solving multi-mode resource-constrained project scheduling problems , 2009, Comput. Oper. Res..

[36]  B. Micieta,et al.  Assembly Line Balancing , 2011 .

[37]  A. Delchambre,et al.  Applying the equal piles problem to balance assembly lines , 1999, Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470).

[38]  Raid Al-Aomar,et al.  Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs , 2006, Simul. Model. Pract. Theory.