We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

A new 0-1 formulation of the restricted container relocation problem based on a binary encoding of congurations

Thumbnail Image
Download
Name

Galle_new 0-1 formulation of restricted container relocation problem.pdf

Description
A new 0-1 formulation of the restricted container relocation problem, updated September 2017
Size

683.86 KB

Format

Adobe PDF

Checksum (MD5)

1cf4150c5acef36382548ec751862332

Author(s)
Galle, Virgile
•
Barnhart, Cynthia
•
Jaillet, Patrick
Date Issued
June 16, 2017
Series/Report no.
MIT Sloan School Working Paper;5199-17
Abstract
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.
Description
Submitted to EJOR June 2017
Subjects
OR in maritime industry
Integer Programming
Container Relocation Problem
Block Relocation Problem
Binary Encoding
Terms of Use
Attribution-NonCommercial-NoDerivs 3.0 United States
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.