區位途程與易腐性商品排程之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：22

、訪客IP：3.147.89.105

姓名

池昆霖(Kun-Lin Chih) 查詢紙本館藏

畢業系所

土木工程學系

論文名稱

區位途程與易腐性商品排程之研究
(A Study on Location Routing Problem and Production Scheduling for Perishable Goods)

相關論文

★ 圖書館系統通閱移送書籍之車輛途程問題	★ 起迄對旅行時間目標下高速公路匝道儀控之研究
★ 結合限制規劃法與螞蟻演算法求解運動排程問題	★ 共同邊界資料包絡分析法在運輸業之應用-以國內航線之經營效率為例
★ 雙北市公車乘客知覺服務品質、知覺價值、滿意度、行為意向路線與乘客之跨層次中介效果與調節式中介效果	★ Investigating the influential factors of public bicycle system and cyclist heterogeneity
★ A Mixed Integer Programming Formulation for the Three-Dimensional Unit Load Device Packing Problem	★ 高速公路旅行時間預測之研究--函數資料分析之應用
★ Behavior Intention and its Influential Factors for Motorcycle Express Service	★ Inferring transportation modes (bus or vehicle) from mobile phone data using support vector machine and deep neural network.
★ 混合羅吉特模型於運具選擇之應用-以中央大學到桃園高鐵站為例	★ Preprocessing of mobile phone signal data for vehicle mode identification using map-matching technique
★ 含額外限制式動態用路人均衡模型之研究	★ 動態起迄旅次矩陣推估模型之研究
★ 動態號誌時制控制模型求解演算法之研究	★ 不同決策變數下動態用路人均衡路徑選擇模型之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

摘要
易腐性商品的價值會隨著時間而遞減，為了有效的追求廠商利潤的最大化，本研究嘗試將生產排程、車輛途程兩種問題加以整合，並納入區位選擇以及時窗限制之要求，最後定式為ㄧ雙層混合整數規劃模型。本研究亦同時研提一啟發式求解演算法:上層部分先暫時固定場站位置，再求解下層問題，下層部分利用分解(decomposition)的概念將問題分解成生產排程問題與車輛途程問題；生產排程部份採用Nelder-Mead 演算法來求解，至於配送部份利用修正後的插入法(insert method)來建構初始解。由於現今低溫冷凍商品之市場佔有率日益增加，因此易腐性商品生產排程與車輛途程問題之重要性也將隨之提高，而製造工廠的設置區位，更是企業期初投資成本的ㄧ大考量，本研究在短期最佳化的情況下去求解長期的成本最小化問題，因此建構此一雙層規劃模型，為了增加本模型之實用性，建立友善之使用者界面以及提高演算法之效率，將成為未來重要之研究方向。

摘要(英)

The value of the perishable goods will decrease by the time. In order to efficiently find the maximized profit for the manufactory, we try to integrate the production scheduling, vehicle routing problem, take into the location problem, time window constrains, and finally formulate a bi-level integer programming problem. We also propose a heuristic solution algorithm, and we fixed the location of depots at the upper-level, then to solve the lower-level. At the lower-level, we use the concept of decomposition to decompose the problem as production scheduling problem and vehicle routing problem. At the part of production schedule, we use the Nelder-Mead algorithm to solve, and use the modified insert method to construct the initial solution at the part of vehicle routing. As the result of increasing of market share ratios for frozen production by the day, therefore it is more important in the production scheduling for perishable goods and vehicle routing problem. And it’s a major factor for a business to determine the location in the beginning investment cost. The study solving the minimum long-term cost problem under the condition of short-termed optimization, therefore we construct a bi-level programming modal. For increasing the practicability of the modal, it will be an important research direction to set up friendly user interface and improve the efficient of algorithm in the future.

關鍵字(中)

★ Nelder-Mead 演算
★ 易腐性商品
★ 生產排程與車輛途程問題
★ 區位選擇

關鍵字(英)

★ Location
★ Production Scheduling and Vehicle Routing
★ Nelder-Mead Algorithm
★ Perishable Commodity

論文目次

第一章緒論 1
1.1 研究背景與動機 1
1.2 研究範圍與假設 2
1.3 研究目的與流程 3
第二章文獻回顧 5
2.1 區位選擇問題 5
2.1.1 區位問題 5
2.1.2 指派演算法 11
2.1.3 模型的分類 14
2.2 車輛途程問題 16
2.2.1 含時窗限制之車輛途程問題 16
2.2.2 含時窗限制之車輛途程問題求解方法 17
2.3 雙層規劃數學問題 21
2.4 易腐性商品排程問題 25
2.5 小結 26
第三章模型建構 27
3.1 雙層規劃數學模型的特性 27
3.1.1 模型描述 27
3.1.2 模型特性 27
3.1.3 模型求解 28
3.2 區位選擇模型 28
3.2.1 設施區位問題 29
3.2.2 車輛途程問題 31
3.3 雙層區位途程問題之模型 33
3.3.1 易腐性商品的特性 33
3.3.2 模型假設 33
3.3.3 符號說明 34
3.3.4 數學模型 35
第四章求解演算法 40
4.1 雙層求解演算法 40
4.2 生產排程與車輛途程演算法 44
4.2.1 第一個子問題求解演算法 45
4.2.2 第二個子問題求解演算法 48
4.3 修正後的演算法 57
4.3.1 雙層問題之修正 57
4.3.2 下層問題之修正 58
第五章範例測試與分析 60
5.1 範例題庫的建立 60
5.2 範例的測試結果 64
5.3 修正後測試結果 65
5.4 敏感度分析 66
第六章結論與建議 69
6.1 結論 69
6.2 建議 70
參考文獻 72

參考文獻

參考文獻
[1] 蔡輝昇(1985)，「配送中心位置和運輸路線問題聯立最佳解之研究」，運輸計畫季刊，第十四卷，第一期，pp. 117-127，台北。
[2] 陳春益(1994)，「建立物流中心區位模式之研究」，運輸計畫季刊，第二十八卷，第三期，pp. 305-325，台北。
[3] 陳春益(2000)，「網路區位問題應用在車隊管理之探討」，中華民國第四屆運輸網路研討會論文集，pp. 115-125，台南。
[4] 曾琬芸(2000)，「動態人口分布最佳化控制之研究-雙層規劃模型之應用」，國立中央大學土木工程學系碩士論文，中壢。
[5] 吳琴玲(2000)，「物流配送系統之區位-途程問題研究」，國立雲林科技大學工業工程學管理研究所碩士論文，雲林。
[6] 林志鴻、陳春益、曹以明(2000)，「汽車運送業拖車調度問題求解之研究」，中華民國第五屆運輸網路研討會論文集，pp. 205-215，台中。
[7] 陳信宏(2001)，「考慮回程撿收之設施位置-車輛途程問題演算法之研究」，大葉大學工業工程系碩士論文，彰化。
[8] 林燦煌(2003)，「有容量限制之動態設施區位問題」，國立高雄第一科技大學運輸與倉儲營運系碩士論文，高雄。
[9] 薛哲夫(2005)，「車輛途程規劃暨產銷整合課題探討」，國立中央大學土木工程學系博士論文，中壢。
[10] Abad, P.L., (1996), “Optimal Pricing and Lot-sizing under Conditions of Perish Ability and Partial Backordering,” Management Science, Vol. 42, pp. 1093-1104.
[11] Andrew, L., and Fan, W., (2005), “Multi-Depot Vehicle Routing Problem：A One-Stage Approach,” IEEE Transactions on Automation Science and Engineering, Vol. 2, No. 4, pp. 397-402.
[12] Aykin, T., (1995), “The Hub Location and Routing Problem,” European Journal of Operational Research,” Vol. 83, pp. 200-219.
[13] Albareda-Sambola, M., Diaz. J.A., and Fernandez, E., (2005), “A Compact Model and Tight Bounds for a Combined Location-Routing Problem,” Computers and Operations Research, Vol. 32, pp. 407-428.
[14] Bard, J.F., (1998), Practical Bi-level Optimization-Algorithms and Applications, Kluwer academic publishers, Dordrecht/Boston/London.
[15] Braysy, O., and Gendreau, M., (2005), “Vehicle Routing Problem with Time Windows Part I: Construction and Local Search Algorithm,” Transportation Science, Vol. 39, No. 1, pp. 104-118.
[16] Brotcoren, L., Labbe, M., Marcotte, P., and Savard, G., (2000), “A Bi-level Model and Solution Algorithm for a Freight Tariff-Setting Problem,” Transportation Science, Vol. 34, pp. 289-302.
[17] Ben-Ayed, O., Boyce, D.E., and Blair, C.E., (1998), “A General Bi-level Programming Formulation of the Network Design Problem,” Transportation Research Part B, pp. 311-318.
[18] Bodin, L., and Golden, B., (1981), “Classification in Vehicle Pouting and Scheduling,” Networks, Vol. 11, pp. 97-108.
[19] Cappanera, P., Gallo, G., and Maffioli, F., (2004), “Discrete Facility Location and Routing of Obnoxious Activities,” Discrete Applied Mathematics, Vol. 133, pp.3-28.
[20] Cao, D., and Chen, M., (2006), “Capacitated Plant Selection in a Decentralized Manufacturing Environment: A Bi-level Optimization Approach,” European Journal of Operational Research, Vol. 169, pp. 97-110.
[21] Christopher, M.G., (1992), Logistics and Supply Chain Management (3rd edition), Pearson P T R, USA.
[22] Chao, I.M., Golden,B.L., and Wasil, E., (1993), A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves Upon Best-Known Solution, Am. J. Math. Mgmt. Sci, Vol. 13, pp. 371-406.
[23] Clarke, G., and Wright, J.W., (1964), “Scheduling of Vehicles from a Central Depot to a Number of Delivery Point,” Operations Research, Vol. 12, No. 4, pp. 568-581
[24] Colson, B., Marcotte, P., and Savard, G., (2005), “Bi-level Programming: A Survey,” A Quarterly Journal of Operations Research, Vol. 3, pp. 87-107.
[25] Daskin., M.S., (1995), Network and Discrete Location /Models, Algorithms, and Applications, John Wiley & Sons, New York.
[26] Garey, M.R., and Johnoson, D.S., (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, USA.
[27] Gillett, B.E., and Johnson, J.G., (1976), Multi-Terminal Vehicle-Dispatch Algorithm, Omega, Vol. 4, No. 6, pp. 711-718.
[28] Golden, B.L., Masgnanti, T.L., and Nguyen, H.Q., (1977), Implementing Vehicle Routing Algorithms, Networks, Vol. 7, pp. 113-148.
[29] Hokey, M., Vaidyanathan, J., and Rajesh, S., (1998), “Combined Location-Routing Problems: A Synthesis and Future Research Direction,” European Journal of Operational Research, Vol. 108, pp. 1-15.
[30] Klose, A., and Drexl, A., (2004), “Facility Location Models for Distribution System Design,” European Journal of Operational Research, Vol. 162, pp. 4-29.
[31] Laporte, G., Nobert, Y., and Taillefer, S., (1988), “Solving a Family of Multi-Depot Vehicle Routing and Location–Routing Problem,” Transportation Science, Vol. 22, No. 3, pp. 161-172.
[32] Li, S., Huang, Z., and Ashley, A., (1996), “Improving Buyer-Seller System Cooperation Though Inventory Control,” International Journal of Production Economics, Vol. 43, No. 1, pp. 37-46.
[33] Lin, S., and Kernighan, B., (1973), “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operations Research, Vol. 21, pp. 498-516.
[34] Nelder, J.A., and Mead, R., (1965), “A Simplex for Function Minimization,” Computer Journal Vol. 7, pp. 308-313.
[35] Omar, B.A., (1991), “Bi-level Linear Programming,” Computers & Operation Research, Vol. 20, No. 5, pp. 485-501.
[36] Or, I., (1976), “Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood Banking,” Ph.D. Thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL., USA.
[37] Pasternack, B.A., “Optimal Pricing and Return Policies for Perishable Commodities,” Marketing Science, Vol. 4, pp. 166-176.
[38] Patrice, M., Gilles, S., and Frederic, S., (2004), “A Bi-level Programming Approach to the Traveling Salesman Problem,” Operations Research Letters, Vol. 32, pp. 240-248.
[39] Perl, J., and Daskin, M., (1985), “A Warehouse Location-Routing Problem,” Transportation Research, Vol. 19B, No. 5, pp. 381-396.
[40] Polacek, M., Hartl, R.F., and Doerner, L., (2004), “A Variable Neighborhood Search for the Multi-Depot Vehicle Routing Problem with Time Windows,” Journal of Heuristics, Vol. 10, pp. 613-627.
[41] Raafat, F., (1991), “Survey of Literature on Continuously Deteriorating Inventory Model,” Journal of Operational Research Society, Vol. 1, pp. 27-37.
[42] Racunica, I., and Wynter, L., (2005), “Optimal Location of Inter-model Freight Hubs,” Transportation research part B, Vol. 39, pp.453-477.
[43] Santoso, T., Ahemed, S., Goetschalckx, M., and Shapiro, A., (2004),”A Stochastic Programming Approach for Supply Chain Network Design under Uncertainty,” European Journal of Operational Research, Vol. 167, pp. 96-115.
[44] Stevenson, W.J., (1993), Production/Operations Management, New York; Richard D. Irwin, Inc,
[45] Teng J.T., and Ouyang, L.Y., (2005), “An EOQ Model for Deteriorating Items with Power-Form Stock-Dependent Demand,” Information and Management Sciences, Vol. 16, pp. 1-16.
[46] Thomas, D.J., and Griffin, P.M., (1996), “Coordinated Supply Chain Management,” European Journal of Operational Research, Vol. 94, pp. 1-15.
[47] Tuzun, D., and Burke, L.I., (1999), “A Two-phase Tabu Search Approach to The Location Routing Problem,” European Journal of Operational Research, Vol. 116, pp. 87-99.
[48] Wen, U.P., and Yang, Y.H., (1990), “Algorithms for Solving the Mixed Integer Two-Level Linear Programming Problem,” Computer and Operation Research, Vol. 17, No. 2, pp. 133-142.
[49] Wen, U.P., and Huang, A.D., (1996), “A Simple Tabu Search Method Solve the Mixed-integer Linear Bi-level Programming Problem,” European Journal of Operational Research, Vol. 88, pp. 563-571.
[50] Yang, P.C., (1998), “An Inventory Ordering Policy for Deteriorating Items with Multiple Deliveries,” Industrial Engineering Department, Chung Yuan Christian University Chungli, Taiwan 32023, Republic of China.
[51] Zdrzalka, S., (1995), “Analysis of Approximation Algorithms for Single-machine Scheduling with Delivery Times and Sequence Independent Batch Setup Times,” European Journal of Operational Research, Vol. 80, pp. 371-380.

指導教授

陳惠國(Huey-Kuo Chen)

審核日期

2006-7-21

推文