Ismail, Ibrahim and Zuwairie, Ibrahim and Hamzah, Ahmad and Zulkifli, Md. Yusof (2015) A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems. In: Proceedings of the 7th International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN 2015) , 3–5 June 2015 , Riga, Latvia. pp. 9-14..
PDF
A Multi-State Gravitational Search Algorithm for Combinatorial Optimization.pdf - Published Version Restricted to Repository staff only Download (789kB) | Request a copy |
Abstract
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.
Item Type: | Conference or Workshop Item (Speech) |
---|---|
Additional Information: | ISBN: 978-1-4673-7016-5 |
Uncontrolled Keywords: | rule-based; multi-state; gravitational search algorithm; discrete combinatorial optimization problem; travelling salesman problem |
Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering |
Faculty/Division: | Faculty of Electrical & Electronic Engineering |
Depositing User: | Mrs. Neng Sury Sulaiman |
Date Deposited: | 07 Jul 2015 07:58 |
Last Modified: | 11 Apr 2018 03:57 |
URI: | http://umpir.ump.edu.my/id/eprint/9409 |
Download Statistic: | View Download Statistics |
Actions (login required)
View Item |