Multi-Dimensional Packing by Tabu Search

نویسنده

Andrea Lodi

چکیده

The paper deals with multi-dimensional cutting and packing and metaheuristic algorithms. A brief overview of this area is presented, and the general Tabu Search framework of Lodi, Martello and Vigo [LMV99a] is considered in detail. Computational results on multi-dimensional bin packing problems are reported, and possible methods for extending the framework to other packing problems are finally discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems

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.

متن کامل

An Interval Graph-based Tabu Search Framework for Multi-dimensional Packing

Packing is a vast and continuously growing field in the area of Operations Research and Combinatorial Optimization. Roughly speaking, given a set of items and a set of containers, packing problems are concerned with the loading of the items into the containers, according to some packing rules and optimizing a performance measure. Under this broad definition, we find a wide set of real-life and ...

متن کامل

Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem

In this paper, we develop an extended guided tabu search (EGTS) and a new heuristic packing algorithm for the two-dimensional loading vehicle routing problem (2L-CVRP). The 2L-CVRP is a combination of two well-known NP-hard problems, the capacitated vehicle routing problem, and the two-dimensional bin packing problem. It is very difficult to get a good performance solution in practice for these...

متن کامل

TSPACK: A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem

Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem. The first level aims to reduce the number of bins. The second optimizes the packing of the bins. This latter procedure is based on the Interval Graph representati...

متن کامل