查詢結果分析
來源資料
相關文獻
- An Exact Algorithm for Vehicle Routing Problem with Time Windows and Stochastic Travel Times
- 物流中心之模糊多目標與混合型時窗限制配送車輛途程問題之研究
- 企業運輸配送問題暨模式探討
- 應用螞蟻演算法於時窗限制車輛途程問題之研究
- 整合多層級配銷管理系統成本改善模式建構
- 以啟發式演算法求解具時窗限制車輛途程問題--以叢集分布便利商店配送為例
- 考慮混合分批送貨和取貨之車輛途程問題數學模式建構
- 即時性的時窗限制巡邏車輛節線途程問題之研究
- 具工作負荷平衡之配送車輛途程問題研究
- A Method for Vehicle Routing Problem with Multiple Vehicle Types and Time Windows
頁籤選單縮合
題名 | An Exact Algorithm for Vehicle Routing Problem with Time Windows and Stochastic Travel Times=含時窗限制暨機率型旅行時間車輛途程問題之真正解演算法探討 |
---|---|
作者姓名(中文) | 陳惠國; 薛哲夫; 張美香; | 書刊名 | 運輸學刊 |
卷期 | 23:4 2011.12[民100.12] |
頁次 | 頁437-476 |
分類號 | 557.81 |
關鍵詞 | 車輛途程問題; 隨機旅行時間; 時窗限制; 隨機規劃; Vehicle routing problem; Stochastic travel times; Time windows; Stochastic programming; |
語文 | 英文(English) |
中文摘要 | 本研究探討同時具有隨機旅行時間與服務時窗限制特性之車輛途程問題(簡稱VRPTW-ST),其主要內容為藉由妥善安排車輛路線以及離開服務顧客的時間,來達成一般化總成本期望值最小化的目標。VRPTW-ST問題可以建構為隨機規劃問題,然後利用分枝與切割法求解。本研究所研提之切割可以做為原目標函數之下限,因此所得結果為真正解。為提升演算法之效率,本研究亦探討加收斂速度之求解技巧,經由測試結果顯示,25個節點規模之問題在Intel PIII 550 CPU及128MB RAM的環境下均可在10分鐘之內求得真正解。 |
英文摘要 | This paper considers the vehicle routing problem with time windows and stochastic travel times (VRPTW-ST), in which the expected total general cost is minimized by optimally determining the vehicle routes as well as departure times from each node/customer. The VRPTW-ST is mathematically formulated as a stochastic programming model and solved by a branch-and-cut solution algorithm which involves a brand new class of cuts. These cuts serve as the lower bounds of the original objective and hence make the obtained solution to be exact. Some skills to accelerate the rate of convergence are also discussed. Computational results indicate that problems with 25 nodes can be solved to optimality within 10 minutes under the environment of Intel PIII 550 CPU and 128MB RAM. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。