| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Estadual Campinas, Inst Comp, Campinas, SP - Brazil
[2] Fed Univ ABC, Ctr Math Computat & Cognit, Santo Andre, SP - Brazil
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | Computers & Operations Research; v. 99, p. 206-217, NOV 2018. |
| Web of Science Citations: | 4 |
| Abstract | |
The Blocks Relocation Problem is an important problem in storage systems. An input instance for it consists of a set of blocks distributed in stacks where each block is identified by a retrieval number and each stack has a same maximum height limit. The objective is to retrieve all the blocks respecting their retrieval order and performing the minimum number of relocations. Only blocks at the top of a stack can be moved: either a block is retrieved, if it has the highest retrieval priority among the stacked blocks, or it is relocated to the top of another stack. Solving this problem is critical in storage systems because it saves operational time and resources. In this paper, we present two new lower bounds for the number of relocations of an optimal solution. We implemented an exact iterative deepening A{*} algorithm using these new proposed lower bounds and other well-known lower bounds from the literature. We performed several computational experiments to show that the new lower bounds improve the performance of the exact algorithm, solving to optimality more instances than when using other lower bounds when given the same amount of time. (C) 2018 Elsevier Ltd. All rights reserved. (AU) | |
| FAPESP's process: | 16/23552-7 - Cutting and Packing Problems: Practical and Theoretical Approaches |
| Grantee: | Rafael Crivellari Saliba Schouery |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 16/14132-4 - One and two-dimensional bin packing with conflicts and unloading restrictions |
| Grantee: | Carla Negri Lintzmayer |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points |
| Grantee: | Flávio Keidi Miyazawa |
| Support Opportunities: | Research Projects - Thematic Grants |