基于改进的人工鱼群算法的车辆优化调度  

Vehicle Routing Problem Based on Improved Artificial Fish School Algorithm

作　　者：覃磊[1,2] 周康[1] 

机构地区：[1]武汉轻工大学数学与计算机学院,湖北武汉430023 [2]华中科技大学自动化学院,湖北武汉430074

出　　处：《微电子学与计算机》2015年第6期50-53,共4页Microelectronics & Computer

基　　金：国家自然科学基金(61179032;61072143);湖北省自然科学基金(2011CDB229);湖北省教育厅科技计划项目(B20091803;D20111702;Q20131703)

摘　　要：求解车辆优化调度问题(VRP)的改进人工鱼群算法(IAFSA),首先将车辆与车辆路径通过PPS-PPR的三维粒子编码方法进行编码,有效构造车辆路径,其次为满足VRP问题的约束条件和加强人工鱼群算法(AFSA)的搜索性能,对AFSA算法的可行性和行为进行了改进,最后给出了求解VRP问题的IAFSA的具体步骤和实验.实验结果表明,IAFSA算法不仅具有较快的收敛速度,而且以较大的概率收敛于VRP的最优解.An improved artificial fish school algorithm(IAFSA)is proposed for VRP.Firstly,the vehicles and the vehicle paths are encoded through PPS-PPR three-dimensional particle coding method and effective vehicle paths are constructed.Secondly,in order to satisfy the constraint conditions of VRP and strengthen the search performance of the artificial fish school algorithm(AFSA),the feasibility and the behavior of AFSA are improved.Finally,the concrete steps of IAFSA and experiments are presented.Experimental results show that IAFSA not only has faster convergence speed,but also converges to the optimal solution of VRP with the larger probability.

关 键 词：车辆优化调度问题 人工鱼群算法 编码 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]