摘要
在对车辆路径问题(VRP)分析的基础上,为之建立了数学模型,提出了一种适合求解该问题的蚁群遗传优化算法.提出的改进算法是先通过限制、选择和更新信息素、控制搜索次数,找出路径的满意解,大大缩短了搜索时间;再用所得较好的路径表示作为初始种群,指定为父体,直接进行分组定界操作,将已得路径进行优化改良,求得最佳配送路径.实验结果表明,该算法应用于求解物流配送路径的问题行之有效.
Based on analysis on VRP, a mathematical model is built and a optimization algorithm of ant colony and genetic suitable for solving is designed. The improved algorithm firstly improves and updates pheromone, controls the number of searches, finds satisfactory solution and greatly reduces the search time. The better route becomes the initial group and is designated father of solutions, directly operates packet and delimitation, improves the attained route to come at the best route. The experiments demonstrate that the proposed algorithm is very effective in solving the problem of logistics distribution route optimization.
出处
《哈尔滨商业大学学报（自然科学版）》
CAS
2009年第6期707-710,共4页
Journal of Harbin University of Commerce：Natural Sciences Edition
关键词
物流配送
车辆路径问题
蚁群算法
遗传算法
logistics distribution
vehicle routing problem
ant colony algorithm
genetic algorithm
