Distribution Route Of Fresh Food Chain Stores With Time Window Optimization Research

With the rapid growth of China’s economy and the improvement of people’s living standards,the demand for fresh products is also increasing,and fresh chain stores have emerged,providing consumers with fresh fresh products and convenient services.Due to the perishability and short shelf life of fresh products,more and more fresh chain stores are using cold chain logistics to ensure the quality of fresh products by stipulating that the delivery vehicles deliver the products within a fixed time window.However,compared with ordinary logistics transportation,cold chain logistics transportation with a time window will increase more expensive costs.Therefore,for fresh food chain store enterprises,how to reduce delivery costs,improve delivery punctuality and reasonably arrange delivery routes has become a key issue affecting the development of fresh food chain store enterprises.Based on this,the fresh food chain store distribution path optimization with time window is selected as the research object of the master thesis,and the specific research contents are as follows.Firstly,the research status of fresh cold chain transportation and vehicle path optimization problems at home and abroad is explained,and the current situation and problems of fresh chain store distribution enterprises are analyzed with M fresh chain store as an example.Under the consideration of traffic jam in each municipal district,the various costs of vehicle distribution with time windows are systematically studied,and a mathematical model with the objective of minimizing the total cost of distribution is established.Secondly,a hybrid ant colony algorithm is designed by combining the ant colony algorithm and the invasive weed algorithm.The initial solution derived from the ant colony algorithm is used as the initial population of the invasive weed algorithm to avoid the proliferation of the algorithm near the suboptimal solution;the characteristic of strong local search ability of the invasive weed algorithm is used to improve the local search ability and convergence speed of the new algorithm.By comparing with the literature data solved using the basic ant colony algorithm,the effectiveness and feasibility of the hybrid ant colony algorithm in solving the fresh produce chain store distribution path optimization problem are verified.Finally,using the M fresh food chain store enterprise in Taiyuan as an example,the hybrid ant colony algorithm is combined with the Python software tool to solve the model that no considering and considering the traffic congestion jam in each municipal area respectively,and the distribution scheme and total cost of both are compared.The results show that in the research of fresh food chain store distribution path problem,considering the traffic jam factor in each municipal area is more effective in reducing the distribution cost and improving the on-time delivery,which makes the research of fresh food chain store distribution path more relevant.The mathematical modeling and solution are also applicable to other fresh food chain enterprises.It is expected that this thesis can provide some theoretical references for the distribution planning of fresh food chain enterprises.