Using a Tuning Parameter to Compromise Computation Time and Shipping Cost in an MDVRP | ||
| AUT Journal of Electrical Engineering | ||
| مقاله 2، دوره 55، Issue 3 (Special Issue)، 2023، صفحه 323-332 اصل مقاله (781.14 K) | ||
| نوع مقاله: Research Article | ||
| شناسه دیجیتال (DOI): 10.22060/eej.2022.21404.5474 | ||
| نویسندگان | ||
| Mohammad Amin Zajkani؛ Reza Rahimi Baghbadorani؛ Mohammad Haeri* | ||
| Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran | ||
| چکیده | ||
| Vehicle routing in last-mile delivery plays a decisive role in the new world of people’s lifestyles. At present, a growing number of people order their needs online, and this forces companies to employ innovative delivery logistics to reduce their last-mile shipping costs. The goal is to minimize the cost of travel that depends on the Euclidean distance between customers. Companies require solving vehicle routing problems (VRP) in a reasonable time. In this paper, a new approach is introduced that solves the multi-depot vehicle routing problem (MDVRP) in real-time. We propose a new method by clustering and decomposing the main problem into smaller ones using a tuning parameter α . This approach could reduce the solution time noticeably (up to 95%) while the shipping cost is still reasonable. | ||
| کلیدواژهها | ||
| Vehicle routing problem؛ Tuning parameter؛ Computation time؛ Complexity؛ Clustering | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 636 تعداد دریافت فایل اصل مقاله: 506 |
||
| تعداد نشریات | 9 |
| تعداد شمارهها | 455 |
| تعداد مقالات | 5,771 |
| تعداد مشاهده مقاله | 8,377,385 |
| تعداد دریافت فایل اصل مقاله | 6,936,905 |