Approximate algorithms for constrained circular cutting problems

Mhand Hifi

doi:10.1016/S0305-0548(03)00020-0

Return

Approximate algorithms for constrained circular cutting problems

2004-04-01

PRE

Mhand Hifi *

Rym M’Hallah

DOI：10.1016/S0305-0548(03)00020-0

Original

Original request for help

Save

Abstract

En 中文

In this paper, we study the problem of cutting a rectangular plate R of dimensions (L, W) into as many circular pieces as possible. The circular pieces are of n different types with radii r(i), i = n. We solve the constrained circular problem, where d(i) the maximum demand for piece type i is specified, using two heuristics: a constructive procedure-based heuristic and a genetic algorithm-based heuristic. Both of these approaches search for a good ordering of the pieces and use an adaptation of the best local position procedure (Studia. Inform. Univ. 2 (1) (2002) 33) to find the best layout of this ordered set. This positioning procedure is specifically tailored to circular cutting problems. It acts, for constrained problems, as one of the mutation operators of the genetic algorithm. We compare the performance of both proposed approaches to that of existing approximate and exact algorithms on several problem instances taken from the literature. The computational results show that the proposed approaches produce high-quality solutions within reasonable computational times. The genetic algorithm-based heuristic is easily parallelizable; one of its important features to be investigated in the near future.

Keywords:

best local position

circular cutting problem

combinatorial optimization

genetic algorithms

heuristics

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.