Research On The Vehicle Organization Coordinated Optimization Problem Embedded Time Limit

With the rapid development of social economy, logistics and transport service is increasing rapidly and customer needs are becoming diversified and personalized. It is more and more strict to types, quantity, delivery time and service time of goods. It has been a very concerned problem to the logistics industry that how to improve the efficiency of logistics and transport of goods and meet the customers’ needs. Vehicle as the carrier of goods, it has great room to improve in terms of vehicles resource allocation and driving routing optimization. Therefore, it has great theoretical and practical significance to study vehicle organization coordinated optimization problem.This paper studys the vehicle organization coordinated optimization problem embedded time limit. Firstly, the vehicle organization coordinated optimization problem is reviewed. Define the problem and analysis the elements of the problem. It is researched that research status at home and abroad and algorithm research, and from it this paper finds the research point.Secondly, the vehicle organization coordinated optimization problem with no time limit is researched. Based on the description of this problem, the mathematical model is constructed. Solving programs are designed for the single vehicle problem and the multi-vehicle problem respectively. The multi-vehicle problem is converted to several single vehicle problems cleverly by useing the minimum spanning tree. Minimum weight odd edges are added to the minimum spanning tree. Then the solving program is found.Thirdly, the vehicle organization coordinated optimization problem with time window limit is researched. Based on the description of this problem, the mathematical model is constructed. The feasible solution construction processes based on1-shift variable neighborhood search and the feasible solution optimization processes based on2-opt variable neighborhood search are designed respectively. By the organic combination of both, it is designed that two-phase heuristic algorithm. Finally, the vehicle organization coordinated optimization problem with the whole process time limit is researched. The problem is described. It is designed how to divide the planning time into several decision slot intervals. The optimal distribution network problem is constructed and task’s future cost is estimated. To slide decision slot interval backwards, tasks’ future costs are calculated individually. At last, Build a heterogeneous model and solve it.This paper the vehicle organization coordinated optimization problem embedded time limit systematically. The study enrichs the problem’s theoretical researches, finds innovative algorithms and can guide the vehicle organization coordinated optimization practice. The research is helpful for vehicle rational allocation and vehicle routing optimization.