用拟函数填充不规则多边形

2020 10th International Conference on Advanced Computer Information Technologies (ACIT) Pub Date : 2020-09-01 DOI:10.1109/ACIT49673.2020.9208979

A. Pankratov, T. Romanova, S. Shekhovtsov, I. Grebennik, Julia Pankratova

{"title":"用拟函数填充不规则多边形","authors":"A. Pankratov, T. Romanova, S. Shekhovtsov, I. Grebennik, Julia Pankratova","doi":"10.1109/ACIT49673.2020.9208979","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":372744,"journal":{"name":"2020 10th International Conference on Advanced Computer Information Technologies (ACIT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Packing Irregular Polygons using Quasi Phi-functions\",\"authors\":\"A. Pankratov, T. Romanova, S. Shekhovtsov, I. Grebennik, Julia Pankratova\",\"doi\":\"10.1109/ACIT49673.2020.9208979\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":372744,\"journal\":{\"name\":\"2020 10th International Conference on Advanced Computer Information Technologies (ACIT)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 10th International Conference on Advanced Computer Information Technologies (ACIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACIT49673.2020.9208979\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 10th International Conference on Advanced Computer Information Technologies (ACIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACIT49673.2020.9208979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

包装单连通不规则多边形的凸优化集装箱被认为是。每个对象允许自由连续移动。我们用拟函数来描述不规则多边形的非重叠关系。给出了填料问题的精确数学模型。快速算法搜索可行的安排提出了不规则的多边形。给出了寻找局部极值的优化过程。给出了新的基准算例的计算结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Packing Irregular Polygons using Quasi Phi-functions

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 10th International Conference on Advanced Computer Information Technologies (ACIT)

自引率

0.00%

发文量