Research on Vehicle Routing of Fresh Food
Ming Dong · Guizhou nongye kexue · 2013
In order to provide a reference for solving the fresh food vehicle routing problem,the author established a fair vehicle routing model of fresh food based on the timeliness and fairness,and made a quality analysis and neighborhood structure design on the model.Meanwhile,the author proposed a new algorithm,Variable Neighborhood Ant Colony Algorithm(VNACA) combined with Variable Neighborhood Search(VNS),which has a good converging speed and robustness.Finally,computational experiments was performed to demonstrate the validity of the model and VNACA,which showed that the converging speed and effect of VNACA was the better one.