English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22999298      Online Users : 348
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/49839


    Title: The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows
    Authors: Chen,HK;Chou,HW;Hsu,CY
    Contributors: 土木工程學系
    Keywords: CROSS-DOCKING;SUPPLY CHAIN;TRUCK
    Date: 2011
    Issue Date: 2012-03-27 16:18:19 (UTC+8)
    Publisher: 國立中央大學
    Abstract: This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.
    Relation: MATHEMATICAL PROBLEMS IN ENGINEERING
    Appears in Collections:[土木工程學系 ] 期刊論文

    Files in This Item:

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