Comparison of the Meta-Heuristic Algorithms for Maximum Likelihood Estimation of the Exponentially Modified Logistic Distribution


Kasap P., Faouri A. O.

SYMMETRY-BASEL, vol.16, no.3, 2024 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 16 Issue: 3
  • Publication Date: 2024
  • Doi Number: 10.3390/sym16030259
  • Journal Name: SYMMETRY-BASEL
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Communication Abstracts, INSPEC, Metadex, zbMATH, Directory of Open Access Journals, Civil Engineering Abstracts
  • Ondokuz Mayıs University Affiliated: Yes

Abstract

Generalized distributions have been studied a lot recently because of their flexibility and reliability in modeling lifetime data. The two-parameter Exponentially-Modified Logistic distribution is a flexible modified distribution that was introduced in 2018. It is regarded as a strong competitor for widely used classical symmetrical and non-symmetrical distributions such as normal, logistic, lognormal, log-logistic, and others. In this study, the unknown parameters of the Exponentially-Modified Logistic distribution are estimated using the maximum likelihood method. Five meta-heuristic algorithms, including the genetic algorithm, particle swarm optimization algorithm, grey wolf optimization algorithm, whale optimization algorithm, and sine cosine algorithm, are applied in order to solve the nonlinear likelihood equations of the study model. The efficiencies of all maximum likelihood estimates for these algorithms are compared via an extensive Monte Carlo simulation study. The performance of the maximum likelihood estimates for the location and scale parameters of the Exponentially-Modified Logistic distribution developed with the genetic algorithm and grey wolf optimization algorithms is the most efficient among others, according to simulation findings. However, the genetic algorithm is two times faster than grey wolf optimization and can be considered better than grey wolf optimization considering the computation time criterion. Six real datasets are analyzed to show the flexibility of this distribution.