A Survey on Optimization Algorithms: Challenges and Future Opportunities

  • Kumar S
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This paper conducts a comprehensive exploration of contemporary optimization algorithms, addressing challenges and outlining potential avenues for future research. The survey encompasses a wide spectrum of optimization techniques employed in various domains, ranging from mathematical programming to machine learning and artificial intelligence. It systematically analyses the inherent challenges faced by existing algorithms, including scalability issues, convergence speed, and adaptability to diverse problem spaces. Furthermore, the paper critically examines the impact of optimization algorithms on real-world applications, considering their effectiveness and limitations. The survey identifies emerging trends, such as hybrid approaches and metaheuristic methods that offer promising directions for overcoming current challenges. By synthesizing the state-of-the-art in optimization algorithms, this paper provides a valuable resource for researchers, practitioners, and decision-makers, guiding them towards addressing existing limitations and unlocking new opportunities in the evolving landscape of optimization research.

Cite

CITATION STYLE

APA

Kumar, S. (2024). A Survey on Optimization Algorithms: Challenges and Future Opportunities. International Journal of Advanced Research in Computer Science, 15(1), 45–51. https://doi.org/10.26483/ijarcs.v15i1.7037

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free