A new search procedure, VLT(Vertex Line Tracing) heuristic, for two dimensional irregular shapes nesting problem was suggested in this study. The VLT heuristic was suggested to the nesting problem to overcome disadvantages of the existing NFP(No-Fit-Polygon) method. This VLT heuristic was compared with the results of the existing benchmark problems suggested by Albano, Hopper, and Burke. The results of the VLT heuristic give efficient solutions in the point of the scrap ratio and computation time. A computer program, NestLogic, using C++ for VLT heuristic was also developed for this nesting problem.