Biased random-key genetic algorithms: a review

DOI10.1016/J.EJOR.2024.03.030MaRDI QIDQ6982447zbMATH OpenFDO

Authors Mariana A. Londe, Luciana S. Pessoa, Carlos E. Andrade, Mauricio G. C. Resende

Publication date 19 May 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.03.030

zbMATH Keywords

applicationsbiased random-key genetic algorithmsliterature reviewmetaheuristics

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• \({\mathcal Q}\)-learning
• A biased random key genetic algorithm for the field Technician scheduling problem
• A biased random-key genetic algorithm for data clustering
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• A biased random-key genetic algorithm for road congestion minimization
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
• A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
• A biased random-key genetic algorithm for single-round divisible load scheduling
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• A biased random-key genetic algorithm for the chordal completion problem
• A biased random-key genetic algorithm for the container pre-marshalling problem
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• A biased random-key genetic algorithm for the minimization of open stacks problem
• A biased random-key genetic algorithm for the project scheduling problem with flexible resources
• A biased random-key genetic algorithm for the set orienteering problem
• A biased random-key genetic algorithm for the Steiner triple covering problem
• A biased random-key genetic algorithm for the tree of hubs location problem
• A biased random-key genetic algorithm for the unequal area facility layout problem
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
• A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation
• A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem
• A diversity-based genetic algorithm for scenario generation
• A general heuristic for vehicle routing problems
• A genetic algorithm applied to optimal allocation in stratified sampling
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
• A genetic algorithm for the resource constrained multi-project scheduling problem
• A genetic algorithm for the weight setting problem in OSPF routing
• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
• A hybrid biased random key genetic algorithm approach for the unit commitment problem
• A hybrid biased random key genetic algorithm for the quadratic assignment problem
• A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM
• A hybrid genetic algorithm for the job shop scheduling problem
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• A hybrid primal heuristic for finding feasible solutions to mixed integer programs
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
• A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation
• A new load balance methodology for container loading problem in road transportation
• A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
• A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
• A random key based genetic algorithm for the resource constrained project scheduling problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
• Bi-objective scheduling on a restricted batching machine
• Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
• Biased random-key genetic algorithms with applications in telecommunications
• BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
• Flower pollination algorithm for global optimization
• Future paths for integer programming and links to artificial intelligence
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Handbook of heuristics
• Heuristic solutions for general concave minimum cost network flow problems
• Heuristics for a flowshop scheduling problem with stepwise job objective function
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 3225500 (Why is no real title available?)
• Hybrid algorithms for placement of virtual machines across geo-separated data centers
• Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• Improved heuristics for the regenerator location problem
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
• Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks
• Metaheuristics based on decision hierarchies for the traveling purchaser problem
• Methods for solving road network problems with disruptions
• Model and methods to address urban road network problems with disruptions
• Near-optimal disjoint-path facility location through set cover by pairs
• On the minimization of traffic congestion in road networks with tolls
• Optimal configuration of power distribution networks with variable renewable energy resources
• Randomized heuristics for the family traveling salesperson problem
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Survivable IP network design with OSPF routing
• The dial-a-ride problem with private fleet and common carrier
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints
• The effective BRKGA algorithm for the k-medoids clustering problem
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
• Vehicle routing problem considering equity of demand satisfaction

Cited in

(3)

• Random-key optimizer with reinforcement learning for the capacitated multi-period cutting stock problem with setup cost
• The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
• A multi-stage approach for root sequence index allocation

This page was built for publication: Biased random-key genetic algorithms: a review

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982447)