Font Size: a A A

Research On Distribution Path Optimization Of Vending Machines In University Campus

Posted on:2020-06-01Degree:MasterType:Thesis
Country:ChinaCandidate:Y C WangFull Text:PDF
GTID:2428330578977620Subject:Operational Research and Cybernetics
Abstract/Summary:PDF Full Text Request
With commercial society and the advent of the era of economic globalization,and logistics are aware of the importance of the optimization of logistics distribution vehicle routing,it can not only make the country's economic benefit is improved,the optimized resources disposition,the operation quality enhanced,it can improve the competitiveness of the enterprise itself,and promoting the development of productivity,and can largely reduce the cost of goods logistics improve the level of customer's service,can say it kill two birds with one stone.Therefore,optimizing the logistics distribution vehicle path plays a crucial role in all aspects.Therefore,how to reasonably arrange the driving path and time constraint table of the distribution vehicle to effectively deliver the goods to each station is a very important problem that transportation and logistics distribution must face.Operations research calls this the vehicle routing problem(VRP).Distribution is a very critical link in the logistics system.The reasonable distribution path arrangement has a great impact on the cost and efficiency of enterprise distribution.This makes the VRP has important practical significance and theoretical value.Based on the careful analysis on the basis of VRP research status at home and abroad,gives a general description and classification of vehicle routing problem,a further study of the load on the ability to limit the unilateral soft time window constraints of the campus vending machine distribution route optimization problem,in view of the college students on campus teaching building and dormitory building distribution in different geographical position,the particularity of the teachers and students to buy the vending machines product time;Mainly from the two aspects of saving time and shortening distribution lines,this paper applies ant colony algorithm,genetic algorithm and genetic-ant colony fusion algorithm to solve the distribution path problem of college vending machines,establishes a simulation model,and USES mathematical tools to calculate.Finally,through the comparison of the results obtained by the three methods,the optimal scheme of the distribution path of the campus vending machines was found.The example shows that the mathematical model is simple,it is easy to grasp and feasible.The model and three algorithms have strict logical reasoning and mathematical basis,and provide a better solution for the distribution path of college vending machines.
Keywords/Search Tags:Vehicle path problem, Vending machines distribution path, Ant Colony Algorithm, Genetic Algorithm, The fusion algorithm
PDF Full Text Request
Related items