主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2019, Vol. 27 ›› Issue (11): 107-115.doi: 10.16381/j.cnki.issn1003-207x.2019.11.011

• Articles • Previous Articles     Next Articles

Research on Cold Chain Logistics Distribution Path Optimization Based on Hybrid Ant Colony Algorithm

FANG Wen-ting, AI Shi-zhong, WANG Qing, FAN Jun-bo   

  1. School of Economics and Management, Xidian University, Xian 710126, China
  • Received:2018-07-15 Revised:2019-08-15 Online:2019-11-20 Published:2019-11-28

Abstract: With the development of society, consumer demand for fresh green food is increasing.In order to meet market demand and improve their competitiveness, cold chain logistics enterprises constantly expand the number of vehicles in the transportation process, however, their operating costs also increases.For the development of modern cold chain logistics enterprises,high costs have become the biggest resistance to their development. Meanwhile, with the implementation of the concept of green logistics in China,enterprises will simultaneously face the dual pressures of economy and environment.In response to this problem, this paper intends to find a distribution strategy for cold chain logistics enterprises,so that enterprises can achieve a win-win situation of economy and environment. Therefore,based on the concept of green logistics, energy conservation and emission reduction are converted into green cost,and a mathematical model is established with fixed cost, green cost,refrigeration cost, cargo damage cost and soft time window penalty cost, and the minimum total costs as the research goal. The vehicle routing problem (VRP) is an NP-hard problem and cannot be solved by an precise algorithm. In this paper,a hybrid ant colony algorithm is proposed to solve the vehicle path model of cold chain logistics.Aiming at the problem of slow convergence due to insufficient pheromone in the initial stage of ant colony algorithm, the A* algorithm is used to find the optimal solution, and initial pheromone of the corresponding path is assigned the value λτc,(λ>1). The initial pheromone of other paths is assigned the value τc.The purpose of shortening the convergence time of the ant colony algorithm and reducing the convergence time is achieved.At the same time,heuristic factors and transfer probability are modified according to the research content in this paper to make the mixed ant colony algorithm more suitable the problem to be studied in this paper. The data provided by a cold chain logistics company in Xi'an are used to verify the effectiveness of the model and algorithm. The results show that the model and algorithm of this paper can provide an effective distribution strategy for cold chain logistics enterprises, this strategy can reduce costs for logistics com-panies and facilitate business development. Furthermore, to verify the validity of the algorithm, after the algorithm comparison, the ant colony algorithm that initializes the pheromone can effectively reduce the convergence time.The hybrid ant colony algorithm can effectively reduce the distribution cost of the enterprise compared with the basic ant colony algorithm and the A* algorithm. In summary, the model and algorithm of this paper can provide method support for logistics enterprise's distribution activity optimization.

Key words: vehicle routing problem, cold chain logistics, energy saving and emission reduction, hybrid ant colony algorithm

CLC Number: