An improved binary particle swarm optimization for discrete optimization problems

DOI10.3969/J.ISSN.1006-7043.201306024MaRDI QIDQ3195834zbMATH OpenFDO

Authors Guisheng Yin, Xiaohui Cui, Yuxin Dong, Xue Yang

Publication date 28 October 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1006-7043.201306024

zbMATH Keywords

binary particle swarm optimizationchaosdiscrete optimizationGray codeoff-spring processing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An analysis of binary particle swarm optimization
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
• Binary particle swarm optimization with multiple evolutionary strategies
• scientific article; zbMATH DE number 5811277
• A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior

Cited in

(10)

• Putting continuous metaheuristics to work in binary search spaces
• Gompertz PSO variants for knapsack and multi-knapsack problems
• A novel x-shaped binary particle swarm optimization
• An analysis of binary particle swarm optimization
• Binary particle swarm optimization with multiple evolutionary strategies
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
• A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior
• Design and applications of discrete evolutionary algorithm based on encoding transformation
• Particle Algorithms for Optimization on Binary Spaces
• Improved discrete PSO algorithm and its application in winner determination problem

This page was built for publication: An improved binary particle swarm optimization for discrete optimization problems

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