Optimal Scheduling Of Logistics Vehicles Based On Immune Algorithm

Logistics system is very important for the society economics. It is no way realizing the value and using value of commodity if without circulation. Just for the society logistics gross cost consists a high specific weight. Distribution is an operation linking with consumer directly, and takes account for considerable proportion in variable costs in logistics. The planning of vehicle routing in distribution will take great effect on the efficiency, cost and benefit, especially in distributing for multi consumers. So, vehicle routing problem had become focus of many scholars to study.Logistic vehicle routing problem is combination optimization that is difficult to solve. Due to its NP characteristics, we can't get satisfying results when we use exact approaches. Immune algorithm is a completely new method band together with the principle of life-form evolution, optimization technique and computer technique. On the basis of establishing the optimizing model on logistic vehicle routing problem, this paper presents a Immune algorithm for saving this problem, and makes some experimental calculations. The experimental calculations results demonstrate that the optimal or neariy optimal solutions to the logistic vehicle routing problem can be easily obtained by using Immune algorithm. Because of the prosperous future of logistics development, the logistics dispatch system will be of great necessity.