Packing Circles and Irregular Polygons using Separation Lines
Jeinny Peralta, Marina Andretta, José Fernando Oliveira
2018
Abstract
In this paper we propose a nonlinear mathematical model for the problem of packing circles, convex and non-convex irregular polygons, within a rectangular envelope to be produced, obeying containment constraints and non-overlapping constraints; the objective of the problem is to minimize the area of the rectangular envelope. We consider free rotations of the polygons and use separation lines to ensure non-overlapping. Computational tests were run using instances presented in the literature that deal with circles and polygons simultaneously; different solutions, in which the area of the rectangular envelope is smaller than or equal to the ones found in the literature were found in most cases, and the execution time is very low. This indicates that our model is computationally efficient.
DownloadPaper Citation
in Harvard Style
Peralta J., Andretta M. and Oliveira J. (2018). Packing Circles and Irregular Polygons using Separation Lines.In Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-285-1, pages 71-77. DOI: 10.5220/0006602700710077
in Bibtex Style
@conference{icores18,
author={Jeinny Peralta and Marina Andretta and José Fernando Oliveira},
title={Packing Circles and Irregular Polygons using Separation Lines},
booktitle={Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2018},
pages={71-77},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006602700710077},
isbn={978-989-758-285-1},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Packing Circles and Irregular Polygons using Separation Lines
SN - 978-989-758-285-1
AU - Peralta J.
AU - Andretta M.
AU - Oliveira J.
PY - 2018
SP - 71
EP - 77
DO - 10.5220/0006602700710077