Application of Ant Colony Algorithm in Optimization of Logistics Distribution Routing Problem
Vehicle Routing Problem (VRP) optimization is a very important problem in modern logistics service. which are researched on the logisticmanagement recently. It needs solving by a fast and effective algorithm. To deal with this need, constructs a new mathematic model of logistics VRP proposes an improved algorithm based on the original ant colony algorithm to solve a kind of VRP, and some limitations of the original ant colony algorithm are successfully overcome. The experimental result indicates the algorithm is effective.