机构

• 计算技术研究所 [2]
• 长春光学精密机械与物... [1]
• 软件研究所 [1]

采集方式

• OAI收割 [4]

内容类型

• 会议论文 [2]
• 期刊论文 [2]

发表日期

• 2019 [2]
• 2009 [1]
• 2007 [1]

学科主题

筛选

浏览/检索结果: 共4条，第1-4条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Chaotic particle swarm optimization with sigmoid-based acceleration coefficients for numerical function optimization 期刊论文  OAI收割 SWARM AND EVOLUTIONARY COMPUTATION, 2019, 卷号: 51, 页码: 16 作者:  Tian, Dongping;  Zhao, Xiaofei;  Shi, Zhongzhi   |  收藏  |  浏览/下载：26/0  |  提交时间：2020/12/10 Particle swarm optimization  Acceleration coefficients  Logistic map  Swarm diversity  Inertial weight  Premature convergence   DMPSO: Diversity-Guided Multi-Mutation Particle Swarm Optimizer 期刊论文  OAI收割 IEEE ACCESS, 2019, 卷号: 7, 页码: 124008-124025 作者:  Tian, Dongping;  Zhao, Xiaofei;  Shi, Zhongzhi   |  收藏  |  浏览/下载：54/0  |  提交时间：2019/12/10 Particle swarm optimization  opposition-based learning  swarm diversity  inertial weight  premature convergence  local optima  mutation strategy   a modified particle swarm optimization via particle visual modeling analysis 会议论文  OAI收割 2nd International Conference on Bio-inspired Computing, Zhengzhou, PEOPLES R CHINA, SEP 14-17, Zhao Yuxin; Zu Wei; Zeng Haitao 收藏  |  浏览/下载：14/0  |  提交时间：2011/03/20 Particle swarm optimization  Visual modeling method  Premature convergence  Particle-distribution-degree   An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE) 会议论文  OAI收割 2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007, Silicon Valley, CA, United states 作者:  Wang Y.;  Wang Y.;  Wang Y.;  Wang Y.;  Wang Y. 收藏  |  浏览/下载：25/0  |  提交时间：2013/03/25 An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed. In order to overcome the problem of premature convergence  a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree  but still keeps a rapid convergence like the basic DPSO. 2007 IEEE.