Finding Global Optimal Solution by a Robust Quadratic Approximation Hybridized Genetic Algorithm

The present study proposes a novel approach for finding the global optimal solution in complex optimization problems. The proposed method combines a robust quadratic approximation technique with a genetic algorithm to enhance the efficiency and accuracy. Extensive experiments on a set of benchmark o...

Full description

Saved in:
Bibliographic Details
Published in2024 IEEE AITU: Digital Generation pp. 71 - 75
Main Authors Saha, Ranjini, Das, Kedar Nath, Mehrotra, Richa
Format Conference Proceeding
LanguageEnglish
Published IEEE 03.04.2024
Subjects
Accuracy
Approximation algorithms
benchmark problems
Benchmark testing
Estimation
genetic algorithm
Genetics
global optimal solution
hybrid genetic algorithm
quadratic approximation
Robustness
Scalability
Online AccessGet full text
DOI10.1109/IEEECONF61558.2024.10585364

Cover

More Information
Summary:The present study proposes a novel approach for finding the global optimal solution in complex optimization problems. The proposed method combines a robust quadratic approximation technique with a genetic algorithm to enhance the efficiency and accuracy. Extensive experiments on a set of benchmark optimization problems have been used to demonstrate the fact that the hybridized genetic algorithm reliably beats traditional genetic algorithm. The main idea is to avoid getting trapped into local optima during simulation. The ability to overcome local optima and find the global optimal solution offers opportunities for a wide range of applications. Further, we study the application of this method in real world problems and look into its scalability and robustness by comparing the results of genetic algorithm (GA), hybrid genetic algorithm (GA-Q) and hybrid genetic firefly algorithm (H-GA-FA).
DOI:10.1109/IEEECONF61558.2024.10585364