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.

Details

Title
A Survey on Optimization Algorithms: Challenges and Future Opportunities
Author
Kumar, Subash; Sikander Singh Cheema
Pages
45-51
Section
Articles
Publication year
2024
Publication date
Jan-Feb 2024
Publisher
International Journal of Advanced Research in Computer Science
e-ISSN
09765697
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
3174032476
Copyright
© 2024. This work is published under https://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.