A New Algorithm for Vehicle Routing Problems with Capacity Limited Based on Minimum Spanning Tree

An optimized strategy is proposed to investigate the vehicle routing problems. We build here a Conversion of the Complex road network with minimum spanning trees and decision to search the nearest approach. An algorithm is developed to obtain min-spanning from spanning trees. By tagging the min-spanning tree, we obtain the optimized route such that the cycle capacity keeps minimum value. The corresponding algorithm is realized with the Development tool of Jbuilder 9, which shows that our algorithm proposed here is valid and concise, and simplifies the complexity of previous results.