arXiv 2104.124752021-04-26cs.NE

Particle Swarms Reformulated towards a Unified and Flexible Framework

Mauro Sebastián Innocente

备注：: Preprint The final authenticated article will be published by Springer-Nature in the Lecture Notes in Computer Science series. This research will be presented at the Twelfth International Conference on Swarm Intelligence (ICSI 2021)
发表信息：: Lecture Notes in Computer Science, ICSI 2021

英文摘要：

The Particle Swarm Optimisation (PSO) algorithm has undergone countless modifications and adaptations since its original formulation in 1995. Some of these have become mainstream whereas many others have not been adopted and faded away. Thus, a myriad of alternative formulations have been proposed to the extent that the question arises as to what the basic features of an algorithm must be to belong in the PSO family. The aim of this paper is to establish what defines a PSO algorithm and to attempt to formulate it in such a way that it encompasses many existing variants. Therefore, different versions of the method may be posed as settings within the proposed unified framework. In addition, the proposed formulation generalises, decouples and incorporates features to the method providing more flexibility to the behaviour of each particle. The closed forms of the trajectory difference equation are obtained, different types of behaviour are identified, stochasticity is decoupled, and traditionally global features such as sociometries and constraint-handling are re-defined as particle's attributes.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A Particle Swarm Optimization-based Flexible Convolutional Auto-Encoder for Image Classification

Convolutional auto-encoders have shown their remarkable performance in stacking to deep convolutional neural networks for classifying image data during past several years. However, they are unable to construct the state-of-the-art convolutional neural networks due to their intrinsic architectures. In this regard, we propose a flexible convolutional auto-encoder by eliminating the constraints on the numbers of convolutional layers and pooling layers from the traditional convolutional auto-encoder. We also design an architecture discovery method by using particle swarm optimization, which is cap…

2018-11-11cs.NE

考虑机器多状态的节能柔性作业车间调度问题的离散差分进化粒子群优化算法

Discrete Differential Evolution Particle Swarm Optimization Algorithm for Energy Saving Flexible Job Shop Scheduling Problem Considering Machine Multi States

Business School, Shandong Normal University（山东师范大学商学院）；School of Mathematics, Yunnan Normal University（云南师范大学数学学院）；School of Physics and Electronics, Shandong Normal University（山东师范大学物理与电子科学学院）

针对制造业节能调度需求，本文提出考虑机器多速度和准备时间的节能柔性作业车间调度问题（EFJSP-M），并设计离散差分进化粒子群优化算法（D-DEPSO），通过混合初始化、差分进化更新和关键路径变邻域搜索策略求解，实验证明其可行性与优越性。

2025-03-04cs.AIcs.NE

一种基于自适应平衡搜索的互补异构粒子群优化架构

An Adaptive Balance Search Based Complementary Heterogeneous Particle Swarm Optimization Architecture

提出一种结合互补异构PSO框架与自适应平衡搜索策略的架构，通过双通道双子群有效利用构建向量，平衡探索与开发，提升纯认知PSO性能并验证泛化能力。

2025-04-21cs.NE

AutoPSO：一种用于自动粒子群优化的元框架

AutoPSO: A Meta-framework for Automated Particle Swarm Optimization

Southern University of Science and Technology（南方科技大学）；Pengcheng Laboratory（鹏城实验室）；The Hong Kong Polytechnic University（香港理工大学）

AutoPSO是用于构建定制PSO算法的自动化元框架，通过双层搜索结合EvoX实现高效评估，发现的新型PSO变体在数值基准和机器人控制任务上显著优于强基线。

2026-08-25cs.NE

Adaptive spline fitting with particle swarm optimization

The University of Texas Rio Grande Valley（德克萨斯大学里奥格兰德河谷分校）；The University of Rochester（罗切斯特大学）

In fitting data with a spline, finding the optimal placement of knots can significantly improve the quality of the fit. However, the challenging high-dimensional and non-convex optimization problem associated with completely free knot placement has been a major roadblock in using this approach. We present a method that uses particle swarm optimization (PSO) combined with model selection to address this challenge. The problem of overfitting due to knot clustering that accompanies free knot placement is mitigated in this method by explicit regularization, resulting in a significantly improved pe…

2020-07-26cs.LGcs.NEstat.CO

时间序列模体发现的粒子群优化算法

Particle swarm optimization for time series motif discovery

IIIA-CSIC, the Artificial Intelligence Research Institute of the Spanish National Research Council（西班牙国家研究委员会人工智能研究所（IIIA-CSIC））

在时间序列数据中有效地找到相似的片段或主题是一项基本任务，由于这些数据的普遍存在，它存在于广泛的领域和情况中。因此，人们设计了无数的解决方案，但迄今为止，似乎没有一个是完全令人满意和灵活的。在本文中，我们提出了一个创新的观点，并提出了一个解决方案，来自它：一个基于粒子群的时间序列模体发现的任何时候多峰优化算法。通过考虑来自各个领域的数据，我们表明，这种解决方案是非常有竞争力的，当与国家的最先进的，获得可比的图案在相当少的时间，使用最少的内存。此外，我们表明，它是强大的不同的实现选择，并看到它提供了前所未有的灵活性方面的任务。所有这些品质使所提出的解决方案脱颖而出，作为最突出的候选人之一，在长时间序列流的主题发现。此外，我们相信所提出的观点可以在进一步的时间序列分析和挖掘任务中加以利用，从而拓宽研究范围，并可能产生新的有效解决方案。

2015-01-29cs.LGcs.NE

更多相关论文收起更多论文

基于粒子群优化的多简单循环储备池结构设计

Structuring Multiple Simple Cycle Reservoirs with Particle Swarm Optimization

International Research Center for Neurointelligence, The University of Tokyo（国际神经智能研究中心，东京大学）；School of Computer Science, University of Birmingham（伯明翰大学计算机科学学院）；Graduate School of Medicine, The University of Tokyo（东京大学医学研究生院）；Department of Computer Science, Graduate School of Engineering, Nagoya Institute of Technology（名古屋工业大学工学研究生院计算机科学系）

本文提出多简单循环储备池（MSCR）框架，利用粒子群优化（PSO）优化互连结构，在低维状态下超越现有模型，并在三个基准任务上验证了其预测性能优势。

2025-04-21cs.LGcs.NE

They Might NOT Be Giants: Crafting Black-Box Adversarial Examples with Fewer Queries Using Particle Swarm Optimization

Rochester Institute of Technology（罗切斯特理工学院）；King Abdul-Aziz University（阿卜杜勒·阿齐兹国王大学）

Machine learning models have been found to be susceptible to adversarial examples that are often indistinguishable from the original inputs. These adversarial examples are created by applying adversarial perturbations to input samples, which would cause them to be misclassified by the target models. Attacks that search and apply the perturbations to create adversarial examples are performed in both white-box and black-box settings, depending on the information available to the attacker about the target. For black-box attacks, the only capability available to the attacker is the ability to quer…

2019-09-16cs.AIcs.CVcs.LG

柔性作业车间调度问题中工人灵活性的基准测试环境

A Benchmarking Environment for Worker Flexibility in Flexible Job Shop Scheduling Problems

本文针对带工人灵活性的柔性作业车间调度问题（FJSSP-W），提出包含402个FJSSP实例及扩展工人灵活性方法的基准测试环境，提供评估程序、模型表示、复杂度特征和基线结果，以支持算法开发与比较。

2025-04-14cs.NE