Research And Application Of Unilateral Soft Time Windows-based Logistics And Distribution Of Genetic Annealing Algorithm

Logistic distribution is an operation linking with consumer directly, and takes account for considerable proportion in variable costs in logistics. The planning of vehicle scheduling in distribution will be take great effects n the efficiency ,cost ,and benefit, especially in distributing for multi consumers. A scientific and reasonable method to vehicle scheduling is an important operation in logistic distribution. Vehicle Routing Problem (VRP),which is a N P-complete problem of combinatorial optimization realm, is a hotspot problem in the subject of operation research, applied mathematics, network analysis, theory of chart, computer application and transportation during the last twenty years.The algorithm solving VRPTW is very useful in many aspects such as goods delivery and job scheduling. Since every method has its own inevitable shortcomings, a new method is put up in this paper. The new method solving the problem of logistic distribution based on unilateral soft time window is to improve the performance of the algorithm by mending Genetic Algorithms and Simulated annealing algorithm. The new method is applied in the practical application. The result of tests indicates that the new algorithm has better solution quality.