计算机应用研究2011，Vol.28Issue(12)：4503-4506,4.DOI:10.3969/j.issn.1001-3695.2011.12.027
求解CVRP的改进混合蛙跳算法研究
Study of modified shuffled frog leaping algorithm for solving CVRP
万博 1卢昱 2陈立云 1何瑞波1
作者信息
- 1. 军械工程学院计算机工程系,石家庄050003
- 2. 军械工程学院训练部,石家庄050003
- 折叠
摘要
Abstract
To solve CVRP,this paper proposed a modified SFLA, which based on the mathematical model of CVRP, and de-signed a new method for constructing initial population. The modified shuffled frog leaping algorithm adopted real-coded pat-terns. Then it combined with adaptive differential disturbance and chaotic local search strategy in local searching. It enhanced the ability to escape from local optima and sped up the convergence of SFLA, meanwhile, maintained global convergence of SFLA. Experimental results indicate the effectiveness and robustness of the modified shuffled frog leaping algorithm in solving CVRP via comparing with three other algorithms.关键词
车辆路径问题/混合蛙跳算法/自适应差分扰动/混沌局部搜索/全局收敛性Key words
vehicle routing problem ( VRP)/ shuffled frog leaping algorithm ( SFLA )/ adaptive differential disturbance/ chaotic local search/ global convergence/分类
信息技术与安全科学引用本文复制引用
万博,卢昱,陈立云,何瑞波..求解CVRP的改进混合蛙跳算法研究[J].计算机应用研究,2011,28(12):4503-4506,4.
