Font Size: a A A

Research On Vehicle Routing Problem With Dynamic Networks

Posted on:2006-08-05Degree:MasterType:Thesis
Country:ChinaCandidate:Z M XiaoFull Text:PDF
GTID:2166360155454984Subject:Management Science and Engineering
Abstract/Summary:PDF Full Text Request
With the development of social economy, logistic management and optimization are becoming more and more important. The high cost of transportation asks for the research on transportation optimization methods and theories. Vehicle Routing Problem (VRP) is to research on how to arrange the routes of distribution vehicles in order to get optimized objects. But most current researches focus on static problems and dynamic demand problems of this area, few considered the dynamic of traffic networks. The research on VRP with dynamic networks closely links with real applications and it is very important for arranging vehicle routings in real distribution works. Based on the research work at home and abroad, this paper firstly summarizes the VRP with dynamic networks. By model construction and algorithm design, this paper goes on to put the emphasis on researching the Time Dependent VRP (TDVRP).In the preface, the paper firstly gives the definition of VRP with dynamic networks on the basis of research status and analyzes its essential macroscopic and microcosmic characters. Then it is classified according to type of networks. At last, this paper introduces the research status of this area.The main body of this paper researches TDVRP, which is made up with two parts—deterministic demands and dynamic demands. The first part analyzes the TDVRP with deterministic demand. It analyzes the objective and restrictions of this problem, and then sets up a model and designs Immune Genetic Algorithm (IGA) according to the problem character information. The availability of IGA is shown by an instance. Second part analyzes the problem with dynamic demand. First, this part brings forward two strategies for dynamic demand: static method and local optimization method. Then the two strategies are compared with each other. It tells us fix costs and delay costs affect the strategies' efficiency, but the quantity of customer who has dynamic demands affects it slightly. Finally this paper extends the type of networks and simply analyzes VRP under the complex traffic networks with time dependent and probability. After that, simulation method and its process are put forward to solve the problem.At the end of this paper, we summarize the paper content and prospect the future orientation of the problem.
Keywords/Search Tags:Logistics Optimization, Vehicle Routing Problem, Dynamic Networks, Time Dependent
PDF Full Text Request
Related items