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 …
State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
A Scholl, C Becker - European Journal of Operational Research, 2006 - Elsevier
The assembly line balancing problem arises and has to be solved when an assembly line
has to be configured or redesigned. It consists of distributing the total workload for …
has to be configured or redesigned. It consists of distributing the total workload for …
Hybridizing exact methods and metaheuristics: A taxonomy
The interest about hybrid optimization methods has grown for the last few years. Indeed,
more and more papers about cooperation between heuristics and exact techniques are …
more and more papers about cooperation between heuristics and exact techniques are …
Ant colony optimization and local search for bin packing and cutting stock problems
Abstract The Bin Packing Problem and the Cutting Stock Problem are two related classes of
NP-hard combinatorial optimization problems. Exact solution methods can only be used for …
NP-hard combinatorial optimization problems. Exact solution methods can only be used for …
A grou** genetic algorithm with controlled gene transmission for the bin packing problem
In this study, the one-dimensional Bin Packing Problem (BPP) is approached. The BPP is a
classical optimization problem that is known for its applicability and complexity. We propose …
classical optimization problem that is known for its applicability and complexity. We propose …
Exact algorithms for energy-efficient virtual machine placement in data centers
C Wei, ZH Hu, YG Wang - Future Generation Computer Systems, 2020 - Elsevier
Virtual machine placement (VMP) and power management are essential topics in the
development of cloud computing and data centers. The assignment of a virtual machine to …
development of cloud computing and data centers. The assignment of a virtual machine to …
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 …
Variable neighborhood search strategies for the order batching problem
Abstract The Order Batching Problem is an optimization problem belonging to the
operational management aspect of a warehouse. It consists of grou** the orders received …
operational management aspect of a warehouse. It consists of grou** the orders received …
Traffic prediction-enabled energy-efficient dynamic computing resource allocation in cran based on deep learning
Y Fu, X Wang - IEEE Open Journal of the Communications …, 2022 - ieeexplore.ieee.org
Due to the greatly increased bandwidth of 5G networks compared with that of 4G networks,
the power consumption brought by baseband signal processing of 5G networks is much …
the power consumption brought by baseband signal processing of 5G networks is much …
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 …