The Model Of Optimizing Scheme For The Distribution Of Logistics Center And Its Algorithm Design

The distribution of logistics center has much wide applying background. That the distribution of logistics proceeds reasonably is important means of realizing transportation scale economy and saving transportation cost. The dissertation considers the distribution of logistics center problem which the objective is to minimize the transportation cost and develops the nearly optimization algorithm—genetic algorithm and immune algorithm.First the dissertation summarizes the present generation physical distribution and points out that distribution of logistics is the nuclear link of physical distribution's key elements. Transportation is divided into reasonable transportation and reasonless transportation. Delivery's carrying out is one of the main measures of reasonable transportation. The dissertation researches deeply the delivery problem's basic theory and gives an overview of the literature about the researches of delivery problem and some related problem, and under some model assumption, develops the mathematical model of the distribution of logistics center problem.It is very difficult to solve the mathematical model of the distribution of logistics center problem directly, but we can construct a dummy transporting network, and transform the former problem into shortest path problem with time constraint and capacity constraint, however, there may be many extra nodes in the dummy network, which will make the compute more complicated. We can throw off the extra nodes to reduce the complication of the problem So first we optimize the dummy network.For solving this problem after optimizing efficiently, genetic algorithm which solves the distribution of logistics center problem is proposed and accomplished in the dissertation. The algorithm is combined with the distribution of logistics center problem, and constructs fitness function of chromosome; inherit operation uses two points'crossover and transposition variation. The result indicates that the algorithm can solve the problem efficiently.The immune algorithm of the distribution of logistics center problem is proposed at last. The algorithm'antibody uses ordinal number coding and appropriate affinity of antibody and antigen. The dissertation gives appropriate calculate method of the antibody chroma. We reduce the survival capability of the cells which have high affinity with memory cells by restrain function of memory cells. The algorithm can make sure that the result of the problem not gets into local best result. At last the result indicates that the algorithm can solve the problem efficiently.