|
Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route
|
Mohammad Mirabi *   1, Nasibeh Shokri2 , Ahmad Sadeghieh3 |
1- Department of industrial engineering, Ayatollah Haeri University of Meybod, Meybod, Yazd, Iran , mirabi@haeri.ac.ir
2- Group of industrial engineering, ElM-O-Honar University, Yazd Iran
3- Group of industrial engineering, Yazd University, Yazd, Iran |
|
|
Abstract: (3867 Views) |
| This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM) and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm. |
|
| Keywords: Vehicle Routing problem, Multi-Depot, Flexible End Depot, Genetic Algorithm, Clustering |
|
|
|
Type of Study: مقاله پژوهشی |
ePublished: 2017/09/28
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
