[HTML][HTML] Hyper-heuristics: A survey and taxonomy
Hyper-heuristics are search techniques for selecting, generating, and sequencing (meta)-
heuristics to solve challenging optimization problems. They differ from traditional (meta) …
heuristics to solve challenging optimization problems. They differ from traditional (meta) …
Two-dimensional irregular packing problems: A review
B Guo, Y Zhang, J Hu, J Li, F Wu, Q Peng… - Frontiers in Mechanical …, 2022 - frontiersin.org
Two-dimensional (2D) irregular packing problems are widespread in manufacturing
industries such as shipbuilding, metalworking, automotive production, aerospace, clothing …
industries such as shipbuilding, metalworking, automotive production, aerospace, clothing …
Artificial bee colony optimization for the quadratic assignment problem
Abstract We propose hybrid Artificial Bee Colony (ABC) optimization algorithms for the well-
known Quadratic Assignment Problem (QAP). Large problem instances of the QAP are still …
known Quadratic Assignment Problem (QAP). Large problem instances of the QAP are still …
[HTML][HTML] Unsupervised feature selection algorithm for multiclass cancer classification of gene expression RNA-Seq data
This paper presents a Grouping Genetic Algorithm (GGA) to solve a maximally diverse
grouping problem. It has been applied for the classification of an unbalanced database of …
grouping problem. It has been applied for the classification of an unbalanced database of …
Metaheuristics to solve grouping problems: A review and a case study
O Ramos-Figueroa, M Quiroz-Castellanos… - Swarm and Evolutionary …, 2020 - Elsevier
Grouping 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 …
Variation operators for grouping genetic algorithms: A review
O Ramos-Figueroa, M Quiroz-Castellanos… - Swarm and Evolutionary …, 2021 - Elsevier
Grouping 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 …
An adaptive fitness-dependent optimizer for the one-dimensional bin packing problem
DS Abdul-Minaam, WMES Al-Mutairi, MA Awad… - IEEE …, 2020 - ieeexplore.ieee.org
In recent years, the one-dimensional bin packing problem (1D-BPP) has become one of the
most famous combinatorial optimization problems. The 1D-BPP is a robust NP-hard problem …
most famous combinatorial optimization problems. The 1D-BPP is a robust NP-hard problem …
A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem
WH El-Ashmawi, DS Abd Elminaam - Applied Soft Computing, 2019 - Elsevier
Abstract Bin Packing Problem (BPP) is one of the main optimization problems in which a set
of items of known sizes should be packed into a minimum number of bins. In which the total …
of items of known sizes should be packed into a minimum number of bins. In which the total …
Hybrid quantum-classical heuristic for the bin packing problem
Optimization problems is one of the most challenging applications of quantum computers, as
well as one of the most relevants. As a consequence, it has attracted huge efforts to obtain a …
well as one of the most relevants. As a consequence, it has attracted huge efforts to obtain a …
Learning to multi-vehicle cooperative bin packing problem via sequence-to-sequence policy network with deep reinforcement learning model
R Tian, C Kang, J Bi, Z Ma, Y Liu, S Yang… - Computers & Industrial …, 2023 - Elsevier
In the logistics bin packing scenario with only rear bin doors, the packing sequence of items
determines the utilization of vehicle packing space, but there is relatively little research on …
determines the utilization of vehicle packing space, but there is relatively little research on …