| Vehicle Routing Problem(VRP)is one of the key processes of logistics distribution. As competitions among logistics distribution industry are getting more and more fiercer and customers'requirements for a time-effective logistics distribution are becoming more and more intense, studies on VRP, especially Vehicle Routing Problem with Time windows(VRPTW), are practically significant on every aspect of logistics distribution industry. Transportation companies can improve their services by providing their customers with fast, punctual, safe and comfortable services, their transportation costs can be cut down by improving vehicles utilization. Besides, production cycles are shortened and capital turnover is accelerated, therefore, rational allocations of resources can be realized and fortunes from "the third profit source" can as well be made. So the study of VRPTW is more practical significance.In the view of this background, this paper do some research on VRPTW which can help the enterprises to improve their conditon.. Starting with the general account of TSP, the paper analyzed the basic theory of VRPTW, and then classified a variety of optimization algorithms of resolving vehicle routing problem with time windows, and ultimately determines the genetic algorithm as the solving algorithm of the model in this paper. On this basis, the mathematical model with time penalty to optimizing VRPTW was established under the consideration of transportation cost, degree of customs' satisfaction and vehieles'number. According to the characteristics of VRPTW, designed the chromsome encoding and special arithmetic operators to get the resolution. Finally, abtained the optimal objective function value and the arrangement respectively by the simple GA and the improved GA under a study case using MATLAB, and comparisons of computed results fully verified that the algorithm given in this paper can obtain an optimized solution effectively and to be a good scheme to solve VRPTW.
|
PDF Full Text Request