Font Size: a A A

Study On An Vehicle Transportation Dispatch Optimization Models

Posted on:2007-07-15Degree:MasterType:Thesis
Country:ChinaCandidate:Z J PanFull Text:PDF
GTID:2178360242961912Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Highway transportation is an important part of logistic guarantee in the army. The Models is based on the research of Geography Information System,the localization technologies of GPS , and the communication technologies. Its design and development combines with the capability of military and civilian transportation.The model of Vehicle Scheduling Problem is the nearest optimized one of vehiches to be used in fact. Because VSP is a difficult problem of Nondeterministic Polynomial , the most efficient and exact algorithm may not exist, It is necessary and realistic to develop the approximate algorithms. Two heuristic algorithms employed to solve the problem of VSP are proposed in this paper, i.e., the C-W Economical Heuristics algorithm and the Assignment Heuristics algorithm.The C-W Economical Heuristics algorithm is related to the correction of the C-W algorithm which is employed to solve the Traveling Salesman problem. A heuristics algorithm has been designed to solve the problem of Time Window, which is considered the parameter of time constraint while connecting the spot pairs. If the parameter of time constraint is ignored, it is similar to the C-W algorithm, but while connecting the spot pairs, it must–consider the capacity constraint of the vehicles, i.e., The sum of the freight quantity transported by all the tasks in one line should be less than the capacity of all the vehicles in this line. It need to calculate the loss for waiting and the penalty for delaying and correct the original expense while considering the parameter of the time constraint.The Assignment Heuristics algorithm adopts the concepts of Fisher and Jaikumar, It divides the model into an assignment problem and the Traveling Salesman problem and corrects the works on schedule to assign the task. A heuristics scheme is designed, which can directly treat with the issue of multi-parks and arrange the routes in the assigning process (i.e., A vehicle can not be assigned to a task unless the condition of time constraint has been met. ).Optimization dispatch of freigh transportation vehicle be used to the highway vehicle transportation dispatch work, will make progress in the logistics of army, while data mining gives classical thought to the dispatch, and does good to army's decision-making.
Keywords/Search Tags:Highway transportation, Vehicle Scheduling Problem, Heuristics algorithm, Data mining
PDF Full Text Request
Related items