Abstract
In this paper, we deal with a packing problem that asks to place a given set of objects such as non-convex polytopes compactly in ℝ2 and ℝ3, where we treat translation, rotation and deformation as possible motions of each object. We propose a multi-sphere scheme that approximates each object with a set of spheres to find a compact layout of the original objects. We focus on the case that all objects are rigid, and develop an efficient local search algorithm based on a nonlinear program formulation.
This research was supported by Research Fellowships of the Japan Society for the Promotion of Science for Young Scientists and a Scientific Grant in Aid from the Ministry of Education, Science, Sports and Culture of Japan.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Guibas, L.J., Har-Peled, S., Rabinovitch, A., Sharir, M.: Penetration depth of two convex polytopes in 3D. Nordic Journal of Computing 7(3), 227–240 (2000)
Wang, H., Huang, W., Zhang, Q., Xu, D.: An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 141(2), 440–453 (2002)
Birgin, E.G., Martínez, J.M., Ronconi, D.P.: Optimizing the packing of cylinders into a rectangular container: A nonlinear approach. European Journal of Operational Research 160(1), 19–33 (2005)
Sloane, N.J.A.: The sphere packing problem. Documenta Mathematica ICM III, 387–396 (1998)
Imamichi, T., Yagiura, M., Nagamochi, H.: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Technical report 2007-009, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2007)
Milenkovic, V.J.: Rotational polygon overlap minimization and compaction. Computational Geometry 10(4), 305–318 (1998)
Ferrez, J.A.: Dynamic triangulations for efficient 3D simulation of granular materials. PhD thesis, École Polytechnique Fédérale de Lausanne (2001)
Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Mathematical Programming 45(3), 503–528 (1989)
Mintseris, J., Wiehe, K., Pierce, B., Anderson, R., Chen, R., Janin, J., Weng, Z.: Protein-protein docking benchmark 2.0: an update. Proteins 60(2), 214–216 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imamichi, T., Nagamochi, H. (2007). A Multi-sphere Scheme for 2D and 3D Packing Problems. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-74446-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74445-0
Online ISBN: 978-3-540-74446-7
eBook Packages: Computer ScienceComputer Science (R0)