The Real-time Vehicle Routing Problem(VRP) Study With Vehicles Can Be Leased

With the advent of the information age, the market competition is more intense, the time value is increasing. Punctual service has become an important means of modern enterprises to compete in the market, reflects the level of service, and marks the enterprise market competition ability. But at the same time, to achieve on-time service, city traffic environment is uncertain:the traffic flow changes, accidental traffic accident, traffic burst, caused the random travel time of vehicle. In the uncertain environment, many city traffic with more starting point and end points, a starting point, the end point only in the presence of stochastic optimal path between the different actors, will show different behavior characteristics in the selection of optimal path, a driver’s route choice behavior (including route and departure time choice) with the purpose of trip, time constraint, the driver’s experience, on the network level and the travel time of the degree of uncertainty and change. As the important content and means of implementation travel rationalization, research on vehicle routing choice behavior of uncertain road environment helps to reduce the city traffic congestion, save social energy, protect the city environment, reduce travel cost, improve operation efficiency, and comprehensively improve the city traffic satisfaction. This paper deeply studies a series of vehicle routing problem under real-time information selection, established the models of vehicle routing problem with vehicle can be leased, and design optimization algorithm. This paper consists of6chapters, the main contents and conclusions are as follows:The first chapter:introduce the research background and significance, ideas and methods, innovation points and the research goal of the thesis and structure.The second chapter:firstly, introduce the current research results of vehicle routing problem, on the basis of this, the uncertain information vehicle routing problem is divided into non real-time information processing of the uncertain information vehicle routing problem and the real-time information processing uncertain information vehicle routing problem, analysis of the connotation, uncertain information vehicle routing problem the characteristics, research status and the corresponding mathematical model, optimization method, point out the problems existing in the research.The third chapter:this chapter consider the cycle planning, path optimization problem according to certain time window setting, established a vehicle routing model with vehicle leased. Employ the saving algorithm with greedy heuristic algorithm to solve the model. The fourth chapter:on the basis of the third chapter, the vehicle may through traffic regional dynamic variability (such as the city center area rush, traffic jam and so on) and the vehicle optimal departure time were taken into account, build the linear integer programming mathematical model, and use insertion algorithm to optimize the model, through an example to verify its effectiveness.The fifth chapter:considering the number of vehicles, and established the linear integer programming mathematical model, and use the improved ant colony algorithm to solve the optimization problem, through specific example to prove its validity.The sixth chapter:conclusion and Prospect:a comprehensive summary of the thesis, points out the direction of further study.