Biased Random-Key Genetic Algorithms: A Review

Abstract

This paper is a comprehensive literature review of Biased Random-Key Genetic Algorithms (BRKGA). BRKGA is a metaheuristic that employs random-key-based chromosomes with biased, uniform, and elitist mating strategies in a genetic algorithm framework. The review encompasses over 150 papers with a wide range of applications, including classical combinatorial optimization problems, real-world industrial use cases, and non-orthodox applications such as neural network hyperparameter tuning in machine learning. Scheduling is by far the most prevalent application area in this review, followed by network design and location problems. The most frequent hybridization method employed is local search, and new features aim to increase population diversity. Overall, this survey provides a comprehensive overview of the BRKGA metaheuristic and its applications and highlights important areas for future research.

arXiv comment52 pages, 6 figures

References in corpus (5)

• Near linear time algorithm to detect community structures in large-scale networks
• The Journal Coverage of Web of Science, Scopus and Dimensions: A Comparative Analysis
• Simple heuristics for the assembly line worker assignment and balancing problem
• Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art
• A Population-based Hybrid Approach to Hyperparameter Optimization for Neural Networks

Cited by in corpus (5)

• Towards net-zero manufacturing: carbon-aware scheduling for GHG emissions reduction
• Large Language Models for Combinatorial Optimization: A Systematic Review
• Early years of Biased Random-Key Genetic Algorithms: A systematic review
• A Random-Key Optimizer for Combinatorial Optimization
• Random-key genetic algorithms: Principles and applications