Quasi-Packing Different Spheres with Ratio Conditions in a Spherical Container by Andreas Fischer, Igor Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov

“…A nonlinear mixed-integer optimization model is proposed for this ratio quasi-packing problem. A heuristic algorithm is developed that reduces the original problem to a sequence of continuous open dimension problems for quasi-packing scaled spheres. …”
Get full text

Packing Spheres into a Minimum-Height Parabolic Container by Yuriy Stoyan, Georgiy Yaskov, Tetyana Romanova, Igor Litvinchev, José Manuel Velarde Cantú, Mauricio López Acosta

“…A nonlinear programming model for the packing problem is provided. A solution algorithm based on the feasible directions approach and a decomposition technique is proposed. …”
Get full text

Evaluating virtual machine allocation in clouds by Chen, Yifan

“…This problem can be broken down as a bin packing problem. The objective of this project is to analyse the performance of the Robust and Consistent Packing (RCP) algorithm that is developed by Mozhengfu Liu and Xueyan Tang.…”
Get full text

Online Three-Dimensional Bin Packing: A DRL Algorithm with the Buffer Zone by Zhang Jiawei, Shuai Tianping

“…The online 3D bin packing problem(3D-BPP) is widely used in the logistics industry and is of great practical significance for promoting the intelligent transformation of the industry. …”
Get full text

Deep reinforcement learning-based resource reservation algorithm for emergency Internet-of-things slice by Guolin SUN, Ruijie OU, Guisong LIU

“…Based on the requirements of ultra-low latency services for emergency Internet-of-things (EIoT) applications,a multi-slice network architecture for ultra-low latency emergency IoT was designed,and a general methodology framework based on resource reservation,sharing and isolation for multiple slices was proposed.In the proposed framework,real-time and automatic inter-slice resource demand prediction and allocation were realized based on deep reinforcement learning (DRL),while intra-slice user resource allocation was modeled as a shape-based 2-dimension packing problem and solved with a heuristic numerical algorithm,so that intra-slice resource customization was achieved.Simulation results show that the resource reservation-based method enable EIoT slices to explicitly reserve resources,provide a better security isolation level,and DRL could guarantee accuracy and real-time updates of resource reservations.Compared with four existing algorithms,dueling deep Q-network (DQN) performes better than the benchmarks.…”
Get full text

Deep reinforcement learning-based resource reservation algorithm for emergency Internet-of-things slice by Guolin SUN, Ruijie OU, Guisong LIU

“…Based on the requirements of ultra-low latency services for emergency Internet-of-things (EIoT) applications,a multi-slice network architecture for ultra-low latency emergency IoT was designed,and a general methodology framework based on resource reservation,sharing and isolation for multiple slices was proposed.In the proposed framework,real-time and automatic inter-slice resource demand prediction and allocation were realized based on deep reinforcement learning (DRL),while intra-slice user resource allocation was modeled as a shape-based 2-dimension packing problem and solved with a heuristic numerical algorithm,so that intra-slice resource customization was achieved.Simulation results show that the resource reservation-based method enable EIoT slices to explicitly reserve resources,provide a better security isolation level,and DRL could guarantee accuracy and real-time updates of resource reservations.Compared with four existing algorithms,dueling deep Q-network (DQN) performes better than the benchmarks.…”
Get full text

Valid Inequalities and Facets of the Capacitated Plant Location Problem by Leung, Janny M. Y., Magnanti, Thomas L.

“…We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope.…”
Get full text

Molecular Occupancy of Nanodot Arrays by Cai, H, Wolfenson, H, Depoil, D, Dustin, M, Sheetz, M, Wind, S

“…We found that the occupancy can be interpreted as a packing problem, and depends on nanodot size and binding ligand concentration, where the latter is easily adjusted to compensate the flexibility of dimension control in nanofabrication. …”

Asymmetric equilibria of two nested elastic rings by Lombardo, F, Goriely, A, Napoli, G

“…To address this problem, we consider the simplest possible packing problem of a thin elastic ring confined within another shorter flexible ring. …”

Molecular occupancy of nanodot arrays by Cai, H, Wolfenson, H, Depoil, D, Dustin, M, Sheetz, M, Wind, S

“…We found that the occupancy can be interpreted as a packing problem, and depends on nanodot size and binding ligand concentration, where the latter is easily adjusted to compensate the flexibility of dimension control in nanofabrication. …”

Online Bandwidth packing with symmetric distribution by Marc Lelarge

“…Our analysis shows connections between our dynamic model, average-case results on the classical bin packing problem and planar matching problems.…”
Get full text

Polynomiality for Bin Packing with a Constant Number of Item Types by Goemans, Michel X, Rothvoss, Thomas

“…We consider the bin packing problem with d different item sizes si and item multiplicities ai, where all numbers are given in binary encoding. …”
Get full text

Polynomiality for Bin Packing with a Constant Number of Item Types by Goemans, Michel X., Rothvoss, Thomas

“…We consider the bin packing problem with d different item sizes si and item multiplicities ai, where all numbers are given in binary encoding. …”
Get full text

Polynomiality for Bin Packing with a Constant Number of Item Types by Goemans, Michel X., Rothvoss, Thomas

“…We consider the bin packing problem with d different item sizes si and item multiplicities ai, where all numbers are given in binary encoding. …”
Get full text
Get full text

Axle Weights in combined Vehicle Routing and Container Loading Problems by Corinna Krebs, Jan Fabian Ehmke

“…A hybrid heuristic approach is used where an outer Adaptive Large Neighbourhood Search tackles the routing problem and an inner Deepest-Bottom-Left-Fill algorithm solves the packing problem. Moreover, to ensure feasibility, we show that the Axle Weight Constraint must be checked after each placement of an item. …”
Get full text

Installation of Smog-Free Towers Using Novel Real Coded Genetic Algorithm by Yogesh Kumar, Kusum Deep, Atulya K. Nagar

“…The circle packing problem involves finding the best way to place non-overlapping circles within a given space, while the smog-free tower installation problem aims to minimize the exposure of residents to secondhand smog by identifying the optimal tower locations. …”
Get full text

Approximating the double-cut-and-join distance between unsigned genomes by Chen, Xin, Sun, Ruimin, Yu, Jiadong

“…Then, we show that the problem of finding a largest collection of edge-disjoint cycles/AA-paths/AB-paths of length no more than l can be reduced to the well-known degree-bounded k-set packing problem with k = 2l. Finally, a polynomial-time approximation algorithm for the problem of sorting unsigned genomes by double-cut-and-join operations is devised, which achieves the approximation ratio 13/9 + e ≈ 1.4444 + e, for any positive ε. …”
Get full text
Get full text

Optimizing Container Fill Rates for the Textile and Garment Industry Using a 3D Bin Packing Approach by Nguyen Thi Xuan Hoa

“…To address this issue, this study proposes the application of the optimal box arrangement in a container with a 3D bin packing problem to enhance fill rates and accommodate the complex packing criteria of the textile and garment industry. …”
Get full text

Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container by Stephen Sanjaya Budi, Paulina Kus Ariningsih, Titi Iswari

“…Therefore, this article aims to propose an algorithm to solve the problem by creating an algorithm hybrid of routing and packing to find the solution for routing and packing problem, sequentially, with a metaheuristic approach. …”
Get full text

Impact of minimum distance constraints on sheet metal waste for plasma cutting. by Matheus Francescatto, Alvaro Luiz Neuenfeldt Júnior, Elsa Silva, João Carlos Furtado, Dani Bromberger

“…We approached the two-dimensional rectangular strip packing problem (2D-SPP), where the main goal is to pack a given number of rectangles without any overlap to minimize the height of the strip. …”
Get full text