Improved adaptive genetic algorithm for dynamic multi-specification one-dimensional cutting problem

Rebar is an essential material in the construction of bridges and houses. Rebar cutting is an important link in rebar processing, but it is usually completed by manual experience, which is not only time-consuming, but also causes serious waste and reduces the economic benefits. As the country vigorously promotes the green construction method, the traditional rebar cutting method is difficult to meet the development requirements. So dynamic multi-specification one-dimensional cutting problem is studied in this paper. A mathematical model aiming at the maximum utilization rate of raw material is established, and an improved adaptive genetic algorithm is proposed. Large-scale, small-scale, single-specification masterbatch and multi-specification masterbatch are selected for simulation experiments, respectively. The results show that the proposed algorithm can deal with both large- and small-scale multi-specification or single-specification masterbatch cutting problems. Moreover, the algorithm has good performance in solving accuracy and convergence speed, which verifies its feasibility, effectiveness, and stability. Finally, aiming at the problem of dynamic insertion of orders, one-dimensional cutting software is developed, rapid and real-time cutting of rebars is realized, and the utilization rate of building rebars is improved, which plays a positive role in promoting the high-quality development of construction industries such as bridges.