A fast discrete gravitational search algorithm
This study introduces a variant of Gravitational Search Algorithm (GSA) for discrete optimization problems, namely, Fast Discrete Gravitational Search Algorithm (FDGSA). The main difference between the proposed FDGSA and the existing Binary Gravitational Search Algorithm (BGSA) is that an agent'...
Main Authors: | , , , , , , |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
IEEE
2012
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/26985/1/A%20fast%20discrete%20gravitational%20search%20algorithm.pdf |
_version_ | 1796993788973940736 |
---|---|
author | Hasrul, Che Shamsudin Addie Irawan, Hashim Zuwairie, Ibrahim Amar Faiz, Zainal Abidin Sophan Wahyudi, Nawawi Muhammad Arif, Abdul Rahim Kamal, Khalil |
author_facet | Hasrul, Che Shamsudin Addie Irawan, Hashim Zuwairie, Ibrahim Amar Faiz, Zainal Abidin Sophan Wahyudi, Nawawi Muhammad Arif, Abdul Rahim Kamal, Khalil |
author_sort | Hasrul, Che Shamsudin |
collection | UMP |
description | This study introduces a variant of Gravitational Search Algorithm (GSA) for discrete optimization problems, namely, Fast Discrete Gravitational Search Algorithm (FDGSA). The main difference between the proposed FDGSA and the existing Binary Gravitational Search Algorithm (BGSA) is that an agent's position is updated based on its direction and velocity. Both the direction and velocity determine the candidates of integer values for the position update of an agent and then the selection is done randomly. Unimodal test functions, such as De Jong's function, Scwefel's function and Rosenbrock's valley are used to evaluate the performance of the proposed FDGSA. Comparison with BGSA is done to benchmark the proposed FDGSA in terms of speed of convergence and quality of solution. The experimental result shows that the proposed FDGSA converges faster compared to the BGSA. |
first_indexed | 2024-03-06T12:38:44Z |
format | Conference or Workshop Item |
id | UMPir26985 |
institution | Universiti Malaysia Pahang |
language | English |
last_indexed | 2024-03-06T12:38:44Z |
publishDate | 2012 |
publisher | IEEE |
record_format | dspace |
spelling | UMPir269852020-09-07T08:39:16Z http://umpir.ump.edu.my/id/eprint/26985/ A fast discrete gravitational search algorithm Hasrul, Che Shamsudin Addie Irawan, Hashim Zuwairie, Ibrahim Amar Faiz, Zainal Abidin Sophan Wahyudi, Nawawi Muhammad Arif, Abdul Rahim Kamal, Khalil TK Electrical engineering. Electronics Nuclear engineering This study introduces a variant of Gravitational Search Algorithm (GSA) for discrete optimization problems, namely, Fast Discrete Gravitational Search Algorithm (FDGSA). The main difference between the proposed FDGSA and the existing Binary Gravitational Search Algorithm (BGSA) is that an agent's position is updated based on its direction and velocity. Both the direction and velocity determine the candidates of integer values for the position update of an agent and then the selection is done randomly. Unimodal test functions, such as De Jong's function, Scwefel's function and Rosenbrock's valley are used to evaluate the performance of the proposed FDGSA. Comparison with BGSA is done to benchmark the proposed FDGSA in terms of speed of convergence and quality of solution. The experimental result shows that the proposed FDGSA converges faster compared to the BGSA. IEEE 2012 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/26985/1/A%20fast%20discrete%20gravitational%20search%20algorithm.pdf Hasrul, Che Shamsudin and Addie Irawan, Hashim and Zuwairie, Ibrahim and Amar Faiz, Zainal Abidin and Sophan Wahyudi, Nawawi and Muhammad Arif, Abdul Rahim and Kamal, Khalil (2012) A fast discrete gravitational search algorithm. In: IEEE 4th International Conference on Computational Intelligence, Modelling and Simulation (CIMSim 2012) , 25-27 September 2012 , Kuantan, Pahang Darul Makmur. pp. 24-28.. ISBN 978-1-4673-3113-5 https://doi.org/10.1109/CIMSim.2012.28 |
spellingShingle | TK Electrical engineering. Electronics Nuclear engineering Hasrul, Che Shamsudin Addie Irawan, Hashim Zuwairie, Ibrahim Amar Faiz, Zainal Abidin Sophan Wahyudi, Nawawi Muhammad Arif, Abdul Rahim Kamal, Khalil A fast discrete gravitational search algorithm |
title | A fast discrete gravitational search algorithm |
title_full | A fast discrete gravitational search algorithm |
title_fullStr | A fast discrete gravitational search algorithm |
title_full_unstemmed | A fast discrete gravitational search algorithm |
title_short | A fast discrete gravitational search algorithm |
title_sort | fast discrete gravitational search algorithm |
topic | TK Electrical engineering. Electronics Nuclear engineering |
url | http://umpir.ump.edu.my/id/eprint/26985/1/A%20fast%20discrete%20gravitational%20search%20algorithm.pdf |
work_keys_str_mv | AT hasrulcheshamsudin afastdiscretegravitationalsearchalgorithm AT addieirawanhashim afastdiscretegravitationalsearchalgorithm AT zuwairieibrahim afastdiscretegravitationalsearchalgorithm AT amarfaizzainalabidin afastdiscretegravitationalsearchalgorithm AT sophanwahyudinawawi afastdiscretegravitationalsearchalgorithm AT muhammadarifabdulrahim afastdiscretegravitationalsearchalgorithm AT kamalkhalil afastdiscretegravitationalsearchalgorithm AT hasrulcheshamsudin fastdiscretegravitationalsearchalgorithm AT addieirawanhashim fastdiscretegravitationalsearchalgorithm AT zuwairieibrahim fastdiscretegravitationalsearchalgorithm AT amarfaizzainalabidin fastdiscretegravitationalsearchalgorithm AT sophanwahyudinawawi fastdiscretegravitationalsearchalgorithm AT muhammadarifabdulrahim fastdiscretegravitationalsearchalgorithm AT kamalkhalil fastdiscretegravitationalsearchalgorithm |