查詢結果分析
相關文獻
- 應用粒子群演算法求解開放式車輛路線問題之研究
- 包容性深廣度搜尋法在週期性車輛路線問題之應用
- 巨集啟發式解法在求解大規模旅行推銷員問題之應用
- 並聯換流器轉換效率提升之控制策略
- 萬大水庫崩塌地之非監督式影像判釋:模糊粒子群演算法與自我組織映射圖研究
- 考量機率特性之結合反應曲面法與非線性時變粒子群演算法於電力諧波濾波器最佳化設計
- A HPSO Approach for Solving the Simultaneous Dynamic DBAP and QCAP in a Container Terminal
- 基於多種群量子粒子群的粗糙集屬性約簡演算法在故障診斷中的應用
- PSO植基於GARCH與EGARCH建構匯率預測模型
- 結合反應曲面法與非線性時變粒子群演算法於太陽能電池傾斜角之最佳化設計
頁籤選單縮合
題 名 | 應用粒子群演算法求解開放式車輛路線問題之研究=Particle Swarm Optimization Algorithms for the Open Vehicle Routing Problem |
---|---|
作 者 | 韓復華; 楊禮瑛; | 書刊名 | 運輸學刊 |
卷 期 | 25:2 2013.06[民102.06] |
頁 次 | 頁199-220 |
分類號 | 310.153 |
關鍵詞 | 開放式車輛路線問題; 粒子群演算法; 巨集啟發式解法; Open vehicle routing problem; OVRP; Particle swarm optimization; PSO; Metaheuristics; |
語 文 | 中文(Chinese) |
中文摘要 | 本研究應用粒子群演算法(Particle Swarm Optimization, PSO)求解開放式車輛路線問題 (Open Vehicle Routing Problem, OVRP),應用Ai and Kachitvichyanukul提出之SR-2編碼方式以及GLNPSO的學習策略作為主要求解方法,並額外增加2-Opt*與Or-Opt鄰域改善模組以加強演算法的深度搜尋,以降低求解粒子數之運用,兼顧求解效率及其品質。本研究以32題國際標竿例題進行測試,求解績效顯示:總車輛數誤差為0輛;距離成本方面,18題可求得文獻已知最佳解。本研究另外將所設計之演算法應用於求解VRP問題,以14題國際標竿例題進行測試,結果求得7題目前文獻已知最佳解,平均誤差僅為0.51%。 |
英文摘要 | This paper applies a Particle Swarm Optimization (PSO) algorithm for solving the Open Vehicle Routing Problem (OVRP). We adopted the SR-2 solution representation and the corresponding decoding method in the PSO framework proposed by Ai and Kachitvichyanukul. The major difference between their work and this paper is that we added the 2-Opt* and Or-Opt local improvement procedures into the PSO framework. The addition of local improvement procedures has significant effects on the solution quality and the computational efficiency. The proposed algorithm was tested on 32 OVRP benchmark instances. Results showed that our proposed algorithm can find 18 best-known solutions out of the 32 benchmark instances tested. We also applied the proposed method for solving the conventional VRP, and found 7 best-known solutions among 14 instances tested. The average deviation from the best-known solution is 0.51%. |
本系統中英文摘要資訊取自各篇刊載內容。