.png){kind=icon}
.png){kind=icon}
Return
An improved mathematical formulation for the blocks relocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.03.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the blocks relocation problem (also called container relocation problem). First, it corrects the binary linear programming model BRP-II presented in Caserta et al. (2012). Second, it improves the initial model formulation by removing superfluous variables, tightening some constraints, introducing a new upper bound and applying a pre-processing step to fix several variables. Computational results show the efficiency of the improved model for small and medium sized instances. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Blocks relocation problem
Container relocation problem
Integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
View more organizations