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 …

Abstract The Order Acceptance and Scheduling (OAS) problem describes a class of real-
world problems such as in smart manufacturing and satellite scheduling. This problem …

In this paper, we advance the state of the art for solving the Permutation Flowshop
Scheduling Problem with total flowtime minimization. For this purpose, we propose a Biased …

This paper proposes an adaptive Biased Random-key Genetic Algorithm (A-BRKGA), a new
method with on-line parameter control for combinatorial optimization problems. A-BRKGA …

This paper addresses the Family Traveling Salesman Problem (FTSP), a variant of the
Traveling Salesman Problem that group nodes into families. The goal is to select the best …

The Biased Random-Key Genetic Algorithm (BRKGA) is an efficient metaheuristic to solve
combinatorial optimization problems but requires parameter tuning so the intensification and …

In mobile wireless networks, the Root Sequence Index (RSI) is used to allocate uplink
channels between the user equipment and the base station. The assignment of RSIs close …

Efficiently cutting smaller two-dimensional parts from a larger surface area is a recurring
challenge in many manufacturing environments. This point falls under the cut-and-pack …

Abstract The classic Traveling Salesman Problem (TSP) only considers the costs involved in
the routes and does not differentiate products or customers. Logistic companies face conflict …

Molecular docking is a valuable tool for drug discovery. Receptor and flexible Ligand
docking is a very computationally expensive process due to a large number of degrees of …