A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems

@article{Chen2010ANS,
  title={A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems},
  author={Wei-neng Chen and Jun Zhang and Henry Shu-hung Chung and Wen-liang Zhong and Weigang Wu and Yu-hui Shi},
  journal={IEEE Transactions on Evolutionary Computation},
  year={2010},
  volume={14},
  pages={278-300}
}
Particle swarm optimization (PSO) is predominately used to find solutions for continuous optimization problems. As the operators of PSO are originally designed in an n-dimensional continuous space, the advancement of using PSO to find solutions in a discrete space is at a slow pace. In this paper, a novel set-based PSO (S-PSO) method for the solutions of some combinatorial optimization problems (COPs) in discrete space is presented. The proposed S-PSO features the following characteristics… 
Set-based discrete particle swarm optimization and its applications: a survey
TLDR
This paper will give an insight into the solution construction strategies, constraint handling strategies, and alternative reinforcement strategies in S-PSO together with its different variants, and the set-based PSO framework is given.
Set-based particle swarm optimization with status memory for knapsack problem
TLDR
A novel algorithm of set-based particle swarm optimization with status memory (S- PSOSM) to decide the position based on the previous position for solving knapsack problem and some operators are redefined for S-PSOSM.
A hybrid Particle Swarm Optimization algorithm for combinatorial optimization problems
TLDR
This paper aims to present a hybrid PSO algorithm that uses local search and Path relinking too, but differently to the previous approaches, this works maintains the main PSO concept for the update of the velocity of the particle.
Application Analysis on PSO Algorithm in the Discrete Optimization Problems
TLDR
An investigation of PSO algorithm from the perspective of spatial search is given, a novel analysis of the key feature changes when PSOgorithm is applied to discrete optimization, and a classification method is proposed to summary existing discrete PSO algorithms.
A New Discrete Particle Swarm Optimization Algorithm
TLDR
This paper presents a version of PSO that is able to optimize over discrete variables, which is called Integer and Categorical PSO (ICPSO), and incorporates ideas from Estimation of Distribution Algorithms (EDAs) in that particles represent probability distributions rather than solution values, and the PSO update modifies the probability distributions.
Set-Based Particle Swarm Optimization
TLDR
The proposed SBPSO is evaluated on two different discrete optimization problems: the multidimensional knapsack problem (MKP) and the feature selection problem (FSP) from machine learning.
A set-based locally informed discrete particle swarm optimization
TLDR
The experimental result shows that S-LIPS is a very promising algorithm for solving discrete problems, especially in the case where the scale of the problem is large.
Space-based initialization strategy for particle swarm optimization
TLDR
A novel initialization strategy, namely Space-based Initialization Strategy (SIS), is presented to help PSO avoid local optima and enables PSO to achieve faster convergence speed and higher solution accuracy especially in multi-modal problems.
Gravitational swarm optimizer for global optimization
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 65 REFERENCES
A novel discrete particle swarm optimization to solve traveling salesman problem
TLDR
A novel discrete PSO call C3DPSO for TSP, with modified update formulas and a new parameter c3 (called mutation factor, to help to keep the balance between exploitation and exploration), is proposed.
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients
TLDR
A novel parameter automation strategy for the particle swarm algorithm and two further extensions to improve its performance after a predefined number of generations to overcome the difficulties of selecting an appropriate mutation step size for different problems.
Fuzzy discrete particle swarm optimization for solving traveling salesman problem
TLDR
A modified particle swarm optimization (PSO) algorithm was proposed to solve a typical combinatorial optimization problem: traveling salesman problem (TSP), which is a well-known NP-hard problem.
A Cooperative approach to particle swarm optimization
TLDR
A variation on the traditional PSO algorithm, called the cooperative particle swarm optimizer, or CPSO, employing cooperative behavior to significantly improve the performance of the original algorithm.
An Improved Discrete Particle Swarm Optimization Algorithm for TSP
TLDR
The proposed Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) can prevent premature convergence to a high degree, but still keeps a rapid convergence like the basic DPSO.
Particle swarm optimization for task assignment problem
A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems
TLDR
The computational results show that the hybrid approach is more effective than the traditional discrete particle swarm optimization (DPSO) algorithm.
...
1
2
3
4
5
...