کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481501 | 1446145 | 2009 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem](/preview/png/481501.png)
The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra’s algorithm based on a cost network constructed by the sweep algorithm and the 2-opt. Our VNS algorithm uses several neighborhoods which are adapted for this problem. In addition, a number of local search methods together with a diversification procedure are used. Two VNS variants, which differ in the order the diversification and Dijkstra’s algorithm are used, are implemented. Both variants appear to be competitive and produce new best results when tested on the data sets from the literature. We also constructed larger data sets for which benchmarking results are provided for future comparison.
Journal: European Journal of Operational Research - Volume 197, Issue 2, 1 September 2009, Pages 509–518