UMP Institutional Repository

Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem

Ismail, Ibrahim and Zuwairie, Ibrahim and Zulkifli, Md. Yusof (2015) Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem. In: 4th International Conference on Software Engineering and Computer Systems, 19-21 August 2015 , Kuantan, Pahang, Malaysia. pp. 142-147..

[img] PDF
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem.pdf
Restricted to Repository staff only

Download (770kB) | Request a copy
[img]
Preview
PDF
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem.pdf - Published Version

Download (35kB) | Preview

Abstract

Gravitational search algorithm swarm (GSA) is a metaheuristic optimization algorithm, which is based on the Newton's law of gravity and the law of motion, has been successfully applied to solve various optimization problems in real-value search space. Later, binary gravitational search algorithm (BGSA) is designed to solve discrete optimization problems. In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. The algorithm operates based on a simplified mechanism of transition between two states. The algorithm able to produce feasible solution in solving traveling salesman problem (TSP), one of the most intensively studied discrete combinatorial optimization problems. To evaluate the performances of the proposed algorithm and the BGSA, several experiments using six sets of selected benchmarks instances of traveling salesman problem (TSP) are conducted. The experimental results showed the newly introduced approach consistently outperformed the BGSA in all TSP benchmark instances used.

Item Type: Conference or Workshop Item (Speech)
Additional Information: ISBN: 978-1-4673-6722-6
Uncontrolled Keywords: component; 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: 28 Jan 2016 07:42
Last Modified: 08 Feb 2018 00:59
URI: http://umpir.ump.edu.my/id/eprint/11826
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item