An effective discrete artificial bee colony for the rectangular cutting problem with guillotine in transformer manufacturing

Abstract

This paper addresses a two-dimensional rectangular cutting problem with guillotine constraint, applied to the transformer industry. The problem requires a set of rectangular items to be cut from larger and variable-sized rectangles, known as bins. The goal is to minimize the number of bins used to cut all required items. An effective discrete artificial bee colony is proposed to solve the problem. The approach uses a decimal encoding method where each integer represents a type of bin or item, and decodes the list of integers by a constructive heuristic to generate cutting patterns with guillotine-cut constraint. In addition, a copy strategy is designed to improve the solution quality. The approach’s performances and the effectiveness of the strategy are evaluated by three datasets generated from real-world data. The experimental results show that the discrete artificial bee colony is superior to other competitive algorithms, and that the copy strategy can produce higher quality solutions.