English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51756/86971 (60%)
造訪人次 : 8355248      線上人數 : 92
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/55163

    題名: Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm
    作者: Cheng, Chi-Bin;Wang, Keng-Pin
    貢獻者: 淡江大學資訊管理學系
    關鍵詞: Vehicle routing problem with time windows;Problem decomposition;Traveling salesman problem with time windows;Genetic algorithm;Insertion method;Heuristics
    日期: 2009-05
    上傳時間: 2011-08-19 12:06:00 (UTC+8)
    出版者: Kidlington: Pergamon
    摘要: The present study investigates the cost concerns of distribution centers and formulates a vehicle routing problem with time window constraints accordingly. Based on the embedded structure of the original problem, a decomposition technique is employed to decompose the original problems to a clustering problem (main problem) and a set of traveling salesman problems (sub-problems) with time window constraints. This decomposition not only reduces the problem size but also enable the use of simpler solution procedures. A genetic algorithm is developed to solve the clustering problem, while a simple heuristic algorithm is formulated to solve the set of traveling salesman problems. The solution of the original problem is obtained through iterative interactions between the main problem and the set of sub-problems. The performance of the proposed approach is compared with the well-known insertion method and a manual scheduling of a distribution center.
    關聯: Expert Systems With Applications 36(4), pp.7758-7763
    DOI: 10.1016/j.eswa.2008.09.001
    顯示於類別:[資訊管理學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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