2013•Computer and Digital EngineeringRequires access

Improved Ant Algorithm in the Rectangular Pieces Layout Optimization

Liu Ruiji

Abstract

The rectangular pieces layout optimization is a NP-complete combinatorial optimization problem.The improved Ant Algorithm is introduced for solving the rectangular pieces layout optimization.Computational results show that the algorithm for the rectangular pieces layout optimization is better effective and practically useful than the Ant Algorithm,and a new way is offered for solving this kind of NPcomplete combinatorial optimization problem.

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: Computer science, Ant colony optimization algorithms, Combinatorial optimization, Mathematical optimization, Algorithm, Optimization problem, Metaheuristic, Optimization algorithm