應用行產生法求解考量交通壅塞時間與 軟時間窗格之車輛途程問題

Using Column Generation to Solve the Vehicle Routing Problem with Soft Time Window and Traffic Congestion Time

江承璋(Cheng-Chang Chiang)

指導教授 ： 葉英傑 博士

國立中央大學/管理學院/工業管理研究所/碩士(2014年)

摘要

這篇論文主要探討是應用行產生法求解考量交通壅塞時間與軟時間窗格之車輛途程問題，在這問題中當車輛無法在各顧客特定時間窗格內服務顧客即會產生一懲罰成本加入目標式，並在特定的時間區間產生交通壅塞的尖峰時段，以上兩種性質都增加了求解可行解的困難度，在解法上我們利用行產生法的求解模式進行求解並利用動態規劃對子問題進行求解，在線性規劃中"行"用來表示路徑，並建立一子問題用來產生新的路徑進一步求出可行路徑及最佳解再利用狀態空間鬆弛法來求解，最後我們利用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”.

並列關鍵字

Vehicle routing problem ； Soft time window ； Traffic congestion ； Column generation

參考文獻

3.Baldacci R, Mingozzi A, Roberti R. An exact method for the vehicle routing problem with time windows. In: 20 th International symposium of mathematical programming, Chicago.2009.

1.Agarwal, Y., K. Mathur, H. M. Salkin.. A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19 pp.731–749.1989.

2.Balakrishnan.N. Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows. The Journal of the Operational Research Society, Vol. 44, No. 3 pp. 279-287.1993.

5.Brian Kallehauge ,” Formulations and exact algorithms for the vehicle routing problem with time windows.” Computers & Operations Research 35 (2008) pp.2307 – 2330.2008.

6.Bhusiri, Narath; Qureshi, Ali Gul; Taniguchi, Eiichi. “The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem.” Transportation Research Part E, 62, pp.1–22.2014.