عنوان مقاله [English]
نویسنده [English]چکیده [English]
Marker planning is a critical operation in the cutting-fabric stage in the clothing industry. This is among those optimization problems that is concerned with finding a good arrangement of multiple pattern pieces on fabric. The goal of this process is to maximize the utilization productivity and as a result to minimize the waste of fabric and reduce the computing time. Cutting and packing problem in textile industry should be considered as a two-dimensional (2D) strip packing of irregular shapes and finding a proper arrangement among packing of a limited set of 2D components on a fabric surface with fixed width and infinite length. This paper reviews the types of heuristic and etaheuristic algorithms that have been developed for solving 2D packing of irregular shapes.