The Research On Cash Truck Routing Problem By Genetic Algorithm

Solving the routing problem of the delivery vehicle is a key in the modern logistics, and it is also the important link in the E-business, too. Optimizing the schedule of cash trucks can reduce the logistics operating costs and risks of the enterprises, and improve the logistics working efficiency. The Vehicle Routing Problem (VRP) was proposed by Dantzig and Ramser in 1959. The so-called VRP, generally means that, for a series of goods-sending nodes and goods-receiving nodes, we use a certain number of vehicles, plan the proper routes, making vehicles visit all nodes orderly, under the specific constrained conditions (such as the goods amount of demand and supply, the time of receiving and sending, the limitation of the vehicle load, driving mileage, and driving time, etc.), struggle to attain certain goals (such as the shortest driving mileage, the lowest transport cost, the certain time that the vehicles should arrive at, the least number of used vehicles, etc).The Cash Truck Routing Problem is an important application of VRP, and is a classical constrained combination optimization problem, it is NP-hard. For its complexity, the polynomial method has not been found by now, so most researchers concentrate on the research of its heuristic method.Genetic Algorithm (GA) was first proposed by Holland in 1975. GA evolves from a chromosome population created randomly. The chromosomes with higher fitness are selected with higher probability to go through a crossover and mutation procedure, and produce some children which are different from their parents, but inherit some genetic factors from them. After...