Bin packing and cutting stock problems: Mathematical models and exact algorithms
We review the most important mathematical models and algorithms developed for the exact
solution of the one-dimensional bin packing and cutting stock problems, and experimentally …
solution of the one-dimensional bin packing and cutting stock problems, and experimentally …
Variation operators for grou** genetic algorithms: A review
O Ramos-Figueroa, M Quiroz-Castellanos… - Swarm and Evolutionary …, 2021 - Elsevier
Grou** problems are combinatorial optimization problems, most of them NP-hard, related
to the partition of a set of items into different groups or clusters. Given their numerous real …
to the partition of a set of items into different groups or clusters. Given their numerous real …
[HTML][HTML] Unsupervised feature selection algorithm for multiclass cancer classification of gene expression RNA-Seq data
This paper presents a Grou** Genetic Algorithm (GGA) to solve a maximally diverse
grou** problem. It has been applied for the classification of an unbalanced database of …
grou** problem. It has been applied for the classification of an unbalanced database of …
Metaheuristics to solve grou** problems: A review and a case study
O Ramos-Figueroa, M Quiroz-Castellanos… - Swarm and Evolutionary …, 2020 - Elsevier
Grou** problems are a special type of combinatorial optimization problems that have
gained great relevance because of their numerous real-world applications. The solution …
gained great relevance because of their numerous real-world applications. The solution …
Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications
C Munien, AE Ezugwu - Journal of Intelligent Systems, 2021 - degruyter.com
The bin-packing problem (BPP) is an age-old NP-hard combinatorial optimization problem,
which is defined as the placement of a set of different-sized items into identical bins such …
which is defined as the placement of a set of different-sized items into identical bins such …
Multi-capacity combinatorial ordering GA in application to cloud resources allocation and efficient virtual machines consolidation
This paper describes a novel approach making use of genetic algorithms to find optimal
solutions for multi-dimensional vector bin packing problems with the goal to improve cloud …
solutions for multi-dimensional vector bin packing problems with the goal to improve cloud …
Reinforcement learning based local search for grou** problems: A case study on graph coloring
Grou** problems aim to partition a set of items into multiple mutually disjoint subsets
according to some specific criterion and constraints. Grou** problems cover a large class …
according to some specific criterion and constraints. Grou** problems cover a large class …
Cooperative parallel grou** genetic algorithm for the one-dimensional bin packing problem
T Kucukyilmaz, HE Kiziloz - Computers & Industrial Engineering, 2018 - Elsevier
Evolutionary algorithms have been reported to be efficient metaheuristics for the
optimization of several NP-Hard combinatorial optimization problems. In addition to their …
optimization of several NP-Hard combinatorial optimization problems. In addition to their …
A variable neighborhood search algorithm for the bin packing problem with compatible categories
LFOM Santos, RS Iwayama, LB Cavalcanti… - Expert Systems with …, 2019 - Elsevier
In this paper, we address the Bin Packing Problem with Compatible Categories (BPCC), a
challenging optimization problem that arises in the context of last mile distribution to …
challenging optimization problem that arises in the context of last mile distribution to …
Genetic algorithm for scheduling optimization considering heterogeneous containers: A real-world case study
In this paper, we develop and apply a genetic algorithm to solve surgery scheduling cases in
a Mexican Public Hospital. Here, one of the most challenging issues is to process containers …
a Mexican Public Hospital. Here, one of the most challenging issues is to process containers …