The Influence of the Picking Times of the Components in Time and Space Assembly Line Balancing Problems: An Approach with Evolutionary Algorithms

The balancing of assembly lines is one of the most studied industrial problems, both in academic and practical fields. The workable application of the solutions passes through a reliable simplification of the real-world assembly line systems. Time and space assembly line balancing problems consider a realistic versions of the assembly lines, involving the optimization of the entire line cycle time, the number of stations to install, and the area of these stations. Components, necessary to complete the assembly tasks, have different picking times depending on the area where they are allocated. The implementation in the real world of a line balanced disregarding the distribution of the tasks which use unwieldy components can result unfeasible. The aim of this paper is to present a method which balances the line in terms of time and space, hence optimizes the allocation of the components using an evolutionary approach. In particular, a method which combines the bin packing problem with a genetic algorithm and a genetic programming is presented. The proposed method can be able to find different solutions to the line balancing problem and then evolve they in order to optimize the allocation of the components in certain areas in the workstation.

[1]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[3]  Ali M. S. Zalzala,et al.  Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..

[4]  Domagoj Jakobovic,et al.  Dynamic Scheduling with Genetic Programming , 2006, EuroGP.

[5]  Chang Liang.  Parallel assembly sequence planning based on improved genetic programming , 2013 .

[6]  Mark Johnston,et al.  Evolving Ensembles of Dispatching Rules Using Genetic Programming for Job Shop Scheduling , 2015, EuroGP.

[7]  Ali M. S. Zalzala,et al.  Investigating the use of genetic programming for a classic one-machine scheduling problem , 2001 .

[8]  José Fernando Gonçalves,et al.  A Hybrid Genetic Algorithm for Assembly Line Balancing , 2002, J. Heuristics.

[9]  Nils Boysen,et al.  Assembly line balancing: Which model to use when? , 2006 .

[10]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

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

[12]  Adil Baykasoğlu,et al.  Discovering task assignment rules for assembly line balancing via genetic programming , 2015 .

[13]  Joaquín Bautista,et al.  A multiobjective model and evolutionary algorithms for robust time and space assembly line balancing under uncertain demand , 2016 .

[14]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

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

[16]  Yves Deville,et al.  A Global Constraint for Bin-Packing with Precedences: Application to the Assembly Line Balancing Problem , 2008, AAAI.

[17]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[18]  Pedro M. Vilarinho,et al.  A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations , 2002 .

[19]  Semra Tunali,et al.  A review of the current applications of genetic algorithms in assembly line balancing , 2008, J. Intell. Manuf..

[20]  Michael J. Magazine,et al.  Assembly line balancing as generalized bin packing , 1982, Oper. Res. Lett..

[21]  Russell D. Meller,et al.  A space allocation algorithm for assembly line components , 2005 .

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

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

[24]  Joaquín Bautista,et al.  Ant algorithms for a time and space constrained assembly line balancing problem , 2007, Eur. J. Oper. Res..

[25]  Maurizio Faccio,et al.  Design and simulation of assembly line feeding systems in the automotive sector using supermarket, kanbans and tow trains: a general framework , 2013 .

[26]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[27]  Michel Gourgand,et al.  Bin packing extensions for solving an industrial line balancing problem , 2003, Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003..

[28]  Catherine C. McGeoch.  A Guide to Experimental Algorithmics , 2012 .

[29]  Michal Tzur,et al.  Design of flexible assembly line to minimize equipment cost , 2000 .

[30]  Nuchsara Kriengkorakot,et al.  The Assembly Line Balancing Problem : Review articles * , 2012 .

[31]  Gregory Levitin,et al.  Genetic algorithm for assembly line balancing , 1995 .

[32]  Mauro Gamberi,et al.  U-SHAPED ASSEMBLY LINES WITH STOCHASTIC TASKS EXECUTION TIMES: HEURISTIC PROCEDURES FOR BALANCING AND RE-BALANCING PROBLEMS , 2004 .

[33]  Joaquín Bautista,et al.  A new diversity induction mechanism for a multi-objective ant colony algorithm to solve a real-world time and space assembly line balancing problem , 2011, Memetic Comput..

[34]  Oscar Cordón,et al.  An advanced multiobjective genetic algorithm design for the time and space assembly line balancing problem , 2011, Comput. Ind. Eng..