兩階段回溯式門檻接受法求解時窗限制回程取貨車輛路線問題之研究_

:::

詳目顯示

第 1 筆 / 總合 1 筆

/1頁

來源文獻資料
摘要
外文摘要
引文資料

題名：	兩階段回溯式門檻接受法求解時窗限制回程取貨車輛路線問題之研究
書刊名：	運輸計劃
作者：	卓裕仁／朱佑旌
作者(外文)：	Cho, Yuh-jen／Chu, You-jing
出版日期：	2008
卷期：	37:4
頁次：	頁405-429
主題關鍵詞：	時窗限制回程取貨車輛路線問題；巨集啟發式解法；兩階段回溯式門檻接受法；Vehicle routing problem with backhauls and time windows；VRPBTW；Meta-heuristics；Two-phase backtracking threshold accepting；TBTA
原始連結：	連回原系統網址
相關次數：	被引用次數:期刊(2) 博士論文(1) 專書(0) 專書論文(0) 排除自我引用:2 共同引用:0 點閱:29

時窗限制回程取貨車輛路線問題 (vehicle routing problem with backhaul and time windows, VRPBTW) 是車輛路線問題 (vehicle routing problem, VRP) 的延伸，屬於解題複雜度很高的 NP-hard問題，其在物流配送實務上具有很高的應用價值。本研究結合門檻接受法 (threshold accepting, TA) 與傳統啟發式方法，設計一套可求解 VRPBTW之兩階段回溯式門檻接受法 (two-phase backtracking threshold accepting, TBTA)，並採用 15題國際標竿例題進行測試，以分析此 TBTA巨集啟發式解法之解題績效。測試結果發現：車輛數之平均誤差百分比為 3.52%，行駛時間之平均誤差百分比為 2.81%， CPU之平均運算時間為 33.69秒；此結果顯示 TBTA法在求解 VRPBTW上具有應用潛力。

以文找文

The vehicle routing problem with backhauls and time windows (VRPBTW), which simultaneously considers the operations of delivery and pickup, is a variant of the classical vehicle routing problem (VRP). Successful application of the VRPBTW in real-world distribution will improve the performance of logistics. Due to the NP-hard complexity of VRPBTW, the most solution methods are heuristics and meta-heuristics. This paper aims to develop a two-phase backtracking threshold accepting (TBTA) meta-heuristic approach, which combines the threshold accepting (TA) meta-strategy and the traditional local search algorithms, to solve the VRPBTW. We adopted fifteen VRPBTW benchmark instances to test and analyze the performance of the proposed TBTA meta-heuristic. The average error percentages of TBTA are 3.52% for the objective of fleet size and 2.81% for the objective of traveling time. Moreover, the average value of CPU running time is merely 33.69 seconds. Computational results implied that the TBTA actually provides an efficient tool for VRPBTW applications.

以文找文

期刊論文
1.	Tarantilis, C.、Kiranoudis, C.、Vassiliadis, V.(2004)。A Threshold Accepting Metaheuristic for the Heterogeneous Fixed Fleet Vehicle Routing Problem。European Journal of Operational Research，152(1)，148-158。
2.	Dueck, G.、Scheuer, T.(1990)。Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing。Journal of Computational Physics，90(1)，161-175。
3.	Ropke, S.、Pisinger, D.(2006)。A unified heuristic for a large class of vehicle routing problems with backhauls。European Journal of Operational Research，171(3)，750-775。
4.	Yano, C. A.、Chan, Thomas J.、Richter, L. K.、Culter, T.、Murty, K.、McGettigan, D.、Yano, C.、Chan, T.、Richter, L.、Cutler, T.(1987)。Vehicle routing at quality stores。Interfaces，17(2)，52-63。
5.	林嘉玉、Haley, K. B.、Sparks, C.、Lin, C. K. Y.(1995)。A Comparative Study of both Standard and Adaptive Versions of Threshold Accepting and Simulated Annealing Algorithms in Three Scheduling Problems。European Journal of Operational Research，83，330-346。
6.	Potvin, J.、Duhamel, C.、Guertin, F.(1996)。A Genetic Algorithms for Vehicle Routing Problem with Backhauling。Applied Intelligence，6，345-355。
7.	Cho, Y. J.、Wang, S. D.(2005)。A Threshold Accepting Meta-heuristic for the Vehicle Routing Problem with Backhauls and Time Windows。Journal of the Eastern Asia Society for Transportation Studies，6，3022-3037。
8.	Rego, C.(2001)。Node-ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms。Parallel Computing，27，201-222。
9.	Cheung, R.、Hang, D.(2003)。Multi-attribute Label Matching Algorithms for Vehicle Routing Problems with Time Windows and Backhauls。IIE Transactions，35，191-205。
10.	Osman, I.(1993)。Metastrategy Simulation Annealing and Tabu Search Algorithms for the Vehicle Routing and Scheduling Problem with Time Windows。European Journal of Operational Research，41，421-451。
11.	Zhong, Y.、Cole, M.(2005)。A Vehicle Routing Problem with Backhauls and Time Windows: A Guided Local Search Solution。Transportation Research Part E，41，131-144。
12.	Tarantilis, C.、Kiranoudis, C.、Vassiliadis, V.(2003)。A List Based Threshold Accepting Metaheuristic for the Heterogeneous Fixed Fleet Vehicle Routing Problem。Journal of the Operational Research Society，54(1)，65-71。
13.	Gélinas, S.、Desrochers, M.、Desrosiers, J.、Solomon, M.(1995)。A New Branching Strategy for Time Constrained Routing Problems with Application to Backhauling。Annals of Operations Research，61，91-109。
14.	Reimann, M.、Ulrich, H.(2006)。Comparing Backhauling Strategies in Vehicle Routing Using Ant Colony Optimization。Central European Journal of Operations Research，14(2)，105-123。
15.	Thangiah, R.、Potvin, J.、Sun, T.(1996)。Heuristic Approach to Vehicle Routing with Backhauls and Time Windows。Computers and Operations Research，23(11)，1043-1057。
16.	Duhamel, C.、Potvin, J.、Rousseau, J.(1997)。A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows。Transportation Science，31(1)，49-59。

會議論文
1.	Reimann, M.、Doerner, K.、Hartl, R.(2002)。Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows。0。135-148。
2.	Hasama, T.、Kokubugata, H.、Kawashima, H.(1998)。A Heuristic Approach Based on the String Model to Solve Vehicle Routing Problem with Backhauls。0。
3.	卓裕仁、王生德(2003)。回程取貨車輛路線問題（VRPB）之解法回顧。0。1022-1031。延伸查詢
4.	卓裕仁、王生德(2004)。時窗限制回程取貨車輛路線問題之巨集啟發式解法設計與測試。0。188-194。延伸查詢
5.	Deif, I.、Bodin, L.(1984)。Extension of the Clarke-wright Algorithms for Solving the Vehicle Routing with Backhauling。0。75-96。

學位論文
1.	Solomon, M.(1983)。Vehicle Routing and Scheduling with Time Window Constraints: Models and Algorithms，U.S.A.。
2.	申生元(1999)。時窗限制車輛途程問題，0。延伸查詢

圖書論文
1.	Casco, D. O.、Golden, B. L.、Wasil, E. A.(1988)。Vehicle routing with backhauls: Models, algorithms, and case studies。Vehicle Routing: Methods and Studies。Amsterdam, Netherlands：Elsevier。

推文
推薦
引用網址
引用嵌入語法
轉寄

top

:::

相關期刊
相關論文
相關專書
相關著作
熱門點閱

1.	以改良型回溯門檻接受法求解回程取貨車輛路線問題之研究
2.	應用時窗離散策略與可回溯式門檻接受法求解VRPBTW問題之研究

1.	最小化整體死亡人數之大量傷病患事故救護車派遣模式

無相關書籍

無相關著作

無相關點閱

QR Code

臺灣人文及社會科學引文索引資料庫系統

詳目顯示

臺灣人文及社會科學引文索引資料庫