A variable neighborhood binary particle swarm algorithm for cell layout problem

چکیده مقاله

In this paper, a new mathematical model is proposed for inter- and intra-cell layout problem in cellular manufacturing system. A binary particle swarm optimization algorithm with a new heuristic approach for satisfying the constraints of model is implemented to solve the proposed model. Also, a variable neighborhood search is applied for finding better local optimal solutions. Some sensitivity analyses are carried out to find the best values of PSO parameters. To prove the efficiency of the proposed algorithm, various numerical examples in small, medium, and large sizes in both perfect geometric shapes and random placements are generated and solved.