Analysis and improvement of the binary particle swarm optimization

DOI10.1007/S10479-024-06112-3MaRDI QIDQ6945291zbMATH OpenFDO

Authors Sameh Kessentini

Publication date 9 August 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-06112-3

zbMATH Keywords

analysis of algorithmsbinary particle swarm optimizationbinary problemsparameter settingMarkov chain model

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• scientific article; zbMATH DE number 5116232 (Why is no real title available?)
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• A discrete particle swarm optimization method for feature selection in binary classification problems
• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
• A study of particle swarm optimization particle trajectories
• AI 2005: Advances in Artificial Intelligence
• An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot
• Analysis of the global convergence of a particle swarm optimization algorithm based on a Markov chain
• Constrained particle swarm optimization for health maintenance in three-mass resonant servo control system with LuGre friction model
• Convergence analysis of standard particle swarm optimization algorithm and its improvement
• Convergence and stochastic stability analysis of particle swarm optimization variants with generic parameter distributions
• Dichotomous binary differential evolution for knapsack problems
• Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
• Finite Markov chain analysis of classical differential evolution algorithm
• Markov Chains with Absorbing States: A Genetic Example
• Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise
• Order-3 stability analysis of particle swarm optimization
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
• Runtime analysis of a binary particle swarm optimizer
• Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
• Time-varying PSO - convergence analysis, convergence-related parameterization and new parameter adjustment schemes

This page was built for publication: Analysis and improvement of the binary particle swarm optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945291)