Simulated annealing algorithm is a heuristic algorithm, proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process by heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path, etc., in the logistics and we distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest, best, most economical, and so on. The paper uses an example of simulated annealing algorithm to verify it, and the method is proved to be feasible.