Research On Algorithm Of Optimizing Of Physical Distribution Routing Problem With Time Windows

With the development of economic globalization, it brings about the globalization of the logistics industry, and the development of the logistics industry also affects economic development. Thus, the logistics industry plays an increasingly important role in economic development. Physical distribution have a large proportion in the logistics transportation, which means that the cost of physical distribution determines the cost of logistics transportation in a large extent, so the cost of physical distribution depends on optimizing of physical distribution routing. How to improve the efficiency of physical distribution is the current problem to be solved.Thus, optimizing of physical distribution routing is a key link in logistics system. The appropriate distribution routing selected can reduce the cost of physical distribution and improve the efficiency of physical distribution. In this paper,we do the following two areas:(1) A Mergers & Acquisitions algorithm was proposed according to analyzing physical distribution and re-integration to market resource. By studying and researching current multiple algorithms of optimizing of physical distribution routing problem with time windows, we compare their advantages and disadvantages with each other. On that basis, we propose a new algorithm, Mergers & Acquisitions (M & A) algorithm. We will introduce M & A ideas, elements and classifications etc, establish the model of M & A algorithm, and analyze further the performance of M & A algorithm.(2) M & A model and its performance were verified and analyzed by experiments. Research on the paper will importantly focus on:Firstly, we will construct the mathematic model of optimizing of physical distribution routing problem with time windows. Secondly, we construct the model of optimizing of physical distribution routing problem with time windows based on M & A algorithm and the model of optimizing of physical distribution routing problem with time windows based on Hybrid M & A algorithm. Finally, we make respectively some experiments on the Solomon data based on the both models of the algorithms, obtain the optimal or nearly optimal solutions of optimizing of physical distribution routing problem with time windows, and have the optimal solution analyzed, compared and summarized.