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

DOI10.1016/J.PHYSA.2013.05.043MaRDI QIDQ1673263zbMATHOpenAlexFDO

Authors 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)

Recommendations

• An algorithm of global optimization for solving layout problems
• A global optimization algorithm for the layout problem of rectangular pieces based on the maximal planar graph
• scientific article; zbMATH DE number 238410
• scientific article; zbMATH DE number 1192964
• Cooperative co-evolutionary scatter search for satellite module layout design

Cites work

• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Computing the intersection-depth to polyhedra
• Multi-agent oriented constraint satisfaction
• Nature's way of optimizing
• Polygon decomposition for efficient construction of Minkowski sums
• Possible generalization of Boltzmann-Gibbs statistics.
• The geometry of nesting problems: a tutorial
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• 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)