A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations
Name
Barnhart_A new binary.pdf
Description
Accepted version
Size
596.44 KB
Format
Adobe PDF
Checksum (MD5)
963f44015482ecead7db5c7e06c98a36
Author(s)
Galle, Virgile
Barnhart, Cynthia
Jaillet, Patrick
Date Issued
2018
Journal
European Journal of Operational Research
Publisher
Elsevier BV
Version
Author's final manuscript
Abstract
© 2017 Elsevier B.V. The Container Relocation Problem (CRP), also called Block Relocation Problem (BRP), is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. The restricted CRP enforces that only containers blocking the target container can be relocated. We improve upon and enhance an existing binary encoding and using it, formulate the restricted CRP as a binary integer programming problem in which we exploit structural properties of the optimal solution. This integer programming formulation reduces significantly the number of variables and constraints compared to existing formulations. Its efficiency is shown through computational results on small and medium sized instances taken from the literature.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.EJOR.2017.11.053
