Font Size: a A A

Research On Path Optimization Of M Company's Logistics Distribution Problem

Posted on:2020-06-25Degree:MasterType:Thesis
Country:ChinaCandidate:W ZhouFull Text:PDF
GTID:2439330596997653Subject:Logistics engineering
Abstract/Summary:PDF Full Text Request
Although China is the world's largest tobacco country and has a large consumer group,with the influx of foreign cigarette brands,the emergence of cigarette substitutes and domestic tobacco control actions,tobacco companies face more challenges,If China Tobacco enterprises want to expand their market share in a limited market and guarantee their own industry profits under the severe domestic and international situation,they must not only open source,but also cut costs and control their own costs.In view of the fact that tobacco companies have not achieved optimal vehicle-to-vehicle distribution,the distribution process has not been effectively monitored,and the customer service level needs to be improved,this paper selects M company's logistics for research.The main research contents include:(1)Introduction to tobacco background and related theories.In the first chapter,the industry background of tobacco companies is introduced.The second chapter introduces the related theories,including path optimization theory,time window vehicle path theory and solution.The algorithm of the path optimization problem is theoretically prepared for the subsequent research.(2)The third chapter introduces the current situation of M company's logistics,including the status of M company's distribution network,the status of the distribution process,the status of the delivery personnel and vehicles,etc.Through understanding,it is found that M company has no vehicle rate in the logistics distribution.The best,the delivery cost is not optimal,and the retail customer's demand time is not considered.(3)In the fourth chapter,the time window vehicle path model is established for the existing problems of the company.K-means clustering is used for the situation that the distribution characteristics of retailers are clustered and the distribution of existing distribution lines of M company is large.The algorithm divides the sample data into four categories and uses the improved ant colony algorithm to solve the optimal delivery route for each class.The final solution proves that the proposed route optimization method canreduce the distribution cost of M company,and can basically meet the demand time of retail customers,thus improving customer satisfaction.In short,the research in this paper not only helps M company to solve the logistics problem,but also enriches the relevant theories of tobacco logistics distribution to a certain extent.
Keywords/Search Tags:tobacco logistics, time window vehicle routing problem, K-means algorithm, improved ant colony algorithm
PDF Full Text Request
Related items