A heuristic rule for relocating blocks

A heuristic rule for relocating blocks

0.00 Avg rating0 Votes
Article ID: iaor20071615
Country: United Kingdom
Volume: 33
Issue: 4
Start Page Number: 940
End Page Number: 954
Publication Date: Apr 2006
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics, storage
Abstract:

One of the most important objectives of the storage and pickup operations in block stacking systems is to minimize the number of relocations during the pickup operation. This study suggests two methods for determining the locations of relocated blocks. First, a branch-and-bound (B&B) algorithm is suggested. Next, a decision rule is proposed by using an estimator for an expected number of additional relocations for a stack. The performance of the decision rule was compared with that of the B&B algorithm.

Reviews

Required fields are marked *. Your email address will not be published.