Sequential optimization approach for nesting and cutting sequence in laser cutting

• Presents a sequential approach for nesting and sequencing of irregular parts in laser cutting.
• Generates first the optimal nesting layout with maximum material Utilization.
• Evolves next optimal sequence for minimum travel with a SAA.
• Shows that proposed SAA is able to give better result than GA and ACO algorithms.
• Illustrates how the proposed integrated approach works for irregular shapes.

The economy of the laser cutting process depends on two productivity issues: (i) nesting, a classic problem of finding the most efficient layout for cutting parts with minimum material waste; (ii) cutting sequence, which targets the optimal sequence of edges of the parts to be cut for minimum cycle time. This paper presents a two stage sequential optimization procedure for nesting and cutting sequence for the objectives of maximizing material utilization and minimization of ideal (non-cut) travel distance of laser cut tool. However, the focus of this paper is the development of solution technique for optimal cutting sequence to any given layout. Simulated annealing algorithm (SAA) is considered to evolve the optimal cutting sequence. The proposed SAA is illustrated with the optimal material utilization layout obtained using sheet cutting suite software, a professional rectangular nesting software package. The robust test carried out with five typical problems shows that the SAA proposed for cutting sequence is capable of providing near optimal solutions. The performance comparison with two literature problems reveals that the proposed SAA is able to give improved result than GA and ACO algorithms.