基于混合粒子群算法的粮食应急调度系统中的路径规划  

PATH PLANNING IN FOOD EMERGENCY DISPATCH SYSTEM BASED ON HYBRID PARTICLE SWARM ALGORITHM

作　　者：李周芳[1] 肖乐[1] 

机构地区：[1]河南工业大学信息科学与工程学院,河南郑州450001

出　　处：《河南工业大学学报（自然科学版）》2013年第5期83-86,共4页Journal of Henan University of Technology：Natural Science Edition

基　　金："十一五"国家科技支撑计划重点项目(2008BADA8B03);科技部科技型中小企业创新基金项目(10C26214102205)

摘　　要：粮食应急调度系统能够在受灾时对应急救援物资进行科学、有效、快速地调配,其中路径规划起重要的作用.然而,由于实际中受灾的需求点数目较多、数目分散、路型与路况不同、时间急迫等特点,对合理有效路径规划的要求越来越高.粒子群算法是一种有效的进化计算方法,能够快速、准确地求解连续变量的优化问题.提出一种新的包括离散个体与连续个体的混合编码粒子群优化算法,用于粮食应急调度系统中的路径规划.结果显示:该算法不仅具有简单的原理,而且能够很好地解决粮食应急调度系统中的路径规划问题.A food emergency dispatch system can dispatch emergency relief supplies scientifically, effectively and rapidly when a disaster occurs, and path planning plays an important role in the food emergency dispatch system. However, higher requirements for reasonable and effective path planning are required due to the characteristics of an actual disaster, such as larger number of demand points, dispersed locations, different road types and conditions, and urgency. Particle swarm algorithm is an effective evolutionary computation method, and can rapidly and accurately solve optimization problem of continuous variables. A new hybrid coding particle swarm optimization algorithm comprising discrete individuals and continuous individuals was put forward, and was applied in path planning in the food emergency dispatch system. The results showed that the algorithm was simple in principle, and could well solve the path planning problem in the food emergency dispatch system.

关 键 词：路径规划 粮食应急调度 粒子群优化 混合粒子群 

分 类 号：TS210[轻工技术与工程—粮食、油脂及植物蛋白工程] TP3[轻工技术与工程—食品科学与工程]