Font Size: a A A

Vehicle Routing Problem Optimization Of H Distribution Center Based On Improved Ant Colony Algorithm

Posted on:2017-08-21Degree:MasterType:Thesis
Country:ChinaCandidate:M Q LiangFull Text:PDF
GTID:2429330596957288Subject:Engineering
Abstract/Summary:PDF Full Text Request
Distribution is directly connected with consumers in the logistics activities and distribution costs account for a very high proportion in the total logistics costs.For the distribution centers,distribution level not only has a direct impact on customer satisfaction,but also has a significant impact on their economic benefits.Distribution line is one of the key factors that determine the level of distribution(distribution costs,punctuality,efficiency,etc.),especially in the case of multi-client,to arrange distribution line reasonably will be an extremely complex task.Therefore,using scientific and effective methods to optimize vehicle routing is an important activity of daily operations for the distribution center.H distribution center is a small-scale auto parts warehousing and distribution business,it is committed to providing customers with timely and efficient service delivery.However,H distribution center has some problems in route plan which need to be improved,such as low decision-making efficiency,high distribution costs,irrational routes.Only in this way,the economic efficiency,customer satisfaction,market competitiveness can be improved and enhanced.Firstly,the paper analyzes domestic and foreign research on vehicle routing problem by literature research,and compares the main optimization methods of vehicle routing problem,sums up the methods' strengths and weakness and scope,on the basis,proposes the main solving method of H distribution center----Ant Colony Algorithm.Secondly,on the basis of actual investigation about H distribution center,this paper analyzes vehicle routing problems in the company,such as inefficient decision-making,high distribution costs and low vehicle utilization etc.Finally,the paper establishes vehicle routing model of H distribution center and uses Ant colony algorithm for solving simulation.Compared to the current artificial decision,the program improves the decision-making efficiency and vehicle utilization,reduces distribution costs.But at the same time,the results show that ACO algorithm twice fall into local optima,and there are many partial cross paths in the vehicle tour route,it can be optimized for futher routing optimization.So it put forward several improvement measures,including restricting the pheromone concentration,eliminating local cross paths,updating the optimal paths.In this way,there will be a more rational routing decision.
Keywords/Search Tags:Logistics distribution, vehicle routing problem, Ant Colony Algorithm, time windows
PDF Full Text Request
Related items