English  |  正體中文  |  简体中文  |  Items with full text/Total items : 76531/76531 (100%) Visitors : 29744286      Online Users : 292
 RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
 Scope All of NCUIR Engineering College    Graduate Institute of Civil Engineering       --Electronic Thesis & Dissertation Tips: please add "double quotation mark" for query phrases to get precise resultsplease goto advance search for comprehansive author search Adv. Search
 NCUIR > Engineering College  > Graduate Institute of Civil Engineering > Electronic Thesis & Dissertation >  Item 987654321/1211

 Please use this identifier to cite or link to this item: `http://ir.lib.ncu.edu.tw/handle/987654321/1211`

 Title: 多車種接駁補貨車輛途程問題;A Study of the Feeder Vehicle Routing Problem Authors: 何宗育;Tsung-yu Ho Contributors: 土木工程研究所 Keywords: 啟發式解法;多車種;接駁補貨;車輛途程問題;Heuristic Algorithm.;Heterogeneous Fleet;Feeder;Vehicle Routing Problem Date: 2007-07-04 Issue Date: 2009-09-18 17:23:33 (UTC+8) Publisher: 國立中央大學圖書館 Abstract: 台灣都市地區部分巷道狹窄，致使大型貨車進出、臨時停車皆不容易；為因應此問題，物流業者使用機動性高但載貨量較小之輕便車輛(如機車)進行貨物配送，然而此舉可能造成車輛往返配送場站中心之次數與距離增加。近年來已有部分業者利用載貨量大但機動性較低之大車(如貨車)搭配機動性高但載貨量較小之小車(如機車)進行聯合貨物配送，亦即大車、小車各自進行貨物配送，當小車送貨完畢時，除了返回場站補貨亦可選擇直接前往大車所在位置補貨，補貨完畢小車即可再進行送貨服務，節省小車往返場站之次數、距離與時間。 針對上述問題，本研究提出「接駁補貨車輛途程問題」(Feeder Vehicle Routing Problem, FVRP)，根據問題特性建構數學模型，並提出預估平均法、門檻法兩種啟發式求解架構，再根據測試題庫The VRP Web為基礎，從中挑選出17題設計為FVRP之測試例題並作測試結果分析。經由測試結果比較，發現在測試例題的改善解當中，預估平均法的表現較良好，其最重要之原因為求解過程中預估平均法選擇較多補貨點，使小車補貨選擇更有彈性；而將測試例題補貨候選點由4點增為8點時，小車補貨選擇增加，可改善目標值約5.8%；最後提出本問題後續研究方向與建議。 Due to scarcity of land resources, urban streets in Taiwan, especially those at local street level, are often not wide enough for big cars performing temporary parking and home delivery services. To solve this problem, few home delivery companies have invented a new type of vehicle routing and operations which involves two types of vehicles. During the operation, a big vehicle departs from the depot and travels along several “legitimate” stops whereas a set of small vehicles performs delivery to customers and, if necessary, reloads the commodity either from the depot or from the big vehicle at stops and then continues their work. The objective of the operation is to minimize the total travel cost. This new service not only overcomes the difficulty of accessing “narrowed” local streets with high-capacity big cars but also saves the low-capacity small vehicles a number of times to and from the depot to reload the commodities. This problem can be regarded as an extension of the Vehicle Routing Problem and for easy of reference is named as the Feeder Vehicle Routing Problem (FVRP). In this research, the FVRP problem is formally formulated as a mixed integer programming problem and two heuristics, namely the method of average and the threshold method, are proposed for solving it. 17 test problems modified from a set of classical VRP benchmark instances were extensively examined. The results show that the method of average outperforms the threshold method in terms of the objective value, though the latter does have some nice features from the algorithmic point of view. In addition, we also observed that more candidates of stops allowed for the big car, the better objective value would be obtained. To conclude the research, a few remarks were made in the end. Appears in Collections: [Graduate Institute of Civil Engineering] Electronic Thesis & Dissertation

Files in This Item:

File SizeFormat