Pervasive Digital Twin for PI-Containers: A New Packing Problem [PDF]
The idea defended in this paper consists in finding, at any time and everywhere, the arrangement of containers within a composite container. The digital image of the real arrangement obtained defines its digital twin.
Patrick Charpentier +4 more
doaj +2 more sources
An efficient constructive heuristic for the rectangular packing problem with rotations. [PDF]
The rectangular packing problem has been extensively studied over the years due to its wide application in industry. However, most of the research efforts are devoted to positioning techniques of the rectangles for various problem variants, the efficient
Xusheng Zhao +5 more
doaj +2 more sources
Hybrid approach for solving real-world bin packing problem instances using quantum annealers [PDF]
Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have
Sebastián V. Romero +4 more
doaj +2 more sources
A new approach for bin packing problem using knowledge reuse and improved heuristic [PDF]
The two-dimensional (2D) irregular packing problem is a combinatorial optimization problem with NP-complete characteristics, which is common in the production process of clothing, ships, and plate metals.
Jie Fang +4 more
doaj +2 more sources
Optimizing e-commerce warehousing through open dimension management in a three-dimensional bin packing system [PDF]
In the field of e-commerce warehousing, maximizing the utilization of packing bins is a fundamental goal for all major logistics enterprises. However, determining the appropriate size of packing bins poses a practical challenge for many logistics ...
Jianglong Yang +6 more
doaj +2 more sources
Connected bin packing problem on traceable graphs [PDF]
We consider a new extension of the bin packing problem in which a set of connectivity constraints should be satisfied. An undirected graph with a weight function on the nodes is given.
A. Nejoomi, A. Dolati
doaj +1 more source
Kernelization of Packing Problems [PDF]
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size at least k in a given d-uniform hypergraph and has kernels with O(k^d) edges. Bodlaender et al.
Holger Dell, Dániel Marx
openaire +2 more sources
Packing Graphs: The Packing Problem Solved [PDF]
For every fixed graph $H$, we determine the $H$-packing number of $K_n$, for all $n > n_0(H)$. We prove that if $h$ is the number of edges of $H$, and $gcd(H)=d$ is the greatest common divisor of the degrees of $H$, then there exists $n_0=n_0(H)$, such that for all $n > n_0$, $$ P(H,K_n)=\lfloor {{dn}\over{2h}} \lfloor {{n-1}\over{d}} \rfloor ...
Yair Caro, Raphael Yuster
openaire +2 more sources
Harmony search algorithm with adaptive parameter setting for solving large bin packing problems [PDF]
Bin packing problem is a constrained optimization problem with a huge search space due to large combinations. Bin packing problem has a wide range of applications in multiple fields.
Amol C. Adamuthe , Tushar Nitave
doaj +1 more source
Mosaic Packing to Visualize Large-Scale Electric Grid Data
For large power systems, a continual challenge is to display wide-area data in a way that maximizes human users’ situational awareness. This paper describes a new visualization technique that draws a mosaic of colored tiles to represent multiple ...
Adam B. Birchfield, Thomas J. Overbye
doaj +1 more source

