论文标题
通过平衡聚类和整数编程的两阶段设施计划的算法
Algorithm for Two-Phase Facility Planning via Balanced Clustering and Integer Programming
论文作者
论文摘要
我们为两阶段设施计划方案提供了一个解决方案，在第一阶段，确定设施（或来源）的位置应在哪里下降。在第二阶段，添加了新的航路点（或接收器），但设施的位置是静态的。该解决方案应用了平衡聚类的使用 - 使用修改的K均值方法，确保每个组的基数相等。随后，随后是整数编程解决方案，以解决希区柯克运输问题。我们表明，最终解决方案可以合理地近似近乎最佳的解决方案，并在这种特定情况下成功地为设施规划提供了指南。
We present a solution for a two-phase facility planning scenario where in the first phase, there is some flexibility in determining where the locations of facilities (or sources) should fall. And in the second phase, new waypoints (or sinks) are added, but the location of the facilities are static. This solution applies the use of balanced clustering - using a modified K-Means approach, ensuring the cardinality of each group to be equal. Subsequently, it is followed by an integer programming solution, to solve the Hitchcock Transportation Problem. We show that the final solution can justifiably approximate the near optimal solution, and be a successful guide for facility planning in this specific scenario.
