基于改进蚁群算法的水产品运输车路径优化策略

Path Optimization Strategy of Aquatic Product Vehicle based on Improved Ant Colony Algorithm

根据水产品"耐藏性"差的特点,在VRP问题数学模型中加入了水产品保鲜时间窗以及路况条件的不确定性作为约束条件,建立针对水产品运输车辆配送路径的优化模型。针对蚁群算法的缺点,改进了信息素更新策略,在状态转移规则中加入了等待因素,对信息素范围进行了限制,有效的解决了蚁群算法的缺点。最后以舟山市部分地图为基础,运用MATLAB软件对改进蚁群算法求解路径规划问题的性能进行仿真,并与基本蚁群算法相对比。结果表明,改进蚁群算法可以更加有效地优化水产品运输配送线路。

According to the characteristics of the poor tolerance of aquatic products, a time-window of fresh-keeping for aquatic products and the uncertainty of the traffic conditions was proposed and used as the constraint conditions in the mathematical model of the YRP problem. An optimization model was established for dispatching routing of the transporter of aquatic. In order to conquer the defects and improve the basic ant colony optimization, it improved pheromones updating strategy, joined the waiting factor on the state transition rule, limited the scope of pheromone, solved the defects of the ant colony optimization effectively. Finally, with the help of Zhoushan city map as the prototype and the MATLAB software, it carried out simulation to check the improved ant colony algorithm. Simulation experiment results showed that the improved ant colony algorithm can more effectively optimize the transportation routes of aquatic products than the ant colony algorithm.