A RESEARCH OF EMERGENCY LOGISTICS DISTRIBUTION VRP BASED ON SIMULATED ANNEALING ALGORITHM

摘要

In this paper, simulated annealing algorithm is studied and applied to the emergency logistics distribution vehicle routing optimization problem(VRP). In the process of disaster relief, the disaster relief control center makes the vehicle dispatch plan with the optimization result, then, not only the relief materials will be transported to the destination fast, but also the transportation cost will be cut down. Based on the mathematical description of the emergency logistics distribution VRP, the simulated annealing algorithm's mathematical model for solving this problem is established. Under the Visual C++ compile environment, a simulated sample is given, three random sampling methods are applied to this sample, by analying and comparing their result, it is found that different random sampling method directly affect the result, meanwhile, it shows that the result has global optimization characteristics, so that simulated annealing algorithm is superior to other optimization algorithms which are apt to fall into partial solution.