Abstract
Layout problems of compressible objects (known also as deformable, elastic, soft) that may change their shapes to better hosting in the optimized container have a wide spectrum of applications, in particular, in land allocation, floor planning, logistics, material sciences, biology, mechanics, nanotechnologies. The paper focuses on the study of porous media where elements can be deformed by external force however the mass of each individual element remains unchanged. A problem of layout of particles in a rectangular fragment of the porous media under pressure is formulated. Particles are approximated by polygonal objects of variable shapes with respect to a given limits of metric parameters under area and convexity conservation. Free translations and continuous rotations of the particles are allowed. A multistart strategy is used for finding local optimal solutions of the problem. It combines a feasible starting point algorithm, using packing original polygons in a fixed container and a decomposition procedure for packing compressible objects in a minimal height container. Computational results for the real data example are provided.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Yagiura, M., Umetani, S., Imahori, S., Hu, Y.: Cutting and Packing Problems. From the Perspective of Combinatorial Optimization. Springer, Tokyo (2024). ISBN 978-4-431-55290-1
Fischer, A., Scheithauer, G.: Cutting and packing problems with placement constraints. In: Fasano, G., Pint´er, J. (eds.) Optimized Packings with Applications. Springer Optimization and Applications, vol. 105, pp. 119–156. Springer (2015)
Kallrath, J.: Cutting & Packing beyond and within mathematical programming. In: Business Optimisation Using Mathematical Programming, 2nd edn., pp. 495–526, Springer (2021). https://doi.org/10.1007/978-3-030-73237-0_15
Kiseleva, E.M.: The emergence and formation of the theory of optimal set partitioning for sets of the n-dimensional Euclidean space. Theory and application. J. Autom. Inf. Sci. 50(9), 1–24 (2018). https://doi.org/10.1615/JAutomatInfScien.v50.i9.10
Jiang, J., Garikipati, K., Rudraraju, S.: A diffuse interface framework for modeling the evolution of multicell aggregates as a soft packing problem driven by the growth and division of cells. Bull. Math. Biol. 81, 3282–3300 (2019)
Yuan, Q., Li, Z., Gao, Y., Wang, Y.H., Li, X.: Local responses in 2D assemblies of elliptical rods when subjected to biaxial shearing. Acta Geotech. 14, 1685–1697 (2019)
Blunt, M., J.: Multiphase Flow in Permeable Media: A Pore-Scale Perspective. Cambridge University Press, Cambridge (2017)
Chen, Y., et al.: Structural characterization and statistical properties of jammed soft ellipsoid packing. Soft Matter. 17, 2963 (2021). https://doi.org/10.1039/d0sm01699c
Bui, Q.T., Vidal, T., Hà, M.H.: On three soft rectangle packing problems with guillotine constraints. J. Glob. Optim. 74, 45–62 (2019). https://doi.org/10.1007/s10898-019-00741-w
Zuo, Q., et al.: The three-dimensional bin packing problem for deformable items. In: IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Kuala Lumpur, Malaysia, pp. 0911–0918 (2022). https://doi.org/10.1109/IEEM55944.2022.9989600
Litvinchev, I., Ríos-Solís, Y., Ozdemir, D., Hernandez-Landa, L.: Multiperiod and stochastic formulations for a closed loop supply chain with incentives. J. Comput. Syst. Sci. Int. 53(2), 201–211 (2014). ISSN 1064-2307. https://doi.org/10.1134/S1064230714020129
Litvinchev, I., Lopez, F., Escalante, H.J., Mata, M.: A MILP bi-objective model for static portfolio selection of R&D projects with synergies. J. Comput. Syst. Sci. Int. 50(6), 942–952 (2011). ISSN 1064-2307. https://doi.org/10.1134/S1064230711060165
Fasano, G.: Solving Non-standard Packing Problems by Global Optimization and Heuristics. Springer (2014)
Hartmann, S.: Packing problems and project scheduling models: an integrating perspective. J. Oper. Res. Soc. 51, 1083–1092 (2000)
Eichheimer, P., et al.: Pore-scale permeability prediction for Newtonian and non-Newtonian fluids. Solid Earth 10(5), 1717–1731 (2019). https://doi.org/10.5194/se-10-1717-2019
Dong, X., Liu, H., Hou, J., Zhang, Z., Chen, Z.: Multi-thermal fluid assisted gravity drainage process: a new improved-oil-recovery technique for thick heavy oil reservoir. J. Petrol. Sci. Eng. 133, 1–11 (2015). https://doi.org/10.1016/j.petrol.2015.05.001
Al-Nakhli, A., Tariq, Z., Mahmoud, M., Abdulraheem, A., Al Shehri, D.: A novel thermochemical fracturing approach to reduce fracturing pressure of high strength rocks. In: Abu Dhabi International Petroleum Exhibition & Conference, SPE-197593-MS (2019). https://doi.org/10.2118/197593-MS
Romanova, T., et al.: Optimized packing soft ellipses. In: Human-Assisted Intelligent Computing, pp. 9.1–9.16 (2023). https://doi.org/10.1088/978-0-7503-4801-0ch9
Castillo, I., Kampas, F.J., Pinter, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191, 786–802 (2008)
Kampas, F.J., Castillo, I., Pinter, J.D.: Optimized ellipse packings in regular polygons. Optim. Lett. 13, 1583–1613 (2019)
Kallrath, J., Rebennack, S.: Cutting ellipses from area-minimizing rectangles. J. Glob. Optim. 59, 405–437 (2014)
Pankratov, A., Romanova, T., Litvinchev, I.: Packing ellipses in an optimized rectangular container. Wirel. Netw. 26(7), 4869–4879 (2020). https://doi.org/10.1007/s11276-018-1890-1
Kampas, F.J., Pintér, J.D., Castillo, I.: Packing ovals in optimized regular polygons. J. Glob. Optim. 77, 175–196 (2020). https://doi.org/10.1007/s10898-019-00824-8
Castillo, I., Pintér, J.D., Kampas, F.J.: The boundary-to-boundary p-dispersion configuration problem with oval objects. J. Oper. Res. Soc., 1–11 (2024). https://doi.org/10.1080/01605682.2024.2312255
Torres, J., Hitschfeld, N., Ruiz, R.O., Ortiz-Bernardin, A.: Convex polygon packing based meshing algorithm for modeling of rock and porous media. In: Krzhizhanovskaya, V.V., et al. (eds.) Computational Science, ICCS 2020. LNCS, vol. 12141. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-50426-7_20
Burke, E., Kendall, G.: A new approach to packing non-convex polygons using the no fit polygon and meta-heuristic and evolutionary algorithms. In: Parmee, I.C. (eds.) Adaptive Computing in Design and Manufacture V. Springer, London (2002). https://doi.org/10.1007/978-0-85729-345-9_17
Pankratov, A., Romanova, T., Shekhovtsov, S., Grebennik, I., Pankratova, J.; Packing irregular polygons using quasi phi-functions. In: 2020, 10th International Conference on Advanced Computer Information Technologies (ACIT), Deggendorf, Germany, pp. 1–5 (2020). https://doi.org/10.1109/ACIT49673.2020.9208979
Peralta, J., Andretta, M., Oliveira, J.F.: Solving irregular strip packing problems with free rotations using separation lines (2017). https://arxiv.org/abs/1707.07177
Peralta, J., Andretta, M., Oliveira, J.; Packing circles and irregular polygons using separation lines. In: Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, pp. 71–77 (2018). https://doi.org/10.5220/0006602700710077
Kallrath, J., Romanova, T., Pankratov, A., Litvinchev, I., Infante, L.: Packing convex polygons into minimum perimeter convex hulls. Journal of Global Optimization, 85(1), 39–59 (2023). https://doi.org/10.1007/s10898-022-01194-4
Litvinchev, I.S.: Refinement of Lagrangian bounds in optimization problems. Comput. Math. Math. Phys. 47(7), 1101–1108 (2007). ISSN 0965-5425. https://doi.org/10.1134/S0965542507070032
Romanova, T., Stoyan, Y., Pankratov, A., Litvinchev, I., Marmolejo, J.A.: Decomposition algorithm for irregular placement problems. In: Intelligent Computing and Optimization, AISC, vol. 1072, pp. 214–221. Springer (2019). https://doi.org/10.1007/978-3-030-33585-4_21
Litvinchev, I., Rangel, S., Saucedo, J.: A Lagrangian bound for many-to-many assignment problems. J. Comb. Optim. 19(3), 241–257 (2010). ISSN 1382-6905. https://doi.org/10.1007/s10878-008-9196-3
Li, J., et al.: Experimental study on 3D vibrated packing densification of mono-sized dodecahedral particles. Powder Technol. 367, 703–712 (2020). https://doi.org/10.1016/j.powtec.2020.04.020
Acknowledgement
Tetyana Romanova would like to thank the British Academy (grant #100072) for the overall support.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2026 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Romanova, T., Melashenko, O., Kravchenko, O., Pankratov, O., Stoian, Y. (2026). Layout of Compressible Objects. In: Arsenyeva, O., Romanova, T., Sukhonos, M., Biletskyi, I., Tsegelnyk, Y. (eds) Smart Technologies in Urban Engineering. STUE 2024. Lecture Notes in Networks and Systems, vol 1658. Springer, Cham. https://doi.org/10.1007/978-3-032-06829-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-032-06829-3_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-032-06828-6
Online ISBN: 978-3-032-06829-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)Springer Nature Proceedings excluding Computer Science


