Algorithm Design On Multi Depot Vehicle Scheduling Problem Which Consider Transhipment Of Goods

With the development of science and technology,vehicle scheduling problems have caused widespread attention in the community,if we do not select the correct vehicle scheduling method,we will waste a lot of resources and economic losses,so the multi depot vehicle scheduling problem Research is essential.In traditional research,the existence of transshipment is neglected,most of the goods from the starting point through the end,so it is possible to select an unreasonable solution leaving the transport distance is too long.So it is necessary to study new methods to choose the scientific path.We study the multi depot vehicle scheduling mainly carried out the following four research areas based on the previous research:(1)A kind of multi depot vehicle routing problem is refined.Prior research on vehicle scheduling problem did not consider freight transport phenomena,all the goods flow from the beginning to end,the paper extract a kind of multi depot vehicle scheduling problem which consider transshipment,that not all goods are direct destinations,but part of the cargo transhipment will occur in the middle node.(2)The paper propose a algorithm on multi depot vehicle scheduling problem which consider transshipment,mathematical model of multi depot vehicle scheduling problem is set up,a clear expression of the meaning of each symbol,to take the basic linear programming model for vehicle scheduling problem,and in order to minimize the distance traveled objectives,clear constraints(3)Genetic algorithms,ant colony algorithm for solving model,First according to a mathematical model has been built up its algorithm design,a clear expression of genetic chromosomes that determine by which various goods transport vehicles,and the starting point of various goods,transit point,before and after transport by expressing chromosome transport vehicles as well as the end to express,at this stage mainly to complete the distribution of goods and vehicles.Secondly,the traditional taboo table will be improved two-dimensional array,should visit the state each node,used to express the node is already being accessed by,in order to avoid inefficiencies caused by repeat visits.This phase completed vehicle routing options to achieve the objective function which is minimized.We can improve the weaknesses of traditional global optimization algorithm,it will be difficult to fall into local optimum.Multi depot vehicle scheduling problem which consider transshipment proposed algorithm provides a new method or approach for solving this problem,it may reference laid the foundation for related research,and to help the logistics industry make a reasonable choice of uniform driving path,reduce the waste caused by inefficient transportation resources and time.