Balancing and sequencing mixed-model U-lines with a co-evolutionary algorithm

A mixed-model production line is such a line where a variety of product models are produced. In U-lines used in the just-in-time production system, the strategy of mixing product models is often employed to provide various types of products to customers on time. Line balancing and model sequencing problems are important for an efficient use of mixed-model U-lines. Although the two problems are tightly interrelated with each other, prior research has considered them separately or sequentially. In this paper, a new approach using an artificial intelligence search technique, called co-evolutionary algorithm, is proposed to solve the two problems at the same time. To promote population diversity and search efficiency in the algorithm, we adopt strategies of localized evolution and steady-state reproduction, and develop methods of selecting environmental individuals and evaluating fitness. Efficient genetic representations and operator schemes are also provided. When designing the schemes, we take into account the features specific to the problems. The experimental results demonstrate that the proposed algorithm outperforms existing approaches.

[1]  John Miltenburg,et al.  The mixed-model U-line balancing problem , 1998 .

[2]  Nick T. Thomopoulos,et al.  Mixed Model Line Balancing with Smoothed Station Assignments , 1970 .

[3]  Mitchell A. Potter,et al.  The design and analysis of a computational model of cooperative coevolution , 1997 .

[4]  Yeongho Kim,et al.  Sequencing in mixed model assembly lines: A genetic algorithm approach , 1996, Comput. Oper. Res..

[5]  Richard K. Belew,et al.  New Methods for Competitive Coevolution , 1997, Evolutionary Computation.

[6]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[7]  E. M. Dar-El,et al.  A mixed-model sequencing application , 1981 .

[8]  Risto Miikkulainen,et al.  Forming Neural Networks Through Efficient and Adaptive Coevolution , 1997, Evolutionary Computation.

[9]  Nick T. Thomopoulos,et al.  Line Balancing-Sequencing for Mixed-Model Assembly , 1967 .

[10]  Yeongho Kim,et al.  Two-sided assembly line balancing: A genetic algorithm approach , 2000 .

[11]  Avraham Shtub,et al.  An analytic framework for sequencing mixed model assembly lines , 1992 .

[12]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[13]  Sami Khuri,et al.  Evolutionary Heuristics for the Bin Packing Problem , 1995, ICANNGA.

[14]  Gilbert Syswerda,et al.  A Study of Reproduction in Generational and Steady State Genetic Algorithms , 1990, FOGA.

[15]  Mary Lou Maher,et al.  Modeling design exploration as co-evolution , 1996 .

[16]  A. Chakravarty,et al.  Balancing Mixed Model Lines with In-Process Inventories , 1985 .

[17]  Mullen,et al.  JIT sequencing for mixed-model assembly lines with setups using Tabu Search , 1998 .

[18]  J. L. C. Macaskill,et al.  Production-Line Balances for Mixed-Model Lines , 1972 .

[19]  J. Miltenberg,et al.  Level schedules for mixed-model assembly lines in just-in-time production systems , 1989 .

[20]  Yuval Davidor,et al.  A Naturally Occurring Niche and Species Phenomenon: The Model and First Results , 1991, ICGA.

[21]  Candace Arai Yano,et al.  Sequencing to minimize work overload in assembly lines with product options , 1991 .

[22]  Yong-Ju Kim,et al.  A Genetic Algorithm for Improving the Workload Smoothness in Mixed Model Assembly Lines , 1997 .

[23]  John B. Kidd,et al.  Toyota Production System , 1993 .