Font Size: a A A

Store Distribution Routing Design Based On Improved Ant Colony Algorithm

Posted on:2021-01-02Degree:MasterType:Thesis
Country:ChinaCandidate:T YangFull Text:PDF
GTID:2428330629954597Subject:Mechanical engineering
Abstract/Summary:PDF Full Text Request
With the rapid development of China's economy,the change of people's demand and consumption pattern in the past decade,the logistics industry has emerged.But the distribution cost in logistics activities has been high,accounting for more than half of the total logistics cost.However,the vehicle routing design in logistics distribution activities directly affects the distribution cost.Therefore,it is of great significance for enterprises to reasonably arrange the driving routes of vehicles and consider the different urgency of customers on the delivery time to achieve the purpose of reducing the cost of logistics distribution.It is conducive to improving the economic benefits and customer satisfaction of enterprises.First,this paper introduces the research progress of VRP and ACA and the significance of VRP.The vehicle routing problem with time window is described in detail.According to the situation that customers have different requirements for service time,under the condition of meeting the constraints of the maximum driving distance and the maximum number of distribution orders,Optimization model of VRPSHTW with distribution cost as the optimization objective is established.The total distribution cost includes driving cost,time penalty cost and fixed vehicle cost.In the model,not only the time penalty cost caused by the vehicle that does not arrive in the time period specified by the customer with soft time window,but also the time penalty cost caused by waiting for the customer with hard time window is considered.Then,aiming at the problem that traditional ant colony algorithm is easy to fall into local optimal solution,the improved ant colony algorithm is studied.The specific measures include the random rules and pseudo-random rules with time window factors are adopted to make the ants follow the rules of first visiting the nodes with narrow time window and short waiting time.At the same time,the influence of pseudo-random factors on the performance of ant colony algorithm is studied to determine the optimal value.The optimization rate of the improved method is 17%.Finally,the improved ant colony algorithm is applied to the distribution routing design of X food store.This paper takes into account the actual distance between each node,compares and analyzes the impact of vehicles at different departure times on the distribution cost.For the store,choose the right vehicle departure time to get a cheaper route for distribution.Based on theoretical research and case analysis,the influence of vehicle departure time on distribution cost is studied.The paper also takes into account the maximum driving distance,the maximum distribution order quantity and the actual distance between nodes.These measures ensure to reduce distribution cost and select the optimal distribution route for stores.This research topic has important theoretical and practical value for enterprises to reduce operating costs and improve the punctuality of distribution.
Keywords/Search Tags:Soft and Hard Time Window, Ant Colony Algorithm, The Distribution Cost, Vehicle Routing Problem, Time Penalty Cost
PDF Full Text Request
Related items