Vehicle route planning for logistics network optimization via multiple spanning tree

Logistics network optimization plays a critical role in contemporary logistics planning and supply chain network designs, and the vehicle route planning is essential for logistics network optimizations. In this paper, we present an efficient and effective approach for vehicle route planning. The new approach has utilized multiple spanning trees as a criterion to categorize the customers into several sub areas. In addition, by iterative choose some customers in the boundary of sub areas and resign them to different spanning trees, we can get a more compact ones with smaller distances. As a result, since the spanning tree represent the lower bound of vehicle route in all sub areas, we can also conduct the vehicular dispatching in each sub areas. Extensive simulation has verified the effectiveness of the proposed methods.