An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines

Mixed-model two-sided assembly lines are widely used in a range of industries for their abilities of increasing the flexibility to meet a high variety of customer demands. Balancing assembly lines is a vital design issue for industries. However, the mixed-model two-sided assembly line balancing (MTALB) problem is NP-hard and difficult to solve in a reasonable computational time. So it is necessary for researchers to find some efficient approaches to address this problem. Honey bee mating optimization (HBMO) algorithm is a population-based algorithm inspired by the mating process in the real colony and has been applied to solve many combinatorial optimization problems successfully. In this paper, a hybrid HBMO algorithm is presented to solve the MTALB problem with the objective of minimizing the number of mated-stations and total number of stations for a given cycle time. Compared with the conventional HBMO algorithm, the proposed algorithm employs the simulated annealing (SA) algorithm with three different neighborhood structures as workers to improve broods, which could achieve a good balance between intensification and diversification during the search. In addition, a new encoding and decoding scheme, including the adjustment of the final mated-station, is devised to fit the MTALB problem. The proposed algorithm is tested on several sets of instances and compared with Mixed Integer Programming (MIP) and SA. The superior results of these instances validate the effectiveness of the proposed algorithm. Display Omitted

[1]  Xiaofeng Hu,et al.  A station-oriented enumerative algorithm for two-sided assembly line balancing , 2008, Eur. J. Oper. Res..

[2]  Taher Niknam,et al.  A modified honey bee mating optimization algorithm for multiobjective placement of renewable energy resources , 2011 .

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

[4]  Ugur Özcan,et al.  Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm , 2010, Eur. J. Oper. Res..

[5]  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..

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

[7]  Seyed Jafar Sadjadi,et al.  Alternative design redundancy allocation using an efficient heuristic and a honey bee mating algorithm , 2012, Expert Syst. Appl..

[8]  Bilal Toklu,et al.  Multiple-criteria decision-making in two-sided assembly line balancing: A goal programming and a fuzzy goal programming models , 2009, Comput. Oper. Res..

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

[10]  Hadi Gökçen,et al.  Balancing parallel two-sided assembly lines , 2010 .

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

[12]  Ana S. Simaria,et al.  2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines , 2009, Comput. Ind. Eng..

[13]  Sheldon Howard Jacobson,et al.  The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.

[14]  Omid Bozorg Haddad,et al.  Honey-Bees Mating Optimization (HBMO) Algorithm: A New Heuristic Approach for Water Resources Optimization , 2006 .

[15]  Parames Chutima,et al.  Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimisation with negative knowledge , 2012, Comput. Ind. Eng..

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

[17]  Xiaofeng Hu,et al.  A branch-and-bound algorithm for two-sided assembly line balancing , 2008 .

[18]  Graham Kendall,et al.  A honey-bee mating optimization algorithm for educational timetabling problems , 2012, Eur. J. Oper. Res..

[19]  Uğur Özcan,et al.  Balancing two-sided assembly lines with sequence-dependent setup times , 2010 .

[20]  Magdalene Marinaki,et al.  Honey Bees Mating Optimization algorithm for financial classification problems , 2010, Appl. Soft Comput..

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

[22]  Georgios Dounias,et al.  Honey bees mating optimization algorithm for the Euclidean traveling salesman problem , 2011, Inf. Sci..

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

[24]  Yeo Keun Kim,et al.  A mathematical model and a genetic algorithm for two-sided assembly line balancing , 2009, Comput. Oper. Res..

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

[26]  H. Lorenz,et al.  Jena Research Papers in Business and Economics Sequencing Mixed-Model Assembly Lines : Survey , Classification and Model Critique , 2007 .

[27]  Türkay Dereli,et al.  Two-sided assembly line balancing using an ant-colony-based heuristic , 2008 .

[28]  Loren Paul Rees,et al.  Assembly Line Balancing Using Genetic Algorithms with Heuristic‐Generated Initial Populations and Multiple Evaluation Criteria* , 1994 .

[29]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[30]  Bilal Toklu,et al.  Balancing of mixed-model two-sided assembly lines , 2009, Comput. Ind. Eng..

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

[32]  Masoud Rabbani,et al.  Balancing of mixed-model two-sided assembly lines with multiple U-shaped layout , 2012 .

[33]  Lixin Miao,et al.  A hybrid approach for the vehicle routing problem with three-dimensional loading constraints , 2013, Comput. Oper. Res..

[34]  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).

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

[36]  Angel B. Ruiz,et al.  Balancing assembly lines: an industrial case study , 2004, J. Oper. Res. Soc..