Mutation Ant Colony Algorithms of Constrained Two-dimensional Guillotine Cutting Problems

Author

Ma, Jianhua

Author_Institution

Sch. of Inf. Manage., Shandong Economic Univ., Jinan

Volume

1

fYear

0

fDate

0-0 0

Firstpage

3042

Lastpage

3046

Abstract

The two-dimensional cutting problem plays an important role in many goods production processes. The two-dimensional cutting problem addressed in this paper consists of cutting a large rectangular plate into a number of stripes which are then cut to obtain ordered smaller rectangles. Its objective is to maximize the total area used and the numbers of ordered pieces are limited to specified numbers. To obtain ant colony algorithm for this problem, an order-cutting method is given and solving this problem is translated to searching an optimal machining order by order-cutting method. Then an ant colony algorithm and its improving algorithm with mutation operator and reproduction in-break operator are given to searching an optimal machining order. Computational results are presented for some large randomly generated problems

Keywords

artificial life; cutting; machining; mathematical operators; optimisation; production management; search problems; 2D guillotine cutting problem; ant colony algorithm; goods production process; mutation operator; optimal machining order; order-cutting method; reproduction in-break operator; Automation; Genetic mutations; Gold; Information management; Intelligent control; Machining; Production; ant colony algorithm; mutation operator; reproduction in-break operator; two-dimensional guillotine cutting problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1712925

Filename

1712925