In this study we show by means of computational experiments that a pseudo-Boolean approach leads to a very compact presentation of p-Median problem instances which might be solved to optimality by a general purpose solver like CPLEX, Xpress, etc. Together with p-Median benchmark instances
from OR and some other libraries we are able to solve to optimality many benchmark instances from cell formation in group technology which were tackled in the past only by means of different types of heuristics. Finally, we show that this approach is flexible to take into account many other practically motivated constraints in cell formation.
|Name||Lecture Notes in Computer Science|
|Conference||conference; 5th International Network Optimization Conference (INOC 2011); 2011-06-13; 2011-06-16|
|Period||13/06/11 → 16/06/11|
|Other||5th International Network Optimization Conference (INOC 2011)|