淡江大學機構典藏:Item 987654321/80170
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62805/95882 (66%)
造訪人次 : 3880711      線上人數 : 254
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: 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.html0KbHTML339檢視/開啟
    wseas2008chiu[1].pdf論文385KbAdobe PDF336檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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