隨著中國大陸物流市場的快速成長，如何設計大規模的配銷網路成為其中最重要的研究議題之一；同時，大規模配銷網路的設計也是全球化供應鏈管理的核心問題。配銷網路設計可考慮下列兩個部分：如何選擇製造工廠和配銷中心之地點，以及決定製造工廠和配銷中心之間的最佳連結方式。在本研究中，我們探討在大規模網路中的產能設施區位選擇問題，並且將其應用在配銷網路設計上。在此網路中，每一個配銷中心有其需求，而每一個工廠有其固定的產能以提供給它所服務的配銷中心。我們的目標在選擇一群工廠集合以滿足每一個配銷中心的需求，且不能違背工廠產能上限的條件下，最小化其總成本，其中總成本包含工廠營運成本及服務成本，通常服務成本是根據工廠和配銷中心之間的距離所定義的。而這個問題最大的關鍵挑戰，為其計算複雜度是隨著配銷網路的大小規模而成指數的成長。本研究中，我們參考Kao et al. [18] (2011)之動態規劃計算方法，設計一個初始的配銷網路圖，而為了進一步趨近最佳解，我們提出區域交換的方法，修正初始配銷網路圖配對上的誤差。本研究中，結合動態規畫計算方法和區域交換技巧，可以快速且精確地求出大規模配銷網路的近似最佳解。除此之外，我們還建立一個圖形化使用者介面系統且驗證此系統的實用價值。我們的研究結果顯示此圖形化使用者介面系統可以趨近最佳解僅差一成，且我們的演算法計算時間遠小於最佳化軟體的最佳解計算時間。

With the rapid growth of China’s logistics market, one of the most important research issues is designing a large-scale distribution network. The question of large-scale distribution network design is also becoming central to globalization supply chain management. Distribution network design can be considered as two parts: locating manufacturing plants and distribution centers, and determine the best strategy for communications between manufacturing plants and distribution centers. In this article, we study capacitated facility location in large-scale networks and its application to distribution network design. In a distribution network, each distribution center or client has associated with a demand, and each plant or facility has a capacity that specifies the maximum service the plant can provide to its distribution centers. Our aim is to select a subset of plants such that the demand requirement of each distribution center is satisfied, the plants capacities are not violated, and the total cost, including plant operating cost and service cost, which is usually based on the metric distance between plants and distribution centers, is minimized. The key challenge is that the computational complexity grows exponentially in the network size. We refer to the dynamic programming algorithm from Kao et al. [18] (2011) to build a distribution network, and we provide local swap techniques to better approximate the optimal assignment in the distribution network. Based on the dynamic programming algorithm and local swap techniques, we present a fast and accurate approximation approach to the large-scale distribution network design. In addition, we build a graphical user interface (GUI) system and the proposed system demonstrates its practical usefulness. Our GUI system can approximate the optimum within a constant ratio, and the computation time cost of our algorithm is much faster than that of Lingo. Keywords: Distribution network; facility location; large-scale network.

參考文獻
1. 郭晉彰，2006，「3%的超越」，天下文化書坊。
2. 蘇雄義，胡凱傑，劉秉豪，2010，「動態協和供應鏈模式之應用研究-已依加重型車輛供應商為例」，2010第13屆科技整合管理研討會。
3. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V., 2004, “Local search heuristics for k-median and facility location problems,” SIAM J. Comput., Vol. 33, No. 3, pp. 544-562.
4. Beasley, J. E., 1988, “An algorithm for solving large capacitated warehouse location problems,” European Journal of Operational Research, Vol. 33, pp. 314-325.
5. Campbell, J.F., 1990, “Locating Transportation Terminals to Serve An Expanding Demand,” Transpn. Res.-B, Vol. 24B, No. 3, pp. 173-192.
6. Chao, C.L., Liao, C.S., Lu, S.H., Peng, K., 2010, “A Hierarchical Location Model for Recycling Systems,” In Proceedings of 2010 CIIE.
7. Chardaire, P., Sutter, A., Costa, M.C., 1996, “Solving the Dynamic Facility Location Problem,” Network, Vol. 28, pp. 117-124.
8. Charikar, M., Guha, S., 1999, “Improved combinatorial algorithm for facility location and k-median problems,” In Proceedings of 40th IEEE Symposium of Foundations of Computer Science, pp. 378-388.
9. Chen, Y.Y., Wang, H.F., 2007, “Applying a Revised VAM to a Multi-level Capacitated Facility Location Problem,” In Proceedings of 2007 IEEE, pp. 337-341.
10. Chudak, F.A., Shmoys, D.B., 1999, “Improved approximation algorithms for a capacitated facility location problem,”In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 875-876.
11. Chudak, F.A., Williamson, D.P., 2005, “Improved approximation algorithms for capacitated facility location problems,” Math. Program., Vol. 102, NO. 2, pp. 207-222.
12. Erlenkotter, D., 1981, “A Comparative Study of approaches dynamic location problems,” European Journal of Operational Research, Vol. 6, pp. 133-143.
13. Gunawardane, G., 1982, “Dynamic Versions of set Covering type Public Facility Location Problems,” European Journal of Operational Research, Vol. 10, pp. 190-195.
14. Haynes, T.W., Hedetniemi, S.T., Slater, PJ., 1998, “ Domination in Graphs：The Theory”. Dekker, New York.
15. Jain, K., Vazirani, V.V., 2001, “Approximation algorithms for metric facility location and k-median problems using primal-dual schema and Lagrangian relaxation,” J. ACM ., Vol. 48, NO. 2, pp. 274-296.
16. Jain, K., Mahdian, M., Saberi, A., 2002, “A new greedy approach for facility location problems,” In Proceedings of 34th ACM Symposium on Theory of Computing, pp.731-740.
17. Korupolu, M., Plaxton, C., Rajaraman, R., 2000, “Analysis of local search heuristics for facility location problems,” J. Algorithms., Vol. 37, NO. 1, pp. 146-188.
18. Kao, M.J., Liao, C.S., Lee, D.T., 2011, “Capacitated domination problem,” Algorithmica, Vol. 60, NO. 2, pp. 274-300.
19. Levi, R., Shmoys, D.B., Swamy, C., 2004, “LP-based approximation algorithms for capacitated facility location,” In Proceedings of 10th Conference on Integer Programming and Combinatorial Optimization, pp. 206-218.
20. Liao, C.S., Chang, G.J., 2002, “Algorithmic aspect of k-tuple domination in graphs,” Taiwan. J. Math., Vol. 6, pp. 415-420.
21. Liao, C.S., Chang, G.J., 2003, “K-tuple domination in graphs,” Inf. Process. Lett., Vol. 87., NO. 1, pp. 45-50.
22. Mahdian, M., P’al, M., 2003, “Universal facility location,” In Proceedings of 11th European Symposium on Algorithms, pp. 409-421.
23. Mahdian, M., Ye, Y., Zhang, J., 2006, “Approximation algorithms for metric facility location problems,” SIAM J. Comput., Vol. 36, NO. 2, pp. 411-432.
24. Owen, S.H., Daskin, M.S., 1998, “Strategic facility location: A review,” European Journal of Operational Research, Vol. 111, pp. 423-447.
25. P’al, M., Tardos, E’., Wexler, T., 2001, “Facility location with nonuniform hard capacities,” In Proceedings of 42th Symposium of Foundations of Computer Science, pp. 329-338.
26. Shmoys, D.B., Tardos, E’., Aardal, K., 1997, “Approximation algorithms for facility location problems,” In Proceedings of 29th ACM Symposium on Theory of Computing, pp.265-274.
27. Zhang, J., Chen, B., Ye, Y., 2005, “A multi-exchange local search algorithm for the capacitated facility location problem,” Math. Oper. Res., Vol. 30, NO. 2, pp. 389-403.