基于粒子群算法的多应急点资源调度研究  

Multiple Emergency Point Resources Scheduling Research Based on Particle Swarm Optimization

作　　者：左春荣[1] 周玉琴[1] 

机构地区：[1]合肥工业大学管理学院,安徽合肥230009

出　　处：《微电子学与计算机》2012年第7期135-137,共3页Microelectronics & Computer

基　　金：国家自然科学基金项目(90924021)

摘　　要：分析多应急点多出救点以及多资源的应急调度问题,且考虑实际的应急资源调度时间会受到影响,故加入联系数进行分析,建立应急最早开始时间和出救点数最少为目标函数的模型.运用粒子群算法求解,最后构造数值算例,验证了所建立模型的合理性和粒子群算法的可行性.Analyzingy multiple emergency point,multiple save point and multiple resources,and considering the actual emergency resources scheduling time will be affected,so join connection number for analysis,we establish a emergency scheduling model base on the earliest start time and minimum save point.Using particle swarm algorithm solving this model,finally tectonic data example verified by the rationality of the model is built and particle swarm algorithm is feasible.

关 键 词：资源调度 多应急点 联系数 粒子群算法 

分 类 号：O221.6[理学—运筹学与控制论]