Packing Irregular Objects in 3D Space via Hybrid Optimization

Ma, Yuexin; Chen, Zhonggui; Hu, Wenyi; Wang, Wenping

doi:10.1111/cgf.13490

Cited by 23 publications

(15 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Therefore, they formulated the PPP as a nonlinear programming problem considering continuous rotations and translations of the small items. Ma et al (2018) proposed an efficient method to obtain sub-optimal solutions for packing 3D small items into 3D containers, considering free rotation of the small items. The solution is optimization-based due to the fact it combines continuous local optimization and combinatorial optimization.…”

Section: State Of the Artmentioning

confidence: 99%

“…Cutting and packing problems (C&PP) have been an object of great interest within the computational geometry and operational research communities (Ma et al, 2018). These problems aim to maximize space utilization or minimize space waste when embedding a set of items within larger containers (Dyckhoff, 1990), and have numerous applications in 1D, 2D, and 3D, which may explain research communities' interest in solving them.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A hybrid approach of simulation and metaheuristic for the polyhedra packing problem

Pantoja-Benavides¹,

Álvarez‐Martínez²

2022

10.5267/j.ijiec

View full text Add to dashboard Cite

This document presents a simulation-based method for the polyhedra packing problem (PPP). This problem refers to packing a set of irregular polyhedra (convex and concave) into a cuboid with the objective of minimizing the cuboid’s volume, considering non-overlapping and containment constraints. The PPP has applications in additive manufacturing and packing situations where volume is at a premium. The proposed approach uses Unity® as the simulation environment and considers nine intensification and two diversification movements. The intensification movements induce the items within the cuboid to form packing patterns allowing the cuboid to decrease its size with the help of gravity-like accelerations. On the other hand, the diversification movements are classic transition operators such as removal and filling of pieces and enlargement of the container, which allow searching on different solution neighborhoods. All simulated movements were hybridized with a probabilistic tabu search. The proposed methodology (with and without the hybridization) was compared by benchmarking with all previous works solving the PPP with irregular items. Results show that satisfactory solutions were reached in a short time; even a few published results were improved.

show abstract

Section: State Of the Artmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A hybrid approach of simulation and metaheuristic for the polyhedra packing problem

Pantoja-Benavides¹,

Álvarez‐Martínez²

2022

10.5267/j.ijiec

View full text Add to dashboard Cite

show abstract

“…The algorithm utilizes a guided local search to escape local optima. More recently, Ma et al (2018) develop a hybrid algorithm for packing irregular objects inside an irregular 3D space. Their algorithm combines a continuous optimization procedure and a combinatorial swapping technique.…”

Section: Irregular Object Packing In 3d Euclidean Spacementioning

confidence: 99%

Extracting maximal objects from three-dimensional solid materials

Silva

Çalık

Vancroonenburg

et al. 2021

Computers & Operations Research

View full text Add to dashboard Cite

In the problem of extracting maximal items/objects from three-dimensional materials, we are given a piece of solid material and an object with predefined ratios. The goal is to extract the largest possible convex or non-convex object from the solid material. There are two variants of the problem: the general case where the solid material is non-convex and its special case consisting of a convex solid material. We propose a matheuristic approach for solving both problems. For the special case, the problem is also modeled as a non-linear programming formulation. Meanwhile, for the general case a mixed integer linear programming formulation is provided based on the decomposition of the non-convex material into a finite number of convex regions. Computational experiments evaluate the performance of both models for small-scale instances considering objects with at most 1400 and 370 vertices for the special and general case, respectively. We observe that the required computational effort increases with the number of vertices of the objects, therefore, it is also evaluated the efficiency of the proposed matheuristic approach for more complicated instances, considering objects with a higher number of vertices.In order to establish benchmark instances for future research, all instances used are publicly available.

show abstract

“…Hu et al [9] extended the tile arrangement on curved surfaces and solved the problem by hybrid optimization, i.e., continuous configuration optimization and discrete combinatorial optimization. They further applied optimization to packing irregular objects in 3D space [10]. Kwan et al [7] proposed a bottom-up solution to generate collages with arbitrary and irregular shapes in a scale-invariant domain, using a scaleinvariant shape descriptor called PAD.…”

Section: Pattern Collagementioning

confidence: 99%

Manufacturable pattern collage along a boundary

Chen

Lü

2019

Comp. Visual Media

View full text Add to dashboard Cite

Recent years have shown rapid development of digital fabrication techniques, making manufacturing individual models reachable for ordinary users. Thus, tools for designing customized objects in a user-friendly way are in high demand. In this paper, we tackle the problem of generating a collage of patterns along a given boundary, aimed at digital fabrication. We represent the packing space by a pipe-like closed shape along the boundary and use ellipses as packing elements for computing an initial layout of the patterns. Then we search for the best matching pattern for each ellipse and construct the initial pattern collage in an automatic manner. To facilitate editing the collage, we provide interactive operations which allow the user to adjust the layout at the coarse level. The patterns are fine-tuned based on a spring-mass system after each interaction step. After this interactive process, the collage result is further optimized to enforce connectivity. Finally, we perform structural analysis on the collage and enhance its stability, so that the result can be fabricated. To demonstrate the effectiveness of our method, we show results fabricated by 3D printing and laser cutting.

show abstract

Packing Irregular Objects in 3D Space via Hybrid Optimization

Cited by 23 publications

References 36 publications

A hybrid approach of simulation and metaheuristic for the polyhedra packing problem

A hybrid approach of simulation and metaheuristic for the polyhedra packing problem

Extracting maximal objects from three-dimensional solid materials

Manufacturable pattern collage along a boundary

Contact Info

Product

Resources

About