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


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


    题名: A Study on the application of genetic algorithms on the Dial-A-Ride Problem
    作者: Chiu, Hsien-Ming;Huang, Han-Shuan
    贡献者: 淡江大學運輸管理學系
    关键词: Dial-and-Ride Problem;Genetic Algorithms;Meta-heuristic
    日期: 2008-04
    上传时间: 2013-01-18 22:10:55 (UTC+8)
    出版者: Stevens Point, Wisconsin: The WSEAS (The World Scientific and Engineering Academy and Society)
    摘要: The Dial-a-Ride Problem (DARP) is a vehicle routing problem faced in arranging Dial-a-Ride services. The DARP has been proven a NP-Hard problem; therefore, most research has used heuristic solution methods to address this issue. The purpose of this study is to evaluate of the application of a Diversity Control Adaptive Genetic Algorithm (DCAGA) and Family Competition Genetic Algorithm (FCGA) on the DARP. This study proposed two solution procedures, which were integrated approach and cluster approach. A series of case studies with different characteristics, such as demand density and demand size, were used to test the solution capability of the proposed algorithms. Based on the results of the case studies, the Diversity Control Adaptive Genetic Algorithm is identified as the best algorithm in solution quality. Overall, the solution of the integrated procedure is better than, those of the two-phase procedure.
    關聯: WSEAS Transactions on Business and Economics 5(4), pp.128-133
    显示于类别:[運輸管理學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML344检视/开启
    wseas2008chiu[1].pdf論文385KbAdobe PDF339检视/开启

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

    TAIR相关文章

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