透過您的圖書館登入
IP:18.217.108.11
  • 學位論文

應用禁忌搜尋法求解多車種多物流中心之區位途程問題

Applying the Tabu Search to the Location-Routing Problem with Multi-Depot and Heterogeneous Fleet of Vehicles

指導教授 : 胡黃德

摘要


增加獲利率為企業營運的指標,而有效地規劃配送途程以降低物流成本,不但可以增加企業的獲利率,更可以提升本身服務品質,進而增加企業的競爭力。因此,在規劃物流配送系統時,不能只單一考慮到區位的因素,必須同時將車輛配送所造成之影響一起納入考量,以期運算出之物流總成本更能符合實際情況。本研究之目的乃結合工廠、物流中心與零售商形成一個三階層的物流配送系統,而此系統是以降低長期供應鏈之物流體系的成本為目標。因此,本研究針對物流中心的位置、車輛種類與規模大小、配送路徑規劃等方向進行研究,建構岀一數學模式,目標式為使總配送成本最低。再依據建構之數學模式發展出一套啟發式演算法,先以節省法 (Savings Method) 為基礎求得一組優良的起始解後,再以禁忌搜尋法 (Tabu Search) 進行物流中心間與物流中心內之改善。本研究結果顯示多車種所求得之成本優於單一車種。此結果再與一般最佳化軟體做比較,不僅能有效率的求得一組優越的解,在較龐大模型之問題下也能有效處理,以利於實務上之應用。

並列摘要


To increase the profit rate is the target of the business operation. The effective planning of the distribution routing can not only reduce the logistics cost but also enhance the service quality, and then increase the competitiveness of enterprise. Hence, to plan the logistics system, we should consider both facility location problem (FLP) and vehicle routing problem (VRP) simultaneously in order to decrease the total logistics cost. The purpose of this study was to integrate the three-level logistics system, e.g., plants, warehouses/depots, and customers to reduce the long-term supply chain cost. We also considered the vehicle fleet which is not necessarily composed of vehicles of the same size. Therefore, this study focused on the problem of the location of depots, types and fleet size of vehicle and the dispatch routing planning. We formulated a mathematical model, which is the minimum cost of logistics system. A two-phase heuristic algorithm was developed to solve the problem. The first phase used the original savings method to obtain the initial routing, the second phase improved between depots and within depot by a tabu search. The results showed that heterogeneous fleet of vehicle can decrease the cost significantly than the fleet with the same size. Finally, the results were compared with the optimum solution and showed that they were quickly obtained with the good solution quality in the large-size problems.

參考文獻


鄭啓忠,「配送中心場址規劃及選擇」,元智大學工業工程研究所,碩士論文, 1995。
許哲榮,「多產品配送中心場址規劃與選擇」,元智大學工業工程研究所,碩士論文,1998。
陳坤賓,「模擬退火演算法應用於車輛途程問題之研究」,元智大學工業工程研究所,碩士論文,1998。
徐明輝,「多部車一般性車輛途程解算法之研究」,元智大學工業工程研究所,碩士論文,1997。
敖君瑋,「禁制搜尋法於軟性時窗限制之車輛途程問題研究」,元智大學工業工程研究所,碩士論文,1999。

被引用紀錄


簡銓蔚(2013)。粒子群演算法應用於具容量限制的開放式車輛途程問題〔碩士論文,元智大學〕。華藝線上圖書館。https://doi.org/10.6838/YZU.2013.00359
王志仁(2007)。禁忌搜尋法應用於多產品宅配中心之車輛途程問題〔碩士論文,元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-2307200711322700
陳彥伯(2007)。混合式演算法於道路偵測器配置之應用〔碩士論文,國立虎尾科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0028-1501201314421468
蔡 佩 紋(2008)。應用禁忌搜尋法求解多車種多產品宅配中心之車輛途程問題〔碩士論文,元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-1607200821314400
鄭雁嬬(2009)。混合式演算法應用於同時收送貨之車輛途程問題〔碩士論文,元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-2007200916412200

延伸閱讀