Home // ICONS 2014, The Ninth International Conference on Systems // View article

A Branch-and-Cut Algorithm to Solve the Container Storage Problem

Authors:
Ndèye Fatma Ndiaye
Adnan Yassine
Ibrahima Diarrassouba

Keywords: Container Storage Problem; complexity; branch-and-bound; CPLEX

Abstract:
We study the Container Storage Problem in port terminal (CSP), which consists to effectively manage the storage space so as to increase the productivity of port. When a ship arrives, the inbound containers are unloaded by Quay Cranes (QC) and then placed on quays. So, they are collected by Straddle Carriers (SC). Each is able to carry one container at a time, and store it in its storage location. In order to reduce the waiting times of ships, we propose a mathematical model which minimizes the total distance traveled by SC between quays and container yards. In this paper, we take into account additional constraints which are not considered previously. We also propose an effective branch-and-cut algorithm (BC-CSP), which is an optimal resolution method. Performed simulations prove the effectiveness of our algorithm.

Pages: 226 to 233

Copyright: Copyright (c) IARIA, 2014

Publication date: February 23, 2014

Published in: conference

ISSN: 2308-4243

ISBN: 978-1-61208-319-3

Location: Nice, France

Dates: from February 23, 2014 to February 27, 2014