摘要
采用改进蚁群算法求解了装配线物料配送的VRPTD问题(带最后期限时间窗的车辆路径问题)。通过信息素动态更新设计,使改进蚁群算法具有自适应性,克服了传统蚁群算法在遍历寻优过程中容易出现停滞和陷入局部最优解的缺点。通过进一步对启发函数可见度进行改进设计,提高了算法的全局搜索能力。仿真结果表明,改进蚁群算法可以很好地求解装配线VRPTD问题,这对实际应用有一定的参考价值。
The distribution of materials for VRPTD(assembly lines with the deadline time windows vehicle routing problem)is studied by improved ant colony algorithm.By pheromone dynamically updated design,the improved ant algorithm is adaptive,which overcomes the shortcomings of the traditional ant colony optimization algorithm that traversal process is prone to stagnation and falling into local optima.The design of the heuristic function of the visibility,which based on further improvement,had improved the global search capability.The simulation results show that the algorithm can solve the problem of assembly line VRPTD,which has a certain reference value for practical application.
出处
《石家庄铁道大学学报（自然科学版）》
2017年第3期55-61,共7页
Journal of Shijiazhuang Tiedao University(Natural Science Edition)
基金
河北省自然科学基金(F2013210109)
河北省高等学校创新团队领军人才培育计划(LJRC018)
河北省教育厅自然科学青年基金(QN2014151)
