English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54043/88873 (61%)
造访人次 : 10548482      在线人数 : 20
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/105948


    题名: A heuristic method for the vehicle routing problem with backhauls and inventory
    作者: Liu, S. C.;Chung, C. H.
    关键词: Vehicle routing problem with backhauls (VRPB);Vehicle routing problem with backhauls and inventory (VRPBI);Heuristic method;NP-hard;Variable neighborhood tabu search (VNTS)
    日期: 2009/02/01
    上传时间: 2016-04-22 13:11:52 (UTC+8)
    出版者: Springer
    摘要: The purpose of this paper is to determine the route of the vehicle routing problem with backhauls (VRPB), delivering new items and picking up the reused items or wastes, and resolve the inventory control decision problem simultaneously since the regular VRPB does not. Both the vehicle routing decision for delivery and pickup, and the inventory control decision affect each other and must be considered together. Hence, a mathematical model of vehicle routing problem with backhauls and inventory (VRPBI) is proposed. Since finding the optimal solution(s) for VRPBI is a NP-hard problem, this paper proposes a heuristic method, variable neighborhood tabu search (VNTS), adopting six neighborhood searching approaches to obtain the optimal solution. Moreover, this paper compares the proposed heuristic method with two other existing heuristic methods. The experimental results indicate that the proposed method is better than the two other methods in terms of average logistic cost (transportation cost and inventory cost).
    關聯: Journal of Intelligent Manufacturing 20(1), pp.29-42
    DOI: 10.1007/s10845-008-0101-9
    显示于类别:[教育科技學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML117检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈