Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm
學年 97
學期 2
出版（發表）日期 2009-05-01
作品名稱 Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm
作品名稱（其他語言）
著者 Cheng, Chi-Bin; Wang, Keng-Pin
單位 淡江大學資訊管理學系
出版者 Kidlington: Pergamon
著錄名稱、卷期、頁數 Expert Systems With Applications 36(4), pp.7758-7763
摘要 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.
關鍵字 Vehicle routing problem with time windows; Problem decomposition; Traveling salesman problem with time windows; Genetic algorithm; Insertion method; Heuristics
語言 en_US
ISSN 0957-4174
期刊性質 國外
收錄於 SCI EI
產學合作
通訊作者 Cheng, Chi-Bin
審稿制度
國別 GBR
公開徵稿
出版型式 紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/55163 )

機構典藏連結
SDGS 產業創新與基礎設施