TSpack: A unified Tabu Search code for multi-dimensional bin packing problems

被引：46

作者：

Lodi, A ^{[1
]}

Martello, S ^{[1
]}

Vigo, D ^{[1
]}

机构：

[1] Univ Bologna, DEIS, I-40136 Bologna, Italy

来源：

ANNALS OF OPERATIONS RESEARCH | 2004年 / 131卷 / 1-4期

关键词：

packing; cutting; Tabu Search;

D O I：

10.1023/B:ANOR.0000039519.03572.08

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present a computer code that implements a general Tabu Search technique for the solution of two- and three-dimensional bin packing problems, as well as virtually any of their variants requiring the minimization of the number of bins. The user is only requested to provide a procedure that gives an approximate solution to the actual variant to be solved.

引用

页码：203 / 213

页数：11

共 20 条

[1] PACKING RECTANGULAR PIECES - A HEURISTIC APPROACH [J].