A Particle Swarm Optimizer based on spiking oscillators with dynamic thresholds for velocity vectors

Deterministic Particle Swarm Optimization (DPSO) variants, while useful for analyzing PSO behavior, often struggle with exploration-exploitation balance in complex landscapes. This paper introduces an improved DPSO variant based on the spiking oscillator model. The proposed algorithm employs a modified position update mechanism using the particle's velocity components, rather than the position components as in previous algorithm. This modification enhances search space exploration without reliance on random number generators. We evaluated on the CEC 2013 benchmark functions and compared with previous algorithms which uses the position components as a threshold condition. The proposed algorithm outperforms the previous one in complex landscapes, especially in the composition functions of the benchmark functions, demonstrating improved efficiency in complex optimization tasks.

Authors

Institutions

Publication Details

Journal
Nonlinear Theory and Its Applications IEICE
Published
2025-01-01
DOI
https://doi.org/10.1587/nolta.16.601
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Particle Swarm Optimizer based on spiking oscillators with dynamic thresholds for velocity vectors

Hidehiro Nakano, Tomoyuki Sasaki, Ahmed Abdul Hussein Ali
Nonlinear Theory and Its Applications IEICE
Metaheuristic Optimization Algorithms Research
article

A Particle Swarm Optimizer based on spiking oscillators with dynamic thresholds for velocity vectors

Hidehiro Nakano, Tomoyuki Sasaki, Ahmed Abdul Hussein Ali
article en

Abstract

Deterministic Particle Swarm Optimization (DPSO) variants, while useful for analyzing PSO behavior, often struggle with exploration-exploitation balance in complex landscapes. This paper introduces an improved DPSO variant based on the spiking oscillator model. The proposed algorithm employs a modified position update mechanism using the particle's velocity components, rather than the position components as in previous algorithm. This modification enhances search space exploration without reliance on random number generators. We evaluated on the CEC 2013 benchmark functions and compared with previous algorithms which uses the position components as a threshold condition. The proposed algorithm outperforms the previous one in complex landscapes, especially in the composition functions of the benchmark functions, demonstrating improved efficiency in complex optimization tasks.

Nonlinear Theory and Its Applications IEICEVol. 16(3)
Tokyo City University (JP)
Affordable and clean energy
Openalex Percentile: Top 92%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Particle Swarm Optimizer based on spiking oscillators with dynamic thresholds for velocity vectors — Hidehiro Nakano, Tomoyuki Sasaki, et al. · Nonlinear Theory and Its Applications IEICE (2025) | TGRS Research Map | TGRS