Research on loading and routing problem of finished car logistics

摘要

This paper mainly discusses the loading and routing problem of finished car logistics. Finished car logistics is a special commodity business which is produced accompany with the development of the whole vehicle economic. The logistics company loads up the finished cars in accordance with the customers' order, and arranges a suitable route to transport finished cars from manufacturer or distribution center to the customer. This paper discusses the loading and routing problem of finished car logistics where the logistics company uses double-deck transporter to transport multiple types of finished cars. The integer programming model is established, and the corresponding algorithm is designed. At first, according to the length of each layer of double-deck transporter and the size of commercial cars to be transported, the possible loading plan for each layer of car transporter is listed. Then, the disjoint shortest path from the distribution center to each customer is obtained by using the improved Dijkstra algorithm. For each shortest path, the demand of a customer who is far away from the distribution center should be met more priority than that of the customers who are nearer to the distribution center. Based on this idea, a heuristic loading algorithm is designed, and the loading and routing program with the shortest total traveling distance of all transporters is obtained. Finally, the feasibility of the model and algorithm is verified by an example with two types of transporters, three types of finished cars and nine customers. This paper ensures that all transporters' traveling distance is shortest and the full loading rate of each transporter can reaches 95%.