Font Size: a A A

Method For Vehicle Routing Problems With Time Windows Constrained

Posted on:2007-09-13Degree:MasterType:Thesis
Country:ChinaCandidate:X H WangFull Text:PDF
GTID:2179360182473937Subject:Management Science and Engineering
Abstract/Summary:PDF Full Text Request
Vehicle Routing Problem belongs to the realm of Logistics Research and contributes more to lowing company operating costs and improving the service level. Due to various view, VRPs can be classified lots of types.Actually research on very kind of VRPs has been increasing prominently in recent years.Considering the practical worth ,especially viewing the market environments of achieving the client service level performance, time windows is very important to the research of VRPs.In this paper,we put forward deep analysis on two main kinds of VRPs with time windows and set up optimization model,exploit effective algorithm aiming to every kind of them.This paper is as follows:Firstly, we analyze lots of articles related to VRPs research and especially considering the study of time windows draw some conclusions on the past research.In addition,we systemic study the common algorithms at present about solving methods and summarize the excellence and defect of each algorithm.Based on the above analysis and practical factors we determine the content and methods to be researched in this paper.Secondly, for the non full-load VRPs with time windows constrained,we focus the research work on the realm of multi depots(dispatcher centers) and soft time windows constrained.Based on analysing the structure of this problem,we design the clear stepped solving tacticsAs well a mixed heuristics is exploited which can solve this problem rapidly and effectively.At last we give a test example to validate it.Thirdly, as we all know, full-load VRPs with time windows constrained are considered the less researched realm.we extend the theoretical models from the practical view,import a new idea of dynamic time windows and construct a full-load model with dynamic time windows.Via analying the difference between the full-load and non full-load,we design a dynamic constructing heuristics.This heuristics can quickly solve the full-load model with dynamic time windows constrained by parameters adjust.It extend the research range of full-load VRPs in a certain extent.This paper's research takes a little theoretical innovation and practical value.
Keywords/Search Tags:time windows constrained VRPs, heuristics, combinatorial optimization, non full-load, full-load
PDF Full Text Request
Related items