A multiple Vehicle Routing Problem (mVRP), which consists of determining a set of routes for m vehicles who all start from and return back to a home city (depot). Given a set of cities, let there are m vehicles located at a single depot node. The remaining cities that are to be visited are called intermediate nodes. SP Routing concept is the primary component in the performance of any network. The Shortest path between any two nodes is required in most of the real world oriented network problems. The objective of this paper is to develop efficient optimization algorithms to solve diverse real world SP routing network problems of high complexity,to find the shortest possible balanced routes for multiple salespersons and to find clustering based simple straight-forward hierarchical SP routing in solar powered WSNs.