English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65318/65318 (100%)
Visitors : 21646030      Online Users : 991
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/49838


    Title: The Linehaul-Feeder Vehicle Routing Problem With Virtual Depots
    Authors: Chen,HK;Chou,HW;Hsueh,CF;Ho,TY
    Contributors: 土木工程學系
    Keywords: HUB-AND-SPOKE;NETWORK DESIGN;CROSS-DOCKING;TRUCK;SELECTION;DELIVERY;SYSTEMS
    Date: 2011
    Issue Date: 2012-03-27 16:18:18 (UTC+8)
    Publisher: 國立中央大學
    Abstract: The problem addressed in this paper-the linehaul- feeder vehicle routing problem with virtual depots (LFVRP-VD)-can be regarded as an extension of the vehicle routing problem. During delivery operation, one large vehicle departs from the physical depot (PD) and services all virtual depots (VDs). A set of small vehicles delivers to customers and, if necessary, reloads either from the PD or from the large vehicle at a VD before continuing work. The objective of the operation is to minimize the total travel and waiting costs for all vehicles. Two heuristics that embed the cost-sharing method and the threshold method are proposed for initial solution construction. Seventeen test problems are extensively examined. The results show that the cost-sharing method outperforms the threshold method in terms of several selected performance measures. In addition, the more candidates available a VD can choose, the better the obtained objective value. Note to Practitioners-Linehaul-feeder vehicle routing problem with virtual depots is practical to the logistics and transportation companies, especially in the urban area where local streets are too narrow or large vehicles are not allowed to enter. Note that the higher the customer demands, the better the benefit of the LFVRP-VD.
    Relation: IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING
    Appears in Collections:[土木工程學系 ] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML240View/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  - 隱私權政策聲明