A novel multi-state gravitational search algorithm for discrete 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/28952/1/A%20novel%20multi-state%20gravitational%20search%20algorithm%20for%20discrete%20.pdf http://umpir.ump.edu.my/id/eprint/28952/2/A%20novel%20multi-state%20gravitational%20search%20algorithm%20for%20discrete_FULL.pdf http://umpir.ump.edu.my/id/eprint/28952/ https://doi.org/10.5013/IJSSST.a.16.06.15 https://doi.org/10.5013/IJSSST.a.16.06.15 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.ump.umpir.28952 |
---|---|
record_format |
eprints |
spelling |
my.ump.umpir.289522022-11-03T09:59:59Z http://umpir.ump.edu.my/id/eprint/28952/ A novel multi-state gravitational search algorithm for discrete optimization problems Ismail, Ibrahim Zuwairie, Ibrahim Hamzah, Ahmad Zulkifli, Md. Yusof QA Mathematics TK Electrical engineering. Electronics Nuclear engineering 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 results are statistically analyzed and show that the MSGSA has performed consistently in solving the discrete optimization problems. United Kingdom Simulation Society 2015-12 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/28952/1/A%20novel%20multi-state%20gravitational%20search%20algorithm%20for%20discrete%20.pdf pdf en http://umpir.ump.edu.my/id/eprint/28952/2/A%20novel%20multi-state%20gravitational%20search%20algorithm%20for%20discrete_FULL.pdf Ismail, Ibrahim and Zuwairie, Ibrahim and Hamzah, Ahmad and Zulkifli, Md. Yusof (2015) A novel multi-state gravitational search algorithm for discrete optimization problems. International Journal of Simulation: Systems, Science & Technology (IJSSST), 16 (6). 15.1-15.8. ISSN 1473-8031 (print); 1473-804x (online) https://doi.org/10.5013/IJSSST.a.16.06.15 https://doi.org/10.5013/IJSSST.a.16.06.15 |
institution |
Universiti Malaysia Pahang |
building |
UMP Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Malaysia Pahang |
content_source |
UMP Institutional Repository |
url_provider |
http://umpir.ump.edu.my/ |
language |
English English |
topic |
QA Mathematics TK Electrical engineering. Electronics Nuclear engineering |
spellingShingle |
QA Mathematics TK Electrical engineering. Electronics Nuclear engineering Ismail, Ibrahim Zuwairie, Ibrahim Hamzah, Ahmad Zulkifli, Md. Yusof A novel multi-state gravitational search algorithm for discrete optimization problems |
description |
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 results are statistically analyzed and show that the MSGSA has performed consistently in solving the discrete optimization problems. |
format |
Article |
author |
Ismail, Ibrahim Zuwairie, Ibrahim Hamzah, Ahmad Zulkifli, Md. Yusof |
author_facet |
Ismail, Ibrahim Zuwairie, Ibrahim Hamzah, Ahmad Zulkifli, Md. Yusof |
author_sort |
Ismail, Ibrahim |
title |
A novel multi-state gravitational search algorithm for discrete optimization problems |
title_short |
A novel multi-state gravitational search algorithm for discrete optimization problems |
title_full |
A novel multi-state gravitational search algorithm for discrete optimization problems |
title_fullStr |
A novel multi-state gravitational search algorithm for discrete optimization problems |
title_full_unstemmed |
A novel multi-state gravitational search algorithm for discrete optimization problems |
title_sort |
novel multi-state gravitational search algorithm for discrete optimization problems |
publisher |
United Kingdom Simulation Society |
publishDate |
2015 |
url |
http://umpir.ump.edu.my/id/eprint/28952/1/A%20novel%20multi-state%20gravitational%20search%20algorithm%20for%20discrete%20.pdf http://umpir.ump.edu.my/id/eprint/28952/2/A%20novel%20multi-state%20gravitational%20search%20algorithm%20for%20discrete_FULL.pdf http://umpir.ump.edu.my/id/eprint/28952/ https://doi.org/10.5013/IJSSST.a.16.06.15 https://doi.org/10.5013/IJSSST.a.16.06.15 |
_version_ |
1748703309734084608 |
score |
13.160551 |