کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
383481 | 660823 | 2012 | 5 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Cell formation in group technology using constraint programming and Boolean satisfiability Cell formation in group technology using constraint programming and Boolean satisfiability](/preview/png/383481.png)
Cell formation consists in organizing a plant as a set of cells, each of them containing machines that process similar types or families of parts. The idea is to minimize the part flow among cells in order to reduce costs and increase productivity. The literature presents different approaches devoted to solve this problem, which are mainly based on mathematical programming and on evolutionary computing. Mathematical programming can guarantee a global optimal solution, however at a higher computational cost than an evolutionary algorithm, which can assure a good enough optimum in a fixed amount of time. In this paper, we model and solve this problem by using state-of-the-art constraint programming (CP) techniques and Boolean satisfiability (SAT) technology. We present different experimental results that demonstrate the efficiency of the proposed optimization models. Indeed, CP and SAT implementations are able to reach the global optima in all tested instances and in competitive runtime.
► We model and solve the cell formation problem by using CP and SAT.
► We perform experiments considering five different models and five different solvers.
► We reach the global optimum in all tested instances and in excellent runtime.
Journal: Expert Systems with Applications - Volume 39, Issue 13, 1 October 2012, Pages 11423–11427