IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2018i1p24-d193398.html
   My bibliography  Save this article

NLP Formulation for Polygon Optimization Problems

Author

Listed:
  • Saeed Asaeedi

    (Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran 15875-4413, Iran)

  • Farzad Didehvar

    (Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran 15875-4413, Iran)

  • Ali Mohades

    (Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran 15875-4413, Iran)

Abstract

In this paper, we generalize the problems of finding simple polygons with minimum area, maximum perimeter, and maximum number of vertices, so that they contain a given set of points and their angles are bounded by α + π where α ( 0 ≤ α ≤ π ) is a parameter. We also consider the maximum angle of each possible simple polygon crossing a given set of points, and derive an upper bound for the minimum of these angles. The correspondence between the problems of finding simple polygons with minimum area and maximum number of vertices is investigated from a theoretical perspective. We formulate these three generalized problems as nonlinear programming models, and then present a genetic algorithm to solve them. Finally, the computed solutions are evaluated on several datasets and the results are compared with those from the optimal approach.

Suggested Citation

  • Saeed Asaeedi & Farzad Didehvar & Ali Mohades, 2018. "NLP Formulation for Polygon Optimization Problems," Mathematics, MDPI, vol. 7(1), pages 1-25, December.
    • Handle: RePEc:gam:jmathe:v:7:y:2018:i:1:p:24-:d:193398
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/1/24/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/1/24/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Joonghyun Ryu & Deok-Soo Kim, 2013. "Protein structure optimization by side-chain positioning via beta-complex," Journal of Global Optimization, Springer, vol. 57(1), pages 217-250, September.
    2. Jakobs, Stefan, 1996. "On genetic algorithms for the packing of polygons," European Journal of Operational Research, Elsevier, vol. 88(1), pages 165-181, January.
    3. Giorgio Fasano, 2013. "A global optimization point of view to handle non-standard object packing problems," Journal of Global Optimization, Springer, vol. 55(2), pages 279-299, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wu, Yu-Liang & Huang, Wenqi & Lau, Siu-chung & Wong, C. K. & Young, Gilbert H., 2002. "An effective quasi-human based heuristic for solving the rectangle packing problem," European Journal of Operational Research, Elsevier, vol. 141(2), pages 341-358, September.
    2. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    3. Zehetner, Dominik & Gansterer, Margaretha, 2022. "The collaborative batching problem in multi-site additive manufacturing," International Journal of Production Economics, Elsevier, vol. 248(C).
    4. A Ghanmi & R H A D Shaw, 2008. "Modelling and analysis of Canadian Forces strategic lift and pre-positioning options," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1591-1602, December.
    5. Liu, Dequan & Teng, Hongfei, 1999. "An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles," European Journal of Operational Research, Elsevier, vol. 112(2), pages 413-420, January.
    6. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    7. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    8. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    9. Liu, D.S. & Tan, K.C. & Huang, S.Y. & Goh, C.K. & Ho, W.K., 2008. "On solving multiobjective bin packing problems using evolutionary particle swarm optimization," European Journal of Operational Research, Elsevier, vol. 190(2), pages 357-382, October.
    10. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    11. Germán Pantoja-Benavides & David Álvarez-Martínez & Francisco Parreño Torres, 2024. "The Normalized Direct Trigonometry Model for the Two-Dimensional Irregular Strip Packing Problem," Mathematics, MDPI, vol. 12(15), pages 1-25, August.
    12. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    13. Nestor M Cid-Garcia & Yasmin A Rios-Solis, 2021. "Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology," PLOS ONE, Public Library of Science, vol. 16(1), pages 1-20, January.
    14. Wenbin Zhu & Zhixing Luo & Andrew Lim & Wee-Chong Oon, 2016. "A fast implementation for the 2D/3D box placement problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 585-612, March.
    15. Alvarez-Valdes, R. & Parreno, F. & Tamarit, J.M., 2007. "A tabu search algorithm for a two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1167-1182, December.
    16. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    17. Douglas S. Gonçalves & Antonio Mucherino & Carlile Lavor & Leo Liberti, 2017. "Recent advances on the interval distance geometry problem," Journal of Global Optimization, Springer, vol. 69(3), pages 525-545, November.
    18. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    19. Hinostroza, Ignacio & Pradenas, Lorena & Parada, Víctor, 2013. "Board cutting from logs: Optimal and heuristic approaches for the problem of packing rectangles in a circle," International Journal of Production Economics, Elsevier, vol. 145(2), pages 541-546.
    20. Kaizhi Chen & Jiahao Zhuang & Shangping Zhong & Song Zheng, 2020. "Optimization Method for Guillotine Packing of Rectangular Items within an Irregular and Defective Slate," Mathematics, MDPI, vol. 8(11), pages 1-16, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2018:i:1:p:24-:d:193398. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.