An improved algorithms for the circular two-dimensional open dimension problem

In order to raise solving speed of the two-dimensional open dimension optimization algorithm, an improved parallel algorithm based on BSBIS algorithm is proposed, namely p-BSBIS. To overcome the defect of BSBIS algorithm which spends long time for complexity of the algorithm, p-BSBIS can shorten the packing time to a certain extent by using multiple nodes for parallel computing. Furthermore, the improved algorithm not only increases the operation speed but also retains accurate optimization of the original BSBIS. Simulated in the platform, the results demonstrated that p-BSBIS is better than the original algorithm for solving speed.