An improved multi-state particle swarm optimization for discrete combinatorial optimization problems
The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. Many improvements of the binary-based algorithms have been reported. In this paper, a variant of GSA called multi-state gravitational search algorithm (MSGSA)...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English English |
Published: |
United Kingdom Simulation Society
2015
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/29595/1/An%20improved%20multi-state%20particle%20swarm%20optimization%20for%20discrete%20.pdf http://umpir.ump.edu.my/id/eprint/29595/2/An%20improved%20multi-state%20particle%20swarm%20optimization%20for%20discrete_FULL.pdf http://umpir.ump.edu.my/id/eprint/29595/ https://doi.org/10.1109/CICSyN.2015.11 https://doi.org/10.1109/CICSyN.2015.11 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
http://umpir.ump.edu.my/id/eprint/29595/1/An%20improved%20multi-state%20particle%20swarm%20optimization%20for%20discrete%20.pdfhttp://umpir.ump.edu.my/id/eprint/29595/2/An%20improved%20multi-state%20particle%20swarm%20optimization%20for%20discrete_FULL.pdf
http://umpir.ump.edu.my/id/eprint/29595/
https://doi.org/10.1109/CICSyN.2015.11
https://doi.org/10.1109/CICSyN.2015.11