A hybrid honey-bees mating optimization algorithm for assembly sequence planning problem

Assembly sequence planning (ASP) refers to taking the related constraint factors such as assembly features, assembly tools and machines into consideration to generate a low-cost feasible sequence. In this paper, a mathematical model of assembly sequence planning problem based on connectors is constructed, and a hybrid honey-bees mating optimization (HBMO) algorithm is proposed for solving this ASP problem. The proposed algorithm has two main innovative features compared to the conventional HBMO algorithm. Firstly, a crossover operator, called Multipoint Precedence Crossover (MPX), is proposed, which can avoid the generation of infeasible solutions and preserve the meaningful characteristics of the queen and broods. Secondly, worker bees utilize the simulated annealing (SA) algorithm as a local search method to improve the broods, which makes the proposed algorithm achieve the right balance between intensification and diversification. The hybrid HBMO algorithm is tested on three practical instances and compared with other approaches, such as Guided-GAs, MAs (memetic algorithm) and AIS (artificial immune systems). The superior results on these practical instances validate the effectiveness of the proposed algorithm.

[1]  Hussein A. Abbass,et al.  A Monogenous MBO Approach to Satisfiability , 2001 .

[2]  Hwai-En Tseng,et al.  Using memetic algorithms with guided local search to solve assembly sequence planning , 2007, Expert Syst. Appl..

[3]  Zhang Kai-fu,et al.  Efficient method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex product , 2009 .

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

[5]  Thomas L. DeFazio,et al.  An integrated computer aid for generating and evaluating assembly sequences for mechanical products , 1991, IEEE Trans. Robotics Autom..

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

[7]  Junfeng Wang,et al.  A novel ant colony algorithm for assembly sequence planning , 2005 .

[8]  Yuan-Jye Tseng,et al.  A particle swarm optimisation algorithm for multi-plant assembly sequence planning with integrated assembly sequence planning and plant assignment , 2010 .

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

[10]  Cheng Hui,et al.  Efficient method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex product , 2009 .

[11]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

[13]  Hwai-En Tseng,et al.  Connector-based approach to assembly planning using a genetic algorithm , 2004 .

[14]  Hwai-En Tseng,et al.  Artificial immune systems for assembly sequence planning exploration , 2009, Eng. Appl. Artif. Intell..

[15]  Jan Wolter,et al.  A structure-oriented approach to assembly sequence planning , 1997, IEEE Trans. Robotics Autom..

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

[17]  H. W I A-E N T S E N G,et al.  A novel means of generating assembly sequences using the connector concept , 1999 .