查詢結果分析
相關文獻
- Solving the Multi-Depot Location Routing Problem with Multiple Use of Vehicles Using Genetic Algorithm
- 都市計畫草圖替選方案分析模式之實例研究
- 運用類神經網路於股價指數之套利--以日經225指數為例
- 二次元靜態連續體結構之最佳化:應用族群概念之基因演算法
- 遺傳基因演算法在彈性製造系統排程問題之探討
- 適應性突變運算及其運用
- 基因演算專家系統在血液透析室護理人員排班的應用
- Reinforcement Learning for Ga-Based Neural Networks
- 改良式遺傳基因演算法在降低配電系統饋線損失的研究
- A Novel Economic Dispatch Approach
頁籤選單縮合
題名 | Solving the Multi-Depot Location Routing Problem with Multiple Use of Vehicles Using Genetic Algorithm |
---|---|
作者 | 李建德; 黃燈奎; 李義祥; | 書刊名 | 蘭陽學報 |
卷期 | 5 民95.05 |
頁次 | 頁118-129 |
分類號 | 557.311 |
關鍵詞 | 基因演算法; 多車輛使用; Genetic algorithm; Multiple use of vehicles; |
語文 | 英文(English) |
中文摘要 | 本研究主要 目的是修正傳統位置途程問題的三個假設。本研究發展一個三階段演算法模式有效解決具有多車輛使用的位置途程問題。在有效性上,本模式與0-1整數規劃比較結果具有相同的最佳解。 |
英文摘要 | The main purpose of this study is to modify three assumptions for the classical location routing problem (LRP). Thus, its solution can be more realistically applied in real world. In this paper, an efficient three-phase heuristic solution (THPS) method is developed for the LRP with multiple use of vehicles (LRP-MUV). The effectiveness of the proposed TPHS method is evaluate by making a comparison with an optimal solution to the zero-one integer linear programming (LOILP) model for a small-scale test problem. The results indicate that most of the heuristic solutions obtained using the proposed THPS method are identical to their optimal solutions. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。