An emergent computation approach to the problem of polygon layout with performance constraints

DOI10.1016/J.PHYSA.2013.05.043zbMATH Open1395.52022OpenAlexW2020613953MaRDI QIDQ1673263FDOQ1673263

Zhendong Huang, Ren-bin Xiao

Publication date: 11 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2013.05.043

zbMATH Keywords

multi-agent systemgeneralized simulated annealingno-fit polygonpacking problem with constraintsself-organization emergence algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Discrete location and assignment (90B80) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cites Work

• Possible generalization of Boltzmann-Gibbs statistics.
• The geometry of nesting problems: a tutorial
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• Computing the intersection-depth to polyhedra
• Nature's way of optimizing
• Polygon decomposition for efficient construction of Minkowski sums
• Multi-agent oriented constraint satisfaction
• Using entropy-based methods to study general constrained parameter optimization problems

This page was built for publication: An emergent computation approach to the problem of polygon layout with performance constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673263)