Multi-Colony Ant Algorithm Applied to the Rectangular Pieces Layout Optimization
Yuan Shi
Abstract
Yuan Shi
Abstract
The rectangular pieces layout optimization is a NP-complete combinatorial optimization problem.It cuts a given finite set of small rectangula pieces from a large rectangular plate of fixed dimensions in order to achieve maximum profit.It introduces the multi-colony ant algorithm for solving the rectangular pieces layout optimization.The computaional results show that the proposed algorithm for the rectangular pieces layout optimization is effective and useful and offers a new way for solving this NP-complete combinatorial optimization problem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The rectangular pieces layout optimization is a NP-complete combinatorial optimization problem.It cuts a given finite set of small rectangula pieces from a large rectangular plate of fixed dimensions in order to achieve maximum profit.It introduces the multi-colony ant algorithm for solving the rectangular pieces layout optimization.The computaional results show that the proposed algorithm for the rectangular pieces layout optimization is effective and useful and offers a new way for solving this NP-complete combinatorial optimization problem.
Key concepts: Ant colony optimization algorithms, Combinatorial optimization, Mathematical optimization, Optimization problem, Set (abstract data type), Algorithm, Computer science, Extremal optimization