| With the social development, especially the rapid development of IT, the traditionalmode of transport has lagged behind in the development of the informationtechnology requirements, is bound to be replaced by a brand new mode of transport.The globalization of the Internet boom of the human society entered a new era ofinformation, access to logistics information via computer is the result of the arrival ofthe information age is bound to happen. At the same time, high efficiency andreasonable distribution guarantee the smooth running of the logistics system,distribution line arrangement is reasonable or not a great influence on the deliveryspeed, cost-effective. Correct and reasonable arrangements for the delivery of thevehicle line, reasonable line transport, the transport time savings, increase vehicleutilization, thereby reducing transportation costs, and improve the economicefficiency of enterprises and the level of customer service, logistics management toenable enterprises to achieve scientific this is also one of the effective ways toimprove their own competitiveness. Logistics path optimization problem is a specificapplication of the traveling salesman problem, with high computational complexity, isa difficult problem NP-complete, efficient exact algorithm for large-scale data existsunlikely, but according heuristic algorithm obtained approximate optimal solution.This article in the discussion of logistics routing problem, comparing the set ofprograms, details of the logistics system and application, and the development of alogistics and distribution software system, which focus on the transport subsystem.By comparing serial algorithm for optimizing logistics path, this paper find aneffective algorithm. The algorithm can help logistics enterprises to save transportationcosts, while timely and accurate completion of the distribution task, which has a vitalrole to increase the economic efficiency of the logistics company. |
