.png){kind=icon}
返回
A genetic algorithm extended modified sub-gradient algorithm for cell formation problem with alternative routings
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2011.588264.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the cell formation problem with alternative part routes. The problem is considered in the aspect of the natural constraints of real-life production systems such as cell size, separation and co-location constraints. Co-location constraints were added to the proposed model in order to deal with the necessity of grouping certain machines in the same cell for technical reasons, and separation constraints were included to prevent placing certain machines in close vicinity. The objective is to minimise the weighted sum of the voids and the exceptional elements. A hybrid algorithm is proposed to solve this problem. The proposed algorithm hybridises the modified sub-gradient (MSG) algorithm with a genetic algorithm. MSG algorithm solves the sharp augmented Lagrangian dual problems, where zero duality gap property is guaranteed for a wide class of optimisation problems without convexity assumption. Generally, the dual problem is solved by using GAMS solvers in the literature. In this study, a genetic algorithm has been used for solving the dual problem at the first time. The experimental results show the advantage of combining the MSG algorithm and the genetic algorithm. Although the MSG algorithm, whose dual problem is solved by GAMS solver, and the genetic algorithm cannot find feasible solutions, hybrid algorithm generates feasible solutions for all of the test problems.
Keyword:
cell formation problem
cellular manufacturing
alternative routings
modified sub-gradient algorithm
genetic algorithms
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem制造单元形成问题的一种新的分支定界增强遗传算法
PREAI
分享收藏
查看更多内容