Packing Irregular Polygons using Quasi Phi-functions
| Autor: | Julia Pankratova, Tatiana E. Romanova, Igor Grebennik, Alexandr Pankratov, Sergiy Shekhovtsov |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
021103 operations research Computer science 0211 other engineering and technologies Regular polygon 02 engineering and technology Object (computer science) Fast algorithm Maxima and minima Packing problems 020901 industrial engineering & automation Simply connected space Container (abstract data type) Benchmark (computing) Algorithm |
| Zdroj: | ACIT |
| DOI: | 10.1109/acit49673.2020.9208979 |
| Popis: | Packing simply connected irregular polygons in an optimized convex container is considered. Each object allows free continuous moving. We use quasi phi-functions for describing non-overlapping relations of irregular polygons. An exact mathematical model of the packing problem is provided. The fast algorithm to search for feasible arrangements of irregular polygons is proposed. The optimization procedure to find good local extrema is presented. Computational results illustrated with new benchmark instances are given. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|