期刊論文
| 學年 | 97 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2009-02-01 |
| 作品名稱 | A heuristic method for the vehicle routing problem with backhauls and inventory |
| 作品名稱（其他語言） | |
| 著者 | Liu, S. C.; Chung, C. H. |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | Journal of Intelligent Manufacturing 20(1), pp.29-42 |
| 摘要 | The purpose of this paper is to determine the route of the vehicle routing problem with backhauls (VRPB), delivering new items and picking up the reused items or wastes, and resolve the inventory control decision problem simultaneously since the regular VRPB does not. Both the vehicle routing decision for delivery and pickup, and the inventory control decision affect each other and must be considered together. Hence, a mathematical model of vehicle routing problem with backhauls and inventory (VRPBI) is proposed. Since finding the optimal solution(s) for VRPBI is a NP-hard problem, this paper proposes a heuristic method, variable neighborhood tabu search (VNTS), adopting six neighborhood searching approaches to obtain the optimal solution. Moreover, this paper compares the proposed heuristic method with two other existing heuristic methods. The experimental results indicate that the proposed method is better than the two other methods in terms of average logistic cost (transportation cost and inventory cost). |
| 關鍵字 | Vehicle routing problem with backhauls (VRPB);Vehicle routing problem with backhauls and inventory (VRPBI);Heuristic method;NP-hard;Variable neighborhood tabu search (VNTS) |
| 語言 | en |
| ISSN | 0956-5515 1572-8145 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 是 |
| 國別 | GBR |
| 公開徵稿 | |
| 出版型式 | ,電子版,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/105948 ) |