Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. Many works have focused on the improvement of the binary-based algorithms. Yet, none of these works have been represented in states. In this paper, by...
Saved in:
Main Authors: | Ismail, Ibrahim, Hamzah, Ahmad, Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Kamal, Khalil, Muhammad Arif, Abdul Rahim |
---|---|
Format: | Article |
Language: | English |
Published: |
United Kingdom Simulation Society
2014
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/6412/1/Multi-State_Particle_Swarm_Optimization_for_Discrete_Combinatorial_Optimization_Problem.pdf http://umpir.ump.edu.my/id/eprint/6412/ http://ijssst.info/Vol-15/No-1/paper3.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A novel multi-state particle swarm optimization for discrete combinatorial optimization problems
by: Ismail, Ibrahim, et al.
Published: (2012) -
A novel multi-state particle swarm optimization for discrete combinatorial optimization problems
by: Ibrahim, Ismail, et al.
Published: (2012) -
A novel multi-state particle swarm optimization for discrete combinatorial optimization problems.
by: Zulkifli, Md. Yusof, et al.
Published: (2012) -
An improved multi-state particle swarm optimization for discrete combinatorial optimization problems
by: Ismail, Ibrahim, et al.
Published: (2015) -
An Improved Multi-State Particle Swarm Optimization for Discrete Optimization Problems
by: Ismail, Ibrahim, et al.
Published: (2015)