Local Transportation Vehicle Routing Problem Based On Improvement ACO

The local service and trade blooms with the high-speed development of information technology and e-commerce industry, and then gives rise to the demand for regional distribution system, which becomes more and more urgent. The logistics industry plays an important role in the national economy. At present, our country’s logistics stays in the stage of extensive distribution, namely “only send not match”. The efficiency of distribution is low, and distribution system cannot schedule vehicles effectively and minimize the cost. There have been many excellent route schedule strategies in the main logistics and large area distribution, but researches about local distribution are still a blank, and there are not any useful applications to optimize the path of the distribution. As a consequence of this, this article focuses on how to plan a best route for vehicles to execute, combining with the crowdsourcing mode, and establish the mathematical model of the local distribution. An improved ant colony algorithm is used for local distribution route optimization, and the obtained results were good(satisfying). The main research work and achievements are as followings:(1)Summarize the overseas and domestic research status and development tendency of vehicle routing problem. Introduce the basic concepts and the classifications under different constraint conditions, the typical algorithms for solving vehicle routing problem. Analyze the research priorities and the developing direction of ant colony algorithm and vehicle route problem.(2)Proposed an improved ant colony algorithm to avoid the premature convergence and increase convergence speed. Its main improvements include an improved selective probability rule, using 2-Opt method to optimize each iteration’s best solution and a dynamical pheromone evaporation rate. Apply this algorithm to instance Eil22, and the result shows that the proposed algorithm can obtain the optimal solution rapidly and accurately.(3)The local transportation has the feature of the low batch and high frequency. To satisfy the local customers’ demand on the transportation time limit, on the basis of the vehicle routingproblem model, this article proposes a new vehicle routing model which is used for the local transportation, and adds two constraint conditions—multi-depot and time limit, at the same time removes the constraint condition of vehicle capacity. The vehicle routing model applies the crowdsourcing pattern. An improved ant colony algorithm is presented to optimize and dispatch the vehicle routes. Compared with the traditional multi-depot transportation pattern, the new proposed method significantly enhances the chronergy and distribution benefit after analyzing the simulation examples.(4)Combining with the mobile internet technology, the core algorithm is realized by using the PHP language. This article designs a website and develops a local distribution system based on mobile internet, through which, the website instantly realized the distribution path. Practical application results show that the proposed method and system which is suitable for local small area, high frequency, small batch distribution conditions, has high practical value.