An optimization algorithm based on no-fit polygon method and hybrid heuristic strategy for irregular nesting problem

For the irregular nesting problem widely existing in modern manufacturing industry, this paper makes a research on it and presents an optimization algorithm based on no-fit polygon (NFP) method and hybrid heuristic strategy to solve it. The proposed algorithm first uses the composition method of trace line segment to calculate no-fit polygons (NFPs) between every two pieces in piece set, and extracts the candidate placement points for a candidate piece to be placed by using generated NFPs in combination with internal no-fit polygon (INFP) between the piece and the material plate. Then, the algorithm designs and applies three hybrid heuristic strategies to evaluate all candidate pieces and choose the best piece to place next and determine the best placement point for the selected piece. Experimental test has been performed to verify feasibility and effectiveness of the proposed algorithm. The test results show that the algorithm can solve the irregular nesting problem effectively, and improve the utilization of material to a certain extent.