A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility

0Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

As a famous population-based metaheuristic algorithm, a genetic algorithm can be used to overcome optimization complexities. A genetic algorithm adopts probabilistic transition rules and is suitable for parallelism, which makes this algorithm attractive in many areas, including the logistics and supply chain sector. To obtain a comprehensive understanding of the development in this area, this paper presents a bibliometric analysis on the application of a genetic algorithm in logistics and supply chains using data from 1991 to 2024 from the Web of Science database. The authors found a growing trend in the number of publications and citations over the years. This paper serves as an important reference to researchers by highlighting important research areas, such as multi-objective optimization, metaheuristics, sustainability issues in logistics, and machine learning integration. This bibliometric analysis also underlines the importance of Non-Dominated Sorting Genetic Algorithm II (NSGA-II), sustainability, machine learning, and variable neighborhood search in the application of a genetic algorithm in logistics and supply chains in the near future. The integration of a genetic algorithm with machine learning is also a potential research gap to be filled to overcome the limitations of genetic algorithms, such as the long computational time, difficulties in obtaining optimal solutions, and convergence issues for application in logistics and supply chains.

Cite

CITATION STYLE

APA

Lam, W. H., Lam, W. S., & Lee, P. F. (2024). A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility. Mathematics, 12(8). https://doi.org/10.3390/math12081199

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