Biased random-key genetic algorithms: A review

被引:11
作者
Londe, Mariana A. [1 ]
Pessoa, Luciana S. [1 ]
Andrade, Carlos E. [2 ]
Resende, Mauricio G. C. [3 ]
机构
[1] Pontificia Univ Catolica Rio de Janeiro, Dept Ind Engn, Rua Marques de Sao Vicente 225, BR-22453900 Rio de Janeiro, RJ, Brazil
[2] AT&T Labs Res, 200 South Laurel Ave, Middletown, NJ 07748 USA
[3] Univ Washington, Ind & Syst Engn, 3900 E Stevens Way NE, Seattle, WA 98195 USA
关键词
Biased random-key genetic algorithms; Literature review; Metaheuristics; Applications; FLOWSHOP SCHEDULING PROBLEM; BATCH-PROCESSING MACHINE; WEIGHT SETTING PROBLEM; LOCAL SEARCH; GLOBAL OPTIMIZATION; MAXIMUM LATENESS; BERTH ALLOCATION; HEURISTICS; ASSIGNMENT; NETWORKS;
D O I
10.1016/j.ejor.2024.03.030
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. We also detail challenges and future directions for this method. Overall, this survey provides a comprehensive overview of the BRKGA metaheuristic and its applications and highlights important areas for future research.
引用
收藏
页码:1 / 22
页数:22
相关论文
共 215 条
[1]   A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization [J].
Abreu, Levi R. ;
Tavares-Neto, Roberto F. ;
Nagano, Marcelo S. .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 104
[2]  
Ahmed ZH, 2020, INT J ADV COMPUT SC, V11, P317
[3]   A GRAPHICAL APPROACH TO PRODUCTION SCHEDULING PROBLEMS [J].
AKERS, SB .
OPERATIONS RESEARCH, 1956, 4 (02) :244-245
[4]   Comparative study of crossover operators for the MTSP [J].
Al-Omeer, Maha Ata ;
Ahmed, Zakir Hussain .
2019 INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCES (ICCIS), 2019, :173-178
[5]   A biased random-key genetic algorithm for the project scheduling problem with flexible resources [J].
Almeida, Bernardo F. ;
Correia, Isabel ;
Saldanha-da-Gama, Francisco .
TOP, 2018, 26 (02) :283-308
[6]   Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem [J].
Amaro Jr, Bonfim ;
de Carvalho, Guilherme Nepomuceno ;
Santos, Marcio Costa ;
Pinheio, Placido Rogerio ;
Celedonio, Joao Willian Lemos .
APPLIED SCIENCES-BASEL, 2023, 13 (18)
[7]   Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds [J].
Amaro Junior, Bonfim ;
Santos, Marcio Costa ;
de Carvalho, Guilherme Nepomuceno ;
de Araujo, Luiz Jonata Pires ;
Pinheiro, Placido Rogerio .
ALGORITHMS, 2021, 14 (11)
[8]   A Parallel Biased Random-Key Genetic Algorithm with Multiple Populations Applied to Irregular Strip Packing Problems [J].
Amaro Junior, Bonfim ;
Pinheiro, Placido Rogerio ;
Coelho, Pedro Veras .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017
[9]   The Physical Cell Identity Assignment Problem: A Practical Optimization Approach [J].
Andrade, Carlos E. ;
Pessoa, Luciana S. ;
Stawiarski, Slawomir .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024, 28 (02) :282-292
[10]   The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications [J].
Andrade, Carlos E. ;
Toso, Rodrigo F. ;
Goncalves, Jose F. ;
Resende, Mauricio G. C. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (01) :17-30