Research On Vehicle Routing Problem With Intermediate Movements

Vehicle Routing Problem is an issue with importantly theoretical and practical significance in the field of logistics. Many instances of Vehicle Routing Problem with intermediate movements had already existed, this paper makes three parts of fundamental researches to instruct its practice.From easy to hard,the three parts were studied, the first two parts separately considered in fixed demand and stochastic demand of vehicle routing problem with intermediate movements,according to incomplete network and volume constraint of vehicle in reality,part three pays more attention to the vehicle routing problems with intermediate movements of routing incompletion and volume constraint. Main works are as follows:First, this paper describes what the Vehicle Routing Problem with intermediate movements is,analyzes its new problems compared with traditional Vehicle Routing Problem,designs a new crossover operator which can keep resolution feasible and not falling in the local minimization when solves it as a part of genetic algorithm. Calculation cases were given to prove genetic algorithm effective.By comparison, integration for Vehicle Routing Problem with intermediate movements can get better resolution than division.Second,this paper analyzes Vehicle Routing Problem with intermediate movements under stochastic demand,makes the corresponding revision to the genetic algorithm according to the stochastic demand,carries on the solution after the revision genetic algorithm to the model and obtains the good result.Third,under above-mentioned condition,This paper pays more attention to the actual vehicle routing problems with intermediate movements of routing incompletion and volume constraint.Firstly, by using the Floyd algorithm,the vehicle routing problems with incomplete networks can be transferred to the vehicle routing problems with complete networks.Secondly, genetic algorithm suit to solute the vehicle routing problems with intermediate movements was designed for solving the transferred vehicle routing problems in complete networks. Then, some adjustment and formulization was done to resolution for reducing the routes'distance. Finally some calculation cases and a comparison with another solution were given for proving the solution method's effectiveness.In this paper, vehicle routing problemwith intermediate movements were respectively analyzed and resolved under three conditions, By comparison, integration for Vehicle Routing Problem with intermediate movements can get better resolution than division.comparing with another algorithm,proposed algorithm were proved effective.