Academic literature on the topic 'GRAVITATIONAL SEARCH ALGORITHM (GSA)'

The optimization of industrial processes is a critical task for leveraging profitability and sustainability. To ensure the selection of optimum process parameter levels in any industrial process, numerous metaheuristic algorithms have been proposed so far. However, many algorithms are either computationally too expensive or become trapped in the pit of local optima. To counter these challenges, in this paper, a hybrid metaheuristic called PSO-GSA is employed that works by combining the iterative improvement capability of particle swarm optimization (PSO) and gravitational search algorithm (GSA). A binary PSO is also fused with GSA to develop a BPSO-GSA algorithm. Both the hybrid algorithms i.e., PSO-GSA and BPSO-GSA, are compared against traditional algorithms, such as tabu search (TS), genetic algorithm (GA), differential evolution (DE), GSA and PSO algorithms. Moreover, another popular hybrid algorithm DE-GA is also used for comparison. Since earlier works have already studied the performance of these algorithms on mathematical benchmark functions, in this paper, two real-world-applicable independent case studies on biodiesel production are considered. Based on the extensive comparisons, significantly better solutions are observed in the PSO-GSA algorithm as compared to the traditional algorithms. The outcomes of this work will be beneficial to similar studies that rely on polynomial models.

This paper presents a review on gravitational search algorithm (GSA). Nowadays, GSA has been used in various engineering studies such as production cost, production time, power consumption and emission. The GSA also mainly focuses to solve the problem related to optimization, modeling, scheduling and clustering. This paper also highlights the current researches using improved GSA.

Gravitational search algorithm (GSA) is a nature-inspired conceptual framework with roots in gravitational kinematics, a branch of physics that models the motion of masses moving under the influence of gravity. In GSA, a collection of objects interacts with each other under the Newtonian gravity and the laws of motion. The performances of objects are measured by masses. All these objects attract each other by the gravity force, while this force causes a global movement of all objects toward the objects with heavier masses. The position of the object corresponds to a solution of the problem. The positions of the objects are updated every iteration and the best fitness along with its corresponding object is stored. Heavier masses move slowly than lighter ones. The algorithm terminates after a specified number of iterations after which the best fitness becomes the global fitness for a particular problem and the positions of the corresponding object becomes the global solution of that problem. This paper presents a review of GSA and its variants.