Abstract: Aiming at the drawbacks of slow convergence speed and being easy to fall into local optimal point for basic ant colony algorithm in logistics vehicle routing optimization issue, this paper adopted an adaptive ant colony algorithm and the max-min ant colony algorithm to overcome the basic ant colony's shortcomings.The analysis and comparison for the two algorithms were conducted, and the simulation of vehicle routing optimization in Matlab environment using adaptive and max-min ant colony algorithm was performed as well.Experimental results show that the max-min ant colony algorithm is better than adaptive ant colony algorithm in convergence speed and shortest path search, so max-min ant colony algorithm is superior to adaptive ant colony algorithm for logistics vehicle routing optimization.