English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22954895      Online Users : 202
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


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


    Title: 時窗限制虛擬場站接駁補貨車輛途程問題之研究;Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows
    Authors: 許家筠;Chia-yuan Hsu
    Contributors: 土木工程研究所
    Keywords: 接駁補貨;實際場站;虛擬場站;禁制搜尋法;Linehaul-feeder;Tabu search;Virtual depot;Physical depot
    Date: 2008-06-20
    Issue Date: 2009-09-18 17:25:50 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 台灣都市地區部分巷道狹窄,致使大型貨車進出、臨時停車皆不容易;為因應此問題,已有部分物流業者利用載貨量大但機動性較低之大車(如貨車)搭配機動性高但載貨量較小之小車(如機車)進行接駁補貨的配送服務,針對配送方式,本研究提出「時窗限制之虛擬場站接駁補貨車輛途程問題」(linehaul-feeder vehicle routing problem with virtual depots and time windows, LFVRP-VD-TW),即大車、小車須在客戶預期收取貨物的時段內各自完成每一客戶的貨物配送,當小車送貨完畢時,除了返回實際場站(physical depot, PD)補貨亦可選擇直接前往大車所在之虛擬場站(virtual depot)進行補貨,補貨完畢小車即可再進行配送服務,節省小車往返場站之次數、距離與時間。 本研究根據其問題特性建構數學模型,並發展出一套建構初始途程模組與途程改善模組之兩階段啟發式演算法,其中,途程改善模組以禁制搜尋法為主軸,並結合路線間節點1-1交換法。根據LFVRP-VD(何宗育,2007)研究,從The VRP Web題庫裡所挑選出的17題範例,作為本研究的範例基礎,並針對本研究之問題特性設計為LFVRP-VD-TW之測試例題並作測試結果分析。測試結果可知,17題範例的平均目標函數值為2673.15,平均運算時間54.61秒,改善率達10.59%。 Due to the scarcity of land resources for the access limitations of local streets for accommodating large vehicles in urban areas, some home delivery companies have invented a new type of vehicle routing and operations which involves two types of vehicles. This problem can be regarded as an extension of the vehicle routing problem and is named as the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRP-VD-TW). It means that a big vehicle departs from the physical depot (PD) and traverses all virtual depots (VD), whereas a set of small vehicles performs delivery to customers and, if necessary, reloads the commodity either from the PD or from the big vehicle at a VD before continuing their work. During the operation, all of vehicles must perform delivery during the time window of the customers. In this research, the LFVRP-VD-TW is formally formulated as a mixed integer programming problem. In addition, a meta-heuristics which includes tour construction and tour improvement procedure which consists of the tabu search and the exchange method is proposed for solving it. Seventeen test problems modified from the LFVRP-VD (Chen et al., 2007) benchmark instances were extensively examined. The results show that the average objective value of the seventeen test problems is 2673.15, and it could be reduced 10.59% by the tour improvement procedure.
    Appears in Collections:[土木工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat
    0KbUnknown783View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明