臺灣博碩士論文加值系統

在物流配銷系統中，整合物流中心區位及路徑運送稱為區位途程(location-routing)問題。區位途程問題上，對於選擇候選物流中心位置和數量以及物流中心與顧客之間的運輸配送，若只考量運輸路徑成本，而忽略顧客之需求存貨因素的話，可能導致所選擇的物流中心數量及位置有所差異，進而影響日後物流中心與顧客配送之間存貨與運輸成本導致物流總成本增加，因此區位途程需與存貨同時考量才能降低物流總成本。
有鑑於此，本研究針對上述區位存貨路徑問題提出一數學模式。由於此模式解為NP (non-polynomial)，因此本文同時發展探索解求解物流總成本最小化之問題；並與過去區位途程文獻中以距離成本為評估的兩種演算法，作一物流總成本之間的差異比較；同時為了解區位途程問題在不同環境參數下，物流總成本之差異表現，本研究將探討不同的物流中心數量、運輸量、總車輛數目、顧客需求量等相關因子，對物流中心的設置成本、存貨、運輸路徑等相關成本上之影響。

Most literature for location-routing problems in a logistic distribution system or a supply chain is based on the criterion of minimizing transportation costs. The researches on this area focus on estimating distances about these paths and consider minimum costs related to its corresponding traveling cost. However, inventory costs are important and always neglected. It may result in a biased location choice and total cost will increase further. Thus, inventory control and location-routing problem shall be considered together to achieve the lowest total cost.
In this paper, a mathematical model for the location-inventory-routing problem is proposed. Since the solution for this model is NP (non-polynomial) problem, we propose several heuristic models to solve the problem. The objective is to minimize the total costs among facility location, inventory and transportation. The results show the proposed method is better than those existing methods based on the total cost criterion. A sensitivity analysis for several parameters is also conducted in this research.

1. 緒論 ----1
1.1 研究背景與動機 ----1
1.2 研究目的 ----4
1.3 研究方法與步驟 ----4
1.4 重要性 ----7
2. 文獻探討 ----8
2.1 設施區位問題 ----8
2.2 車輛路徑問題 ----9
2.3 區位途程問題 ----11
2.4 存貨模式與運輸成本之探討----14
3. 區位存貨路徑模式說明 ----16
3.1 模式假設 ----16
3.2 符號說明 ----17
3.2.1. 已知變數 ----17
3.2.2. 輔助變數 ----17
3.2.3. 決策變數 ----18
3.3 區位存貨路徑物流總成本之計算與目標函數----18
3.3.1. 物流總成本之計算---19
3.3.2. 目標函數 ---22
3.4 區位存貨路徑探索解模式之研究 ----24
3.4.1. 區位存貨路徑模式探索解一 ----24
3.4.2. 區位存貨路徑模式探索解二、三、四---- 28
3.4.2.1. 模擬退火法 ----38
3.4.2.2. 短期記憶禁忌演算法 ----40
3.4.2.3. 長期記憶禁忌演算法 ---- 47
3.5 範例說明 ---- 54
4. 模擬驗證 ---- 58
4.1 模擬系統之假設與描述 ----58
4.2 實驗設計 ----58
5. 模擬結果分析 ----61
5.1 主要實驗結果分析 ----62
5.2 敏感度成本分析 ----75
5.2.1. 車輛購置成本敏感度分析 ----75
5.2.2. 存貨、運輸成本敏感度分析 ----77
6. 結論與後續研究 ----80
6.1 結論 ----80
6.2 建議 ----81
參考文獻 ----82

[1] 王璟瑩，民國八十七年，「應用禁忌搜尋法於物流中心區位選擇之
研究」，國立雲林科技大學工業工程與管理研究所碩士論文。
[2] 白俊偉，民國八十八年，「隨機型區位-途程問題解法之研究」，私
立大葉大學工業工程所碩士論文。
[3] 吳泰熙、張欽智，民國八十六年，「以禁忌搜尋法則求解推銷員旅
行問題」，大葉學報，第六卷，第一期，第87-99頁。
[4] 林燦煌、陳勝男，民國八十五年，「禁忌搜尋法於車輛路線問題之
應用」，私立大葉大學工業工程與管理研究所碩士論文。
[5] 莊志諒，民國七十七年，「配銷網路之設計研究」，國立交通大學
運輸研究所碩士論文。
[6] 陳春益、鄭守志，民國八十三年，「建立物流中心區位模式之研
究」，第二十一卷，第三期，第八十一至九十四頁。
[7] 溫國政，民國八十五年，「物流整合對流通通路影響之研究」，私
立東吳大學企業管理研究所碩士論文。
[8] 張翠玲，民國八十六年，「共同配送環境下之整合物流系統規
劃」，國立中央大學工業管理研究所碩士論文。
[9] 許政義，民國八十九年，「供應鏈最適服務水準之研究」，國立台
灣科技大學工業管理研究所碩士論文。
[10] 程建銘，民國九十年，「多物流中心車輛可重覆使用之區位途程問
題研究」，國立台灣科技大學工業管理研究所碩士論文。
[11] 曾中文，民國九十年，「拉式供應鏈(S,Q)存貨政策管理的探討」，
私立逢甲大學工業工程研究所碩士論文。
[12] 劉賓陽，民國八十九年，作業研究，三民書局。
[13] 顏嘉宏，民國八十九年，「區位-途程問題啟發式解法之研究」，私
立大葉大學工業工程研究所碩士論文。
[14] Andersson, J., and J. Marklund, 2000, “Decentralized
inventory control in a two-level distribution system”,
European Journal of Operational Research, Vol. 127, pp.
483-506.
[15] Anily, S. and A. Federgruen, 1990a, “One warehouse
multiple retailer system with vehicle routing cost”,
Management Science, Vol. 36, No. 1, pp. 92-114.
[16] Axsater, S., 2001, “A framework for decentralized multi-
echelon inventory control”, AIIE Transactions, Vol. 33,
pp. 91-97.
[17] Baumol, W. J. and H. D. Vinod, 1970, “An inventory-
theoretical model of freight transportation demand”,
Management Science, Vol. 16, pp. 413-421.
[18] Blumenfeld, D. E., L. D. Burns, J. D. Diltz, and C. F.
Daganzo, 1985, “Analyzing trade-offs between
transportation inventory and production costs on freight
networks”, Transportation Research, Vol. 19B, pp. 361-380.
[19] Bodin, L., and B. Golden, 1981, “Classification in
vehicle routing and scheduling”, Networks, Vol. 11, pp.
97-108.
[20] Bowerman, R. L., P. h. Calamai, and G. B. Hall, 1994,
“The spacefilling curve with optimal partitioning
heuristic for the vehicle routing problem”, European
Journal of Operational Research, Vol. 76, pp. 128-142.
[21] Bowerman et al., 1994, “A parallel implementation of the
tabu search heuristic for vehicle routing problem with
time windows constraints”, Computers & Operations
Research, Vol. 21, pp. 1025-1033.
[22] Burns, L. D., R. W. Hall, D. E. Blumenfeld and C. F.
Daganzo, 1985, “Distribution strategies that minimize
transportation and inventory costs”, Operations Research,
Vol. 33, pp. 469-490.
[23] Cesar, R., 1998, “A subpath ejection method for the
vehicle routing problem”, Management Science, Vol. 44,
pp. 1447-1459.
[24] Clarke, G. and J. W. Wright, 1964, “Scheduling of
vehicles from a central depot to a number of delivery
points”, Operations Research, Vol. 2, pp. 568-581.
[25] Cornuejols, G., M. L. Fisher, G. L. Nemheuser, 1977,
“Location of bank accounts to optimize float: an analytic
study of exact and approximate algorithms”, Management
Science, Vol. 23, pp. 19-77.
[26] Coyle, J. J. and E. J. Bardi, 1984, The Management of
Business logistics, West Publishing Co.
[27] Daskin, M. and S. Mark, 1995, Network and Discrete
Location, JOHN WILEY & SON, Inc.
[28] Deuermeyer, B. and L. B. Schwarz, 1981, “A model for the
analysis of system service level in warehouse/retailer
distribution systems：the identical retailer case, in：L.
B. Schwarz（Ed）”, Management Science, Vol. 16, pp. 163-
193.
[29] Ganeshan, R., 1999, “Managing supply chains inventories：
a multiple retailer, one warehouse, multiple supplier
model”, International Journal of Production Economics,
Vol. 59, pp. 341-354.
[30] Gendreau, M., A. Hertz, and G. Laporte, 1994, “A tabu
search heuristic for the vehicle routing problem”,
Management Science, Vol. 40, pp. 1276-1290.
[31] Gillett, B. E. and L. R. Miller, 1974, “A heuristic
algorithm for the vehicle dispatch problem”, Operations
Research, Vol. 22, pp. 340-349.
[32] Glover, B., 1977, “A statistical approach to the TSP”,
Networks, Vol. 7, pp. 205-229.
[33] Hadely, G., and T. Whitin, 1963, Analysis of Inventory
Systems, Prentice Hall, USA.
[34] Hall, R., 1987, “Consoliation strategy：inventory,
vehicles and terminals”, Journals of Business Logistic,
Vol. 8, pp. 57-73.
[35] Hansen, P. H., B. Hegedahl, S. Hjortkjar and B. Obel,
1994, “A heuristic soultion to the warehouse location-
routing problem”, European Journal of Operational
Research, Vol. 76, pp. 111-127.
[36] Karp, R., 1972, Reducibility among combinatorial problems,
Complexity of Computer Computations. Plenum Press, New
York, pp. 85-104.
[37] Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi, 1983,
“Optimization by simulated annealing”, Science, Vol. 220,
pp. 167-175.
[38] Knox, J., 1989, “Tabu search performance on the symmetric
TSP”, Computers & Operations Research, Vol. 21, pp. 786-
802.
[39] Krolak et al., 1971, “A computational modification to the
savings method of vehicle scheduling”, Operational
Research Quarterly, Vol. 31, pp. 147-184.
[40] Laporte, G., Y. Nobert, 1981, “An exact algorithm for
minimizing routing and operating costs in depot
location”, European Journal of Operational Research, Vol.
6, pp. 224-226.
[41] Laporte, G., Y. Nobert, D. Arpin, 1986, “An exact
algorithm for solving a capacitated location-routing
problem”, Annals of Operations Research, Vol. 6, pp. 293-
301.
[42] Larson, R. C. and A. R. Odoni, 1981, Urban Operation
Research, Prentice-Hall, New Jersey.
[43] Lin, S., 1965, “Computer solution of the traveling
salesman problem”, Bell System Technical Journal, Vol.
44, pp. 2245-2269.
[44] Marc, P., 1996, “General local search methods”, European
Journal of Operational Research, Vol. 92, pp. 493-511.
[45] Morcer, H., and B. D. Mohamed, 1999, “Some stochastic
inventory models with deterministic variable lead time”,
European Journal of Operational Research, Vol. 113, pp. 42-
51.
[46] Or, I., And W. P. Pierskalla, 1979, ”A transportation
location-allocation model for regional blood banking”,
AIIE Transactions, Vol. 11, pp. 86-95.
[47] Osman, I. H., 1993, “Metastrategy simulated annealing and
tabu search algorithms for the vehicle routing problem”,
Annals of Operations Research, Vol. 41, pp. 421-451.
[48] Perl, J. and M. S. Daskin, 1985, “A warehouse location-
routing problem”, Transportation Research Quarterly, Vol.
19, pp. 381-396.
[49] Rutenbar, R. A., 1989, “Simulated annealing: an
overview”, IEEE Circuits and Devices Magazine, January,
pp. 19-26.
[50] Srivastava, R., 1993, “Alternate solution procedures for
the location-routing problem”, Omega International
Journal of Management Science, Vol. 21, pp. 497-506.
[51] Susan, H. O. and S. D. Mark, 1998, “Strategic facility
location”, European Journal of Operational Research, Vol.
111, pp. 423-447.
[52] Tai, H. W., L. Chinyao, W. B. Jiunn, 2002, “Heuristic
solutions to multi-depot location-routing problems”,
Computers & Operations Research, Vol. 29, pp. 1393-1415.
[53] Thomas, D. J. and P. M. Griffin, 1996, “Coordinated
supply chain management”, European Journal of Operational
Research, Vol. 94, pp. 1-15.
[54] Tuzun, D. and L. I. Burke, 1999, “A two-phase tabu search
approach to the location routing problem”, European
Journal of operational Research, Vol. 166, pp. 87-99.
[55] Verter, V. and M. C. Dincer, 1995, “Facility location and
capacity acquisition：an integrated approach”, Navel
Research Logistics, Vol. 42, pp. 1141-1160.
[56] Viswanathan, S. and K. Mathur, 1997, “Integrated routing
and inventory decisions in one-warehouse multiretailer
multiproduct distribution system”, Management Science,
Vol. 43, pp. 294-312.
[57] Webb, M. H. J., 1968, “Cost functions in the location of
depot for multiple-delivery journeys”, Operational
Research Quarterly, Vol. 19, pp. 311-328.
[58] Wolfe, P. and W. J. Baumol, 1958, “Warehouse location”,
Operations Research, Vol. 6, pp. 252-263.
[59] Yale, T. H. and L. Roberto, 1997, “The metered inventory
routing problem, an integrative heuristic algorithm”,
International Journal of Production Economics, Vol. 51,
pp. 69-81.
[60] Yunzeng, W. and Y. Gerchak, 1996, “Continuous review
inventory control when capacity is variable”,
International Journal of Production Economics, Vol. 45,
pp. 381-388.