A heuristic rule for relocating blocks

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 i...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2006-04, Vol.33 (4), p.940-954
Main Authors: Kim, Kap Hwan, Hong, Gyu-Pyo
Format: Article
Language:English
Subjects:
Applied sciences
Block stacking
Branch & bound algorithms
Branch and bound algorithm
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristic rule
Operational research and scientific management
Operational research. Management science
Operations research
Relocation
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2004.08.005