| Split Delivery Vehicle Routing Problem for Transportation – A Case Study | |
|---|---|
| 學年 | 112 |
| 學期 | 1 |
| 發表日期 | 2023-08-25 |
| 作品名稱 | Split Delivery Vehicle Routing Problem for Transportation – A Case Study |
| 作品名稱(其他語言) | |
| 著者 | Nguyen Khoi Pham; Anh H. G. Nguyen; Minh Tan Ha |
| 作品所屬單位 | |
| 出版者 | |
| 會議名稱 | International Conference on Science, Technology, and Innovation for Sustainable Development (STISD 2023) |
| 會議地點 | Ho Chi Minh , Vietnam |
| 摘要 | The Split Delivery Vehicle Routing Problem (SDVRP) is a modification of the classical Vehicle Routing Problem (VRP), which aims to establish optimal routes for a vehicle’s group serving customers with multiple delivery splits. In this study, we develop an exact solution MILP model for solving the SDVRP with a specific case study of a company operating a sugar factory in Bien Hoa, Dong Nai, Vietnam. This study contributes a MILP SDVRP model to help the company to construct a delivery system with the optimal delivery routes for their vehicle fleet to minimize the total traveled distance. The computational results prove that our proposed MILP is superior in solving a large number of customer problems and produces optimal solutions which is much better than the current system of the company. Moreover, the proposed MILP also outperforms an existing method in a publication for solving the same problem. The numerical results emphasize the contribution of our proposed MILP in both practical and academic aspects. |
| 關鍵字 | Mixed integer linear programming; Split delivery; Vehicle routing problem; Transportation |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國內 |
| 校內研討會地點 | 無 |
| 研討會時間 | 20230825~20230827 |
| 通訊作者 | Anh H. G. Nguyen |
| 國別 | VNM |
| 公開徵稿 | |
| 出版型式 | |
| 出處 | |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/129107 ) |
| SDGS | 尊嚴就業與經濟發展,產業創新與基礎設施,負責任的消費與生產 |