Study On Automobile Spare Parts Distribution Based On Milk-Run

Automobile industry has become the fifth largest pillar industry of China's industry,associated with a long industrial chain,high correlation degree and large consumption stimulation,which is generally acknowledged by insider as one of the fields involving the widest range and having technical complexity of the highest level.It plays an important role in national economic and social development.And the development of the automobile industry focuses on the development of automobile logistics.Automobile parts logistics is the source and the most complex part of the entire automotive supply chain,involving hundreds of parts suppliers and tens of thousands mode of the kinds of parts.And the key to improve operational efficiency of inbound logistics lies in which logistics operation to choose to carry out transportation scheduling.It can effectively reduce transportation costs that automobile parts logistics use milk-run to design vehicle routing to deliver parts,thus reducing the cost of the entire supply chain.VRP of milk-run is characterized by pickup vehicle delivering goods from suppliers to Distribution center and returning empty container from Distribution center to suppliers in accordance with the design of routing at stipulated time window.Milk-run is a small-batch,multi-frequency,closed-loop pulling pickup mode in JIT,and it have the advantage of saving inventory,improving delivery quality and operational efficiency of logistics,which plays an important role in reducing the cost of the entire automotive supply chain.Based on the analysis above,this Paper uses methods such as logisties engineering,operation research,computer science to study the key problem of milk-run of automobile parts logistics-VRP.Firstly,the paper proposes focus and thought of this study,systematically expounds the related theory of automobile inbound logistics,milk-run,VRP.Secondly,the paper establishes the mathematical model of VRP of milk-run,which contains split constraints,the weight and capacity constraints,time windows constraints.Finally,the tabu search method was improved,and the various elements in design.At the same time,conducted simulation experiment for milk-run cases by means of C#program,the design of algorithm for calculation of the initial data for the judgment of the separation and not split,data analysis to tested and verified feasibility of the proposed algorithmic while simulating to realize the distribution strategies.