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 条
[91]   Biased random-key genetic algorithms for combinatorial optimization [J].
Goncalves, Jose Fernando ;
Resende, Mauricio G. C. .
JOURNAL OF HEURISTICS, 2011, 17 (05) :487-525
[92]   A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem [J].
Goncalves, Jose Fernando ;
Resende, Mauricio G. C. .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (02) :180-201
[93]   A genetic algorithm for lot sizing and scheduling under capacity constraints and allowing backorders [J].
Goncalves, Jose Fernando ;
Sousa, Paulo S. A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (09) :2683-2703
[94]   On the improvement of blood sample collection at clinical laboratories [J].
Grasas, Alex ;
Ramalhinho, Helena ;
Pessoa, Luciana S. ;
Resende, Mauricio G. C. ;
Caballe, Imma ;
Barba, Nuria .
BMC HEALTH SERVICES RESEARCH, 2014, 14
[95]  
Hansen P., 2005, VARIABLE NEIGHBORHOO, P211, DOI DOI 10.1007/0-387-28356-08
[96]   Order acceptance and scheduling with sequence-dependent setup times: A new memetic algorithm and benchmark of the state of the art [J].
He, Lei ;
Guijt, Arthur ;
de Weerdt, Mathijs ;
Xing, Lining ;
Yorke-Smith, Neil .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 138
[97]   A cloud brokerage approach for solving the resource management problem in multi-cloud environments [J].
Heilig, Leonard ;
Lalla-Ruiz, Eduardo ;
Voss, Stefan .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 95 :16-26
[98]  
Holland J. H., 1992, ADAPTATION NATURAL A
[99]   A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation [J].
Homayouni, S. Mahdi ;
Fontes, Dalila B. M. M. ;
Goncalves, Jose F. .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2023, 30 (02) :688-716
[100]   A biased random-key genetic algorithm for the container pre-marshalling problem [J].
Hottung, Andre ;
Tierney, Kevin .
COMPUTERS & OPERATIONS RESEARCH, 2016, 75 :83-102