Research On Physical Distribution Vehicle Scheduling Problem Based On Genetic Algorithm

Genetic Algorithm (GA) is a kind of randomized search algorithm based on natural chosen and natural inheritance mechanism. It was raised by American professor J. Holland, its main characteristic is the colony search strategy and information interchange between individuals in each colony and the search does not depend on grads information. It is especially applicable in solving the complicated and the nonlinear problems which are barely solved through traditional search method, for example, it could be widely used in the fields like combinational optimization, machine learning, self-adapter control, layout design and artificial life and so on. It is one of the most key technologies in intelligent computing in 21st centaury.The vehicle distribution problem is the hot spot in no matter logistics field or computer field since the last a few ten years, especially nowadays, with the increasing concern on logistics, there are so many majors like systematic engineering, and transportation engineering, computer etc put their focus on this problem. The purpose of vehicle distribution is to work out the most optimized solution of the vehicles and cargo match. When the task is small (usually less than the vehicle's capacity), in order to raise the efficiency, it could be better to arrange several transportation tasks for one vehicles, at this time a right route could make the cost least.This article based on the genetic algorithm, as there are to many factors that could have affluence on the final solution, so it makes this vehicle distribution problem belongs to the NP problem, here we put some factors clarify through some practice then cross and some other genetic operation so that help the problem reach the optimized result in some aspects.