A Multi-State Gravitational Search Algorithm for 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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/9409/ http://umpir.ump.edu.my/id/eprint/9409/ http://umpir.ump.edu.my/id/eprint/9409/1/A%20Multi-State%20Gravitational%20Search%20Algorithm%20for%20Combinatorial%20Optimization.pdf |