A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing

A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing

Abstract The one-dimensional bin packing problem (1DBPP) is a well-known NP-hard problem in computer science and operations research that involves many real-world applications. Its primary objective is to allocate items into bins while minimizing the number of bins used. Due to the complexity of the...

Full description

Saved in:
Bibliographic Details
Main Authors: Julio Juárez, Jesús Guillermo Falcón-Cardona, José Carlos Ortiz-Bayliss
Format: Article
Language:English
Published: Nature Portfolio 2025-07-01
Series:Scientific Reports
Subjects:
$$\mu$$ genetic algorithms
Hyper-heuristics
Bin packing problem
Online Access:https://doi.org/10.1038/s41598-025-10790-9
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://doi.org/10.1038/s41598-025-10790-9

Similar Items