Font Size: a A A

The Optimization And Application Research Of The Logistics Distribution Route Based On The Improved Ant Colony Algorithm

Posted on:2015-08-25Degree:MasterType:Thesis
Country:ChinaCandidate:Q FanFull Text:PDF
GTID:2298330452968322Subject:Logistics Engineering
Abstract/Summary:PDF Full Text Request
Logistics distribution is the link that associated with consumer directly in thelogistics activities and is the most important link in logistics system. In addition to thepurchase cost, Transportation cost take the highest percentage in the logistics costs, Soreasonable arrangement of the distribution solutions and reduce the logistics cost have aclose relationship with the business interests. Vehicle path optimization is an importantlink in the logistics distribution, on the premise of meet the demand of diverse users,how to take advantage of the existing resources to optimize vehicle routing in order toreduce the business distribution costs and improve the business economic benefit is thegoal of the development of logistics industry, and the problem which researchersfocused on.This article take the distribution route optimization problem of supermarket as theresearch object. Analyze and research the relevant theories of logistics distribution pathby consulting a large number of literature, and establish the corresponding mathematicalmodel aimed at the supermarket goods distribution. On the basis of analyzed all kinds ofthe optimization goal of logistics distribution, This model choose the logisticstransportation cost and punishment cost that based on the time window as theoptimization goal, the constraints including deadweight, delivery vehicle constraints,distance constraints, customer number constraints etc. The logistics distribution routeoptimization problem is solved by the improved ant colony algorithm, which add thetime window constraints and load constraints on the basis of the MMAS, Theimprovement:①Get the initial solution by using the algorithm of improved recentlyadjacent algorithm;②Add the time constraints in the formula of probability when the ant construct the path;③When set and update the pheromone, the pheromone on theeach path is limited to an interval,using the global pheromone update methods and onlyupdating the pheromone of the top "elite ant" in the path construction, then thealgorithm is realized by using matlab7.0,and verified the effectiveness of the algorithmby using the VRPTW standard test library that Solomon provided. At last, this papertake the vanguard in xi ’an region branch as an example, collect relevant data, and getthe distance between various stores and distribution center by using the function ofdriving directions with the software of LingTu UU,then get the more optimaldistribution route scheme than before optimization by used the improved ant colonyalgorithm, and proved the practicability and validity of the algorithm through theanalysis of the time and vehicle load factor.Solving the logistics distribution route optimization problem based on timewindow by using the improved ant colony algorithm, provide reference value for thefurther study of the ant colony algorithm and is good for the enterprise to set up themodern logistics distribution scheduling system.
Keywords/Search Tags:Logistics distribution, Vehicle routing optimization, Ant colony algorithm
PDF Full Text Request
Related items