Rule-based multi-state gravitational search algorithm for discrete optimization problem (original) (raw)
2015, 2015 4th International Conference on Software Engineering and Computer Systems (ICSECS)
AI-generated Abstract
This paper presents a rule-based multi-state gravitational search algorithm designed specifically to tackle discrete optimization problems. The proposed algorithm leverages principles from Newtonian gravitational laws and integrates rule-based mechanisms to enhance solution exploration and exploitation capabilities. Experimental results demonstrate the algorithm's effectiveness and superior performance compared to traditional optimization approaches, making it a promising tool for various applications in discrete optimization.
Related papers
A Novel Multi-State Gravitational Search Algorithm for Discrete Optimization Problems
International Journal of Simulation Systems Science & Technology
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.
A Modified Gravitational Search Algorithm for Discrete Optimization Problem
This paper presents a modified Gravitational Search Algorithm (GSA) called Discrete Gravitational Search Algorithm (DGSA) for discrete optimization problems. In DGSA, 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 are used to evaluate the performance of the proposed DGSA. The experimental result shows that the FDGSA able to find better solutions and converges faster compared to the Binary Gravitational Search Algorithm.
A discrete gravitational search algorithm for solving combinatorial optimization problems
Information Sciences, 2014
Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The Gravitational Search Algorithm (GSA) is a stochastic population-based metaheuristic that was originally designed for solving continuous optimization problems. It has a flexible and well-balanced mechanism for enhancing exploration and exploitation abilities. In this paper, a Discrete Gravitational Search Algorithm (DGSA) is proposed to solve combinatorial optimization problems. The proposed DGSA uses a Path Re-linking (PR) strategy instead of the classic way in which the agents of GSA usually move from their current position to the position of other agents. The proposed algorithm was tested on a set of 54 Euclidean benchmark instances of TSP with sizes ranging from 51 to 2392 nodes. The results were satisfactory and in the majority of the instances, the results were equal to the best known solution. The proposed algorithm ranked ninth when compared with 54 different algorithms with regard to quality of the solution.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.