English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90074/105197 (86%)
Visitors : 7159413      Online Users : 41
RC Version 6.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
    ASIA unversity > 管理學院 > 經營管理學系  > 期刊論文 >  Item 310904400/18350


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/18350


    Title: Two Approaches for Solving the Multi-Depot Vehicle Routing Problem with Time Windows in a Time-Based Logistics Environment
    Authors: 邱煥能;Huan Neng Chiu;Yi Shyang Lee;Jen Huei Chang
    Contributors: 經營管理學系
    Keywords: Multi-depot vehicle routing problem with time windows;Two-phase heuristic method;Meta-heuristic method;Diverse and greedy strategy
    Date: 2006-07
    Issue Date: 2012-11-26 12:47:35 (UTC+8)
    Abstract: This paper presents a two-phase heuristic method that can be used to efficiently solve the intractable multi-depot vehicle routing problem with time windows. The waiting time that was ignored by previous researchers is considered in this study. The necessity of this consideration is verified through an initial experiment. The results indicate that the waiting time has a significant impact on the total distribution time and the number of vehicles used when solving test problems with narrow time windows. In addition, to fairly evaluate the performance of the proposed heuristic method, a meta-heuristic method, which extends the unified tabu search of Cordeau et al., is proposed. The results of a second experiment reveal that the proposed heuristic method can obtain a better solution in the case of narrow time windows and a low capacity ratio, while the proposed meta-heuristic method outperforms the proposed heuristic method, provided that wide time windows and a high capacity ratio are assumed. Finally, a well-known logistics company in Taiwan is used to demonstrate the method, and a comparison is made, which shows that the proposed heuristic method is superior to the current method adopted by the case company.
    Relation: PRODUCTION PLANNING & CONTROL,17(5):480-493.
    Appears in Collections:[經營管理學系 ] 期刊論文

    Files in This Item:

    There are no files associated with this item.



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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback