Using a tabu search approach for solving the two-dimensional irregular cutting problem
Annals of Operations Research - Special issue on Tabu search
A Taxonomy of Hybrid Metaheuristics
Journal of Heuristics
Layout of Two Dimensional Irregular Shapes Using Genetic Algorithms
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Hi-index | 0.00 |
This paper proposes a new hybrid heuristic to a difficult but frequently occurring problem in the apparel industry: the cut order planning (COP). This problem consists of finding the combination of ordered sizes on the material layers that minimizes total material utilization. The current practice in industry solves COP independently from the two-dimensional layout (TDL) problem; i.e., COP estimates the length of the layout required to cut a particular combination of sizes instead of packing the pieces on the fabric and determining the actual length used. Evidently, this results in a build up of estimation errors; thus increased waste. Herein, COP and TDL are combined into a single problem CT. The resulting problem is modeled and solved using a hybrid heuristic which combines the advantages of population based approaches (genetic algorithms) with those of local search (simulated annealing). The experimental results show the validity of the proposed model, and the sizeable savings it induces when solved using the proposed hybrid heuristic.