A Modified honey bees mating optimization algorithm for assembly line balancing problem

According to the characteristics of assembly line balancing problem, a modified honey bees mating optimization (MHBMO) algorithm was proposed to solve this problem. In this algorithm, the precedence matrix of tasks is proposed to apply the coding method based on the sequence of tasks. The initial feasible population was generated by a binary tree method, and a modified crossover operator and three neighborhood structures were used to keep solutions feasible. In order to enhance the balance of between intensification and diversification, a simulated annealing algorithm was utilized as a local optimization method. Finally, experimental results validate the effectiveness of the proposed algorithm.

[1]  Angel B. Ruiz,et al.  Balancing assembly lines with tabu search , 2006, Eur. J. Oper. Res..

[2]  H A Abbass,et al.  MARRIAGE IN HONEY-BEE OPTIMIZATION (MBO): A HAPLOMETROSIS POLYGYNOUS SWARMING APPROACH , 2001 .

[3]  Hadi Gökçen,et al.  A goal programming approach to simple U-line balancing problem , 2006, Eur. J. Oper. Res..

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

[5]  Song Hua Genetic algorithms-based U-shaped assembly line balancing , 2002 .

[6]  Hussein A. Abbass,et al.  MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[7]  Magdalene Marinaki,et al.  A hybrid Honey Bees Mating Optimization algorithm for the Probabilistic Traveling Salesman Problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

[8]  Armin Scholl,et al.  Data of assembly line balancing problems , 1995 .

[9]  Jinsong Bao,et al.  A branch-and-bound algorithm to minimize the line length of a two-sided assembly line , 2010, Eur. J. Oper. Res..

[10]  Lale Özbakır,et al.  Bee colony intelligence in zone constrained two-sided assembly line balancing problem , 2011, Expert Syst. Appl..

[11]  Uğur Özcan,et al.  A tabu search algorithm for two-sided assembly line balancing , 2009 .

[12]  Yeongho Kim,et al.  Two-sided assembly line balancing to maximize work relatedness and slackness , 2001 .

[13]  J. J. Bartholdi,et al.  Balancing two-sided assembly lines: a case study , 1993 .

[14]  H.-E. Tseng,et al.  Guided genetic algorithms for solving a larger constraint assembly problem , 2006 .

[15]  Georgios Dounias,et al.  Honey Bees Mating Optimization Algorithm for the Vehicle Routing Problem , 2007, NICSO.