2012•Unpublished venueRequires access

The Max-Min Ant System Applied to the Rectangular Pieces Layout Optimization

Ruijie Liu, Hongyu Xu, Min Zhang

Abstract

The rectangular pieces layout optimization is a typical combinatorial optimization problem. This optimal problem is represented by the AND/OR tree and then its optimal objective becomes to find the binary tree, whose utilization rate of the area is maximum. The Max-Min Ant System can effectively implement to search this kind of tree, and then the optimal solution of the rectangular pieces layout optimization will be obtained.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Mathematical optimization, Ant colony optimization algorithms, Tree (set theory), Binary tree, Combinatorial optimization, Computer science, Optimization problem, Metaheuristic