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...

Full description

Bibliographic Details
Main Authors: Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof
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
id ump-9409
recordtype eprints
spelling ump-94092018-04-11T03:57:29Z http://umpir.ump.edu.my/id/eprint/9409/ A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems Ismail, Ibrahim Zuwairie, Ibrahim Hamzah, Ahmad Zulkifli, Md. Yusof 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 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. 2015 Conference or Workshop Item PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/9409/1/A%20Multi-State%20Gravitational%20Search%20Algorithm%20for%20Combinatorial%20Optimization.pdf 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.. http://dx.doi.org/10.1109/CICSyN.2015.12
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
Ismail, Ibrahim
Zuwairie, Ibrahim
Hamzah, Ahmad
Zulkifli, Md. Yusof
A Multi-State Gravitational Search Algorithm for Combinatorial 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 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.
format Conference or Workshop Item
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 Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems
title_short A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems
title_full A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems
title_fullStr A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems
title_full_unstemmed A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems
title_sort multi-state gravitational search algorithm for combinatorial optimization problems
publishDate 2015
url 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
first_indexed 2023-09-18T22:07:57Z
last_indexed 2023-09-18T22:07:57Z
_version_ 1777414835231784960