G
G. S. Mahapatra
Researcher at National Institute of Technology, Puducherry
Publications - 106
Citations - 1618
G. S. Mahapatra is an academic researcher from National Institute of Technology, Puducherry. The author has contributed to research in topics: Fuzzy logic & Computer science. The author has an hindex of 20, co-authored 82 publications receiving 1228 citations. Previous affiliations of G. S. Mahapatra include Siliguri Institute of Technology & Indian Institute of Engineering Science and Technology, Shibpur.
Papers
More filters
Journal ArticleDOI
A mathematical model of a prey-predator type fishery in the presence of toxicity with fuzzy optimal harvesting
Journal ArticleDOI
Global stability and analysing the sensitivity of parameters of a multiple-susceptible population model of SARS-CoV-2 emphasising vaccination drive
P. K. Santra,G. S. Mahapatra +1 more
TL;DR: In this paper , the dynamics of a COVID-19 epidemic in multiple susceptible populations, including the various stages of vaccination administration, were explored, and the conditions determining disease persistence were obtained.
Proceedings ArticleDOI
Fear effect on a discrete-time prey predator model with imprecise biological parameters
TL;DR: In this paper, the authors studied the dynamical properties of a discrete time prey predator model under imprecise biological parameters and obtained the equilibria of the model and the dynamic behaviors of the proposed system are examined.
Proceedings ArticleDOI
A Single Change Point Hazard Rate Software Reliability Model with Imperfect Debugging
Pooja Rani,G. S. Mahapatra +1 more
TL;DR: A hazard rate model based on the widely studied Jelinski-Moranda model is developed, introducing two additional parameters, namely an imperfect debugging parameter and a single change point parameters, which are compared with simpler models to show these additional parameters are justifiable.
Journal ArticleDOI
A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem
TL;DR: This paper presents a modified form of the basic ACO algorithm, obtained by introducing a new operation known as restoring operation for solving the SCTSP problem, where the low-quality path/solution given by any ant is replaced by a nearest better solution.