Optimal Vector Packing in Multiple Dimensions with Heuristic Search

摘要: We study an extension of the well-known bin-packing problem to multiple dimensions, resulting in vector packing problem. The is find minimum number multidimensional bins pack a set vectors into without exceeding bin capacity any dimension bin. While we use approximate methods inform our search, ultimately return optimal solutions. This work attempt extend results [Kor03] dimensions and combine it with some new techniques. A hybrid DFBnB algorithm which searches two separate spaces used as final algorithm. Our also uses heuristic assist initially bound cost solution. can be run on vector-packing problems good are shown for up five-dimensional problems. An made define method compare these future algorithms, consensus appropriate test suites seems lacking.