首页 | 官方网站   微博 | 高级检索  
     


A hybrid method based on genetic algorithm and dynamic programming for solving a bi-objective cell formation problem considering alternative process routings and machine duplication
Affiliation:1. College of Computer and Control Engineering, Minjiang University, Fuzhou 350121, China;2. College of Mathematics and Data Science, Minjiang University, Fuzhou 350121, China;3. Modern Educational Technology Center, Minjiang University, Fuzhou 350121, China;4. Collaborative Innovation Center of IoT Industrialization and Intelligent Production, Minjiang University, Fuzhou 350121, China
Abstract:Cell formation is one of the first and most important steps in designing a cellular manufacturing system. It consist of grouping parts with similar design features or processing requirements into part families and associated machines into machine cells. In this study, a bi-objective cell formation problem considering alternative process routings and machine duplication is presented. Manufacturing factors such as part demands, processing times and machine capacities are incorporated in the problem. The objectives of the problem include the minimization of the total dissimilarity between the parts and the minimization of the total investment needed for the acquisition of machines. A normalized weighted sum method is applied to unify the objective functions. Due to the computational complexity of the problem, a hybrid method combining genetic algorithm and dynamic programming is developed to solve it. In the proposed method, the dynamic programming is implemented to evaluate the fitness value of chromosomes in the genetic algorithm. Computational experiments are conducted to examine the performance of the hybrid method. The computations showed promising results in terms of both solution quality and computation time.
Keywords:Cellular manufacturing system  Cell formation  Hybrid method  Genetic algorithm  Dynamic programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号