QQ客服 官方微博 反馈留言

浏览/检索结果: 共1条，第1-1条 帮助 限定条件 发表日期：2009    专题：长春光学精密机械与物理研究所    第一署名单位    第一作者单位    通讯作者单位     已选(0)清除 条数/页：5101520253035404550556065707580859095100   排序方式：请选择作者升序作者降序题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序 An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文 2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China Yang Q.; Zhang C.; Wang C. 收藏  |  浏览/下载：12/0  |  提交时间：2013/03/25 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.