應用行產生法求解考量交通壅塞時間與 軟時間窗格之車輛途程問題;Using Column Generation to Solve the Vehicle Routing Problem with Soft Time Window and Traffic Congestion Time

NCU Institutional Repository > 管理學院 > 工業管理研究所 > 博碩士論文 > Item 987654321/64933

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/64933

題名:	應用行產生法求解考量交通壅塞時間與軟時間窗格之車輛途程問題;Using Column Generation to Solve the Vehicle Routing Problem with Soft Time Window and Traffic Congestion Time
作者:	江承璋;Chiang,Cheng-Chang
貢獻者:	工業管理研究所
關鍵詞:	車輛途程問題;軟時間窗格;交通壅塞時間;行產生法;Vehicle routing problem;Soft time window;Traffic congestion;Column generation
日期:	2014-07-28
上傳時間:	2014-10-15 14:34:25 (UTC+8)
出版者:	國立中央大學
摘要:	這篇論文主要探討是應用行產生法求解考量交通壅塞時間與軟時間窗格之車輛途程問題，在這問題中當車輛無法在各顧客特定時間窗格內服務顧客即會產生一懲罰成本加入目標式，並在特定的時間區間產生交通壅塞的尖峰時段，以上兩種性質都增加了求解可行解的困難度，在解法上我們利用行產生法的求解模式進行求解並利用動態規劃對子問題進行求解，在線性規劃中"行"用來表示路徑，並建立一子問題用來產生新的路徑進一步求出可行路徑及最佳解再利用狀態空間鬆弛法來求解，最後我們利用Solomom的例題進行測試。;This paper discusses a column generation for the Vehicle Routing Problem subject to soft time window restriction. In this problem, earliness or lateness is allowed although a penalty is incurred and added to solution cost whenever a vehicle serves a customer outside of his time window, and generate traffic congestion within a specific time. Both of them increase the complications of the problem and hard to find feasible solution. We present a column generation algorithm which is the exact optimization algorithm for this problem and then the branch and price help us optimization the result. In the linear programming column represents the route, and construct subproblem to generate new route for improve the answer and use state-space relaxation for dynamic programs to solve it and then we calculate different size of hard time windows problem that is from “Solomon benchmark problems”.
顯示於類別:	[工業管理研究所 ] 博碩士論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	483	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....