We proposed the method that translates the 2-D CSP for minimizing the number of cuts to the Ising model. After that, we conducted computer experiments of the proposed model using the benchmark problem. From the above, the following results are obtained. (1) The proposed Ising model adequately represents the target problem. (2) Acceptance rates were low as 0.2% to 9.8% and from 21.8% to 49.4%. (3) Error rates from optimal solution were broad as 0% to 25.9%. As the future work, (1) Improve the Hamiltonian for Constraints. (2) Improve the proposed model to adjust more complex 2-D CSP and reduce the number of spins when it deals with large materials and components. (3) Conduct experiments using a quantum annealer.
[1]
Daniele Vigo,et al.
Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem
,
1999
.
[2]
Pearl Y. Wang,et al.
Heuristics for Large Strip Packing Problems with Guillotine Patterns: an Empirical Study
,
2001
.
[3]
Nozomu Togawa,et al.
An Ising model mapping to solve rectangle packing problem
,
2018,
2018 International Symposium on VLSI Design, Automation and Test (VLSI-DAT).
[4]
Robert E. Tarjan,et al.
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
,
1980,
SIAM J. Comput..