Solving the generalized cubic cell formation problem using discrete flower pollination algorithm

作者：

Highlights：

• A new mathematical model for generalized cubic cell formation problem is introduced.

• Discrete flower pollination algorithm is developed to solve the GCCFP problem.

• Our results outperform those of branch & bound and simulated annealing meta-heuristic.

摘要

•A new mathematical model for generalized cubic cell formation problem is introduced.•Discrete flower pollination algorithm is developed to solve the GCCFP problem.•Our results outperform those of branch & bound and simulated annealing meta-heuristic.

论文关键词：Cell formation,Cellular manufacturing,Generalized cubic cell formation problem,Quality index,Discrete flower pollination algorithm

论文评审过程：Received 12 October 2019, Revised 31 January 2020, Accepted 26 February 2020, Available online 27 February 2020, Version of Record 6 March 2020.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.113345