QQ客服 官方微博 反馈留言

	An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE)
	Yang Q. ; Zhang C. ; Wang C.
	2009
会议名称	2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009
会议地点	Nanchang, China
关键词	Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity higher success rate less running time and more robust.
页码	686-690
收录类别	EI
内容类型	会议论文
源URL	[http://ir.ciomp.ac.cn/handle/181722/33511]
专题	长春光学精密机械与物理研究所_中科院长春光机所知识产出_会议论文
推荐引用方式 GB/T 7714	Yang Q.,Zhang C.,Wang C.. An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE)[C]. 见:2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009. Nanchang, China.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。