首页 | 本学科首页   官方微博 | 高级检索  
     

基于混合蚁群算法的物流配送路径优化
引用本文:陈卫东,王佳.基于混合蚁群算法的物流配送路径优化[J].计算机工程与设计,2009,30(14).
作者姓名:陈卫东  王佳
作者单位:1. 河南工业大学,信息科学与工程学院,河南,郑州,450052
2. 长沙理工大学,计算机与通信工程学院,湖南,长沙,410076
摘    要:基本蚁群算法在优化过程中存在搜索时间长、易陷入局部最优解的缺点.研究构造了一种基于蚁群算法的混合算法,利用蚁群算法首先求出问题的基本可行解,采用遗传变异中的单亲逆转算子进行再次优化,求得问题最优解.对物流配送路径优化的仿真试验表明,相对于基本蚁群算法和遗传算法,混合算法的优化质量和效率更优.

关 键 词:物流配送路径  优化  遗传算法  蚁群算法  混合蚁群算法

Optimizing route of logistics based on hybrid ant colony algorithm
CHEN Wei-dong,WANG Jia.Optimizing route of logistics based on hybrid ant colony algorithm[J].Computer Engineering and Design,2009,30(14).
Authors:CHEN Wei-dong  WANG Jia
Abstract:Ant colony algorithm (ACA) is successfully applied to several combinatorial optimization problems, but it has some short-comings such as its slow computing speed, and it is easy to fall in a local optimal. So a hybrid ant colony algorithm is proposed by using the standard genetic algorithm (GA) in optimizing the ACA parameters. The basic feasible solution is searched by ACA firstly, thegn the quadratic optimal is gotten by using single-parent reverse mutation operators of GA, finally obtaining is fit for the problem optimal solution by comparison. The algorithm is applied on the logistics delivery routes problem, the simulation results showed that its optimi-zation quality and efficiency superior to the traditional ACA and the GA.
Keywords:logistics delivery routes  optimization  genetic algorithm  ant colony algorithm  hybrid ant colony algorithm
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号