A Survey of League Championship Algorithm: Prospects and Challenges

TL;DR

This survey reviews the development, applications, and challenges of the sport-inspired League Championship Algorithm (LCA), highlighting its potential in solving complex optimization problems and guiding future research directions.

Contribution

It systematically categorizes LCA research literature, analyzes its prospects and challenges, and provides a foundation for future studies in the field.

Findings

LCA has shown effectiveness in solving NP-complete problems.

Research interest in LCA has grown across multiple disciplines.

The survey identifies key challenges and future prospects for LCA.

Abstract

The League Championship Algorithm (LCA) is sport-inspired optimization algorithm that was introduced by Ali Husseinzadeh Kashan in the year 2009. It has since drawn enormous interest among the researchers because of its potential efficiency in solving many optimization problems and real-world applications. The LCA has also shown great potentials in solving non-deterministic polynomial time (NP-complete) problems. This survey presents a brief synopsis of the LCA literatures in peer-reviewed journals, conferences and book chapters. These research articles are then categorized according to indexing in the major academic databases (Web of Science, Scopus, IEEE Xplore and the Google Scholar). The analysis was also done to explore the prospects and the challenges of the algorithm and its acceptability among researchers. This systematic categorization can be used as a basis for future studies.