| This paper mainly studies logistics company, the process of which is divided into the order, storage processing, distribution processing and distribution transport, wherein the first and fourth part is for distribution and transportation, the second and the third is for goods processing. The main purpose of this paper is offering the best arrangement of vehicles dispatching and processing time. Firstly, the status quo of logistics distribution is introduced.Secondly, the basic algorithm of delivery route is summarized; optimization of delivery route optimization model based on time window constraints are given;the application of saving algorithm, sweep algorithm and neighbor algorithm were verified; the actual needs of the distribution plan is offered. Thirdly, various kinds of plans are compared and theoretical evidence is provided.Finally, by using the method of flow-shop scheduling theory, the distribution in the process of production completion time and machine idle time, waiting time andproduct flow time, total manufacturing time time is analyzed and discussed, and the calculation formula is given, the solving process and the minimum value of distribution in processing time using the branch and bound method of explained. |
PDF Full Text Request