Font Size: a A A

Distribution In Stochastic Vehicle Routing Optimization Study

Posted on:2005-01-01Degree:MasterType:Thesis
Country:ChinaCandidate:A J WangFull Text:PDF
GTID:2192360125961087Subject:Transportation planning and management
Abstract/Summary:PDF Full Text Request
Developed countries began to research Stochastic Vehicle Routing Problem (SVRP) in 1980's, and there have been some concerned articles. Some articles already have well illustrated some characters and properties of SVRP. But there are shortages to study on SVRP. Especially study of SVRP is almost concentrated on SVRP with only one stochastic factor, such as VRP with Stochastic travel Times, VRP with Stochastic Demands and VRP with Stochastic Customers. The goal of this dissertation is to perfect study of SVRP, and study VRP with stochastic travel times and demands.There are some researches on VRP in our country. But most of works are focused on the deterministic VRP, in which there is no uncertainty factor. So, literature of SVRP is lacking in our country. With the development of logistics in our country, the research on SVRP is really a matter of great significance.Chapter one of the dissertation introduces the concepts of distribution and Vehicle Routing Problem, the importance of VRP. Because Vehicles meet lots of stochastic factors during distribution, study of SVRP is very important and significant. According to stochastic factors, the second section classifies the SVRP as six kinds. The third section of chapter one generalizes the studies of SVRP and shortcoming of studies of SVRP, demonstrates the studying direction and contents of this dissertation.The first section of Chapter two generalized the shortest routing problem, vehicle routing problem and basic algorithm-savings algorithm of VRP. The second section introduces the objectives of SVRP, service strategies of distribution, the effect that service strategies have on Stochastic Vehicle Routing, and the influence of the time of stochastic factor making certain.Chapter three researches Traveling Salesman Routing Problem with Stochastic Customers, Vehicle Routing Problem with Stochastic Customers and Vehicle Routing Problem with Stochastic Demands. These researches perfect the studies of SVRP. The chapter provides a good formula of calculating expected distance of stochastic vehicle routing based on fruits of former researches. The chapter also provides a savings algorithm of SVRP in according with the savings algorithm of deterministic vehicle routing problems, and makes out the differences between the savings algorithm of SVRP and the savings algorithm of certain vehicle routing problems.Chapter four researches Traveling Salesman Routing Problem with Stochastic Travel Times, Vehicle Routing Problem with Stochastic Travel Times and Vehicle Routing Problem with Stochastic Travel Times and Stochastic Demands. The chapter completes the studies of the first two problems. The chapter provides a model of every problem that is used to optimize vehicle routing, and optimizing arithmetic. The third section develops a formula of computing the expected distances of Vehicle Routing with Stochastic Travel Times and Stochastic Demands.In the end , dissertation sums up the studies, and make out the direction of next research.Aijiao wang(Transport Planning and Management)Directed by Xuefeng wang professor and Gang zhao professor...
Keywords/Search Tags:distribution, vehicle routing, stochastic, saving algorithm
PDF Full Text Request
Related items