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 |
| Summary: | 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) for discrete optimization problems is proposed. The MSGSA concept is based on a simplified mechanism of transition between two states. The performance of the MSGSA is empirically compared to the original BGSA based on six sets of selected benchmarks instances of traveling salesman problem (TSP). The experimental results show the effectiveness of the newly introduced approach, regarding its ability to consistently outperform the binary-based algorithm in solving the discrete optimization problems. |
|---|