Loading...
Please wait, while we are loading the content...
Similar Documents
An Improved Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ibrahim, Ismail Adegboyega Ibrahim, Ismail Ibrahim, Zuwairie Ahmad, Hamzah Yusof, Zulkifli Md |
| Copyright Year | 2016 |
| Abstract | Particle swarm optimization (PSO) has been successfully applied to solve various optimization problems. Recently, a state-based algorithm called multi-state particle swarm optimization (MSPSO) has been proposed to solve discrete combinatorial optimization problems. The algorithm operates based on a simplified mechanism of transition between two states. However, the MSPSO algorithm has to deal with the production of infeasible solutions and hence, additional step to convert the infeasible solution to feasible solution is required. In this paper, the MSPSO is improved by introducing a strategy that directly produces feasible solutions. The performance of the improved multi-state particle swarm optimization (IMSPSO) is empirically evaluated based on a set of travelling salesman problems (TSPs). The experimental results are statistically analyzed and show that the IMSPSO is promising and consistently outperformed the binary PSO algorithm. Keywords-component; discrete combinatorial optimization problem; multi-state; particle swarm optimization |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://ijssst.info/Vol-16/No-6/paper14.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
