Weibin Xu

Learn More
We present a new and effective algorithm, balanced k-means, for partitioning areas in large-scale vehicle routing problem (VRP). The algorithm divides two-stage procedures. The traditional k-means is used to partition the whole customers into several areas in the first stage and a border adjustment algorithm aims to adjust the unbalanced areas to be(More)
We present a new neighbor search algorithm named route-nearest neighbor (RNN) for searching the next node in large-scale vehicle routing problem (VRP). The RNN algorithm is used to divide the area customers into several routes. The key step in the route construction is how to search the next node (i.e., neighbor). Different from the Nearest Neighbor (NN)(More)
  • 1