Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
Based on the mechanism of Particle Swarm Optimization (PSO) measurement process, every particle estimates the global minimum/maximum. Particles communicate among them to update and improve the solution during the search process. However, the PSO is only capable to solve continuous numerical optimiza...
Saved in:
Main Authors: | Ainizar, Mustapa, Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Ismail, Ibrahim |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
Universiti Malaysia Pahang
2016
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/15530/1/P126%20pg943-950.pdf http://umpir.ump.edu.my/id/eprint/15530/ http://ee.ump.edu.my/ncon/wp-content/uploads/2016/10/Proceeding-NCON-PGR-2016.zip |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Local Optimum Distance Evaluated Simulated Kalman Filter For Combinatorial Optimization Problems
by: Zulkifli, Md. Yusof, et al.
Published: (2016) -
Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
by: Ismail, Ibrahim, et al.
Published: (2014) -
A novel multi-state particle swarm optimization for discrete combinatorial optimization problems
by: Ismail, Ibrahim, et al.
Published: (2012) -
An improved multi-state particle swarm optimization for discrete combinatorial optimization problems
by: Ismail, Ibrahim, et al.
Published: (2015) -
Distance Evaluated Simulated Kalman Filter for Combinatorial Optimization Problems
by: Zulkifli, Md. Yusof, et al.
Published: (2015)