机构

• 长春光学精密机械与物... [2]
• 数学与系统科学研究院 [1]
• 近代物理研究所 [1]

采集方式

• OAI收割 [4]

内容类型

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

发表日期

• 2021 [1]
• 2014 [1]
• 2008 [1]
• 2007 [1]

学科主题

筛选

浏览/检索结果: 共4条，第1-4条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Identifying Top-k Influential Nodes Based on Discrete Particle Swarm Optimization With Local Neighborhood Degree Centrality 期刊论文  OAI收割 IEEE ACCESS, 2021, 卷号: 9, 页码: 21345-21356 作者:  Han, Lihong;  Zhou, Qingguo;  Tang, Jianxin;  Yang, Xuhui;  Huang, Hengjun   |  收藏  |  浏览/下载：22/0  |  提交时间：2021/12/10 Social networking (online)  Particle swarm optimization  Optimization  Search problems  Integrated circuit modeling  Heuristic algorithms  Social sciences  Discrete particle swarm optimization  local search strategy  neighbourhood degree centrality  top-k influential nodes  social network   A TRANSFER FORECASTING MODEL FOR CONTAINER THROUGHPUT GUIDED BY DISCRETE PSO 期刊论文  OAI收割 JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2014, 卷号: 27, 期号: 1, 页码: 181-192 作者:  Xiao Jin;  Xiao Yi;  Fu Julei;  Lai Kin Keung   |  收藏  |  浏览/下载：18/0  |  提交时间：2021/01/14 HONG-KONG  CARGO THROUGHPUT  PORT  TIME  Analog complexing  container throughput forecasting  discrete particle swarm optimization  transfer forecasting model   A comparative study of discrete differential evolution on binary constraint satisfaction problems (EI CONFERENCE) 会议论文  OAI收割 2008 IEEE Congress on Evolutionary Computation, CEC 2008, June 1, 2008 - June 6, 2008, Hong Kong, China Yang Q. 收藏  |  浏览/下载：65/0  |  提交时间：2013/03/25 There are some variants and applications of the discretization of differential evolution. Performances of discrete differential evolution algorithms on random binary constraint satisfaction problem are studied in this paper  and a novel discrete differential evolution algorithm based on exchanging elements is proposed. We compare the proposed discrete differential evolution  evolutionary algorithms and discrete particle swarm optimization on random binary constraint satisfaction problems. Experimental results indicate though the proposed algorithm is simpler  it is competitive with other evolutionary algorithms solving constraint satisfaction problems. 2008 IEEE.   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. 收藏  |  浏览/下载：28/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.