頁籤選單縮合
| 題 名 | Lagrangian Relaxation Heuristics for Deterministic Transshipment Problems=拉氏釋限啓發式演算法解確定性轉運問題之研究 |
|---|---|
| 作 者 | 陳平舜; | 書刊名 | 工業工程學刊 |
| 卷 期 | 28:4 2011.06[民100.06] |
| 頁 次 | 頁256-269 |
| 分類號 | 494.542 |
| 關鍵詞 | 退化性網路; 拉氏釋限法; 轉運問題; 啓發式演算法; Generalized network; Lagrangian relaxation; Transshipment problem; Heuristic algorithms; |
| 語 文 | 英文(English) |
| 英文摘要 | Transshipment problems (TPs) have been widely applied in academic and practical areas. The deterministic TPs, which include four characteristics: commodities, modes (transportation methods), generalized network, and time periods, are NP-hard problems. Therefore, this research analyzes the structure of the multi-commodity multi-mode generalized networks over a multi-time-period problem and develops three Lagrangian-relaxation heuristic algorithms to minimize total costs for delivering commodities. The proposed mathematical model incorporates an upper bound on traffic flow for each segment of the distribution network. This is the so-called knapsack constraint. Further, two application networks are tested for medium and large-scale problems. As a result, simulation results show that the three proposed algorithms can provide more feasible solutions with attractive levels of near-optimality within reasonable time compared to the branch-and-bound method. |
本系統中英文摘要資訊取自各篇刊載內容。