A fast discrete gravitational search algorithm

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

A fast discrete gravitational search algorithm.pdf

Download (272kB) | Preview


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.

Item Type: Conference or Workshop Item (Lecture)
Additional Information: Indexed by Scopus
Uncontrolled Keywords: GSA; discrete optimization; FGSA
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Faculty/Division: Faculty of Electrical & Electronic Engineering
Institute of Postgraduate Studies
Depositing User: Mrs. Neng Sury Sulaiman
Date Deposited: 22 Mar 2020 23:00
Last Modified: 07 Sep 2020 08:39
URI: http://umpir.ump.edu.my/id/eprint/26985
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item