Novel Heuristic Algorithm & its Application for Reliability Optimization

Heuristic algorithms are practical, easy to implement, and work fast to provide short-term, feasible solutions for any kind of problem within economical budgets as compared to other meta-heuristic algorithms. This paper presents a novel heuristic algorithm named the Dahiya-Garg Heuristic Algorithm (...

Full description

Bibliographic Details
Main Authors: Tripti Dahiya, Nakul Vashishth, Deepika Garg, Avinash K. Shrivastava, P. K. Kapur
Format: Article
Language:English
Published: Ram Arti Publishers 2023-08-01
Series:International Journal of Mathematical, Engineering and Management Sciences
Subjects:
Online Access:https://www.ijmems.in/article_detail.php?vid=8&issue_id=39&article_id=514
Description
Summary:Heuristic algorithms are practical, easy to implement, and work fast to provide short-term, feasible solutions for any kind of problem within economical budgets as compared to other meta-heuristic algorithms. This paper presents a novel heuristic algorithm named the Dahiya-Garg Heuristic Algorithm (DG-Alg) to find the optimal solution for constrained reliability redundancy allocation optimization problems. The cornerstone of the novel DG-Alg is its novel selection factor, which is a mathematical formula that helps the heuristic algorithm search for optimal subsystems for reliability optimization. A novel formulated selection factor in DG-Alg has increased its effectiveness and efficiency. To analyze the performance of the proposed heuristic algorithm and the other three existing heuristic algorithms, they are applied to a problem taken from a pharmaceutical manufacturing plant named Yaris Pharmaceuticals. During the application of the heuristic algorithms, it was ensured that redundancy allocation was done within stipulated cost constraints. Further, a comparative analysis of the obtained results has been done to judge the performance of the proposed heuristic algorithm. It is deduced that the proposed heuristic algorithm gives optimized and computationally efficient results in comparison to the other existing heuristic algorithms.
ISSN:2455-7749