Modern Manufacturing Engineering ›› 2017, Vol. 444 ›› Issue (9): 22-28.doi: 10.16731/j.cnki.1671-3133.2017.09.005

Previous Articles     Next Articles

Dual-gantry placement machine scheduling based on cellular bat algorithm

Lu Tongtong1, Yu Zhuma2, Zheng Xiaodong2   

  1. 1 Business School,Changzhou University,Changzhou 213164,Jiangsu,China;
    2 College of Mechanical and Power Engineering,China Three Gorges University,Yichang 443002,Hubei,China
  • Received:2015-11-20 Online:2017-09-20 Published:2018-01-09

Abstract: To improve the efficiency of dual-gantry placement machine,the placement process optimization problem is studied,a cellular bat algorithm is proposed.The algorithm proposes a piece-wise integer coding scheme.And the cellular automata is introduced into the bat algorithm to study the information communicating and exchanging mechanism.The strategy of self-adaptive multi crossover operators is adopted to improve the robustness of the algorithm.To accelerate the convergence and maintain the population diversity,an elitist external archive is established.An iterative swap procedure is borrowed to improve the convergence accuracy.The simulation results show the proposed algorithm have a better performance in convergence rate and accuracy,which can achieve the optimization of the placement process to improve the assembly efficiency.

Key words: bat algorithm, dual-gantry placement machine, placement optimization, cellular automata, multi-crossover strategy

CLC Number: 

Copyright © Modern Manufacturing Engineering, All Rights Reserved.
Tel: 010-67126028 E-mail: 2645173083@qq.com
Powered by Beijing Magtech Co. Ltd