Towards A Decision Support System for Optimization of Container Placement in a Container Terminal

Towards A Decision Support System for Optimization of Container Placement in a Container Terminal

Zakaria Bendaoud, Khadidja Yachba
Copyright: © 2017 |Pages: 14
DOI: 10.4018/IJSITA.2017070104
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Maritime transport moves a majority of the goods and global trade around the globe. This mode of transport involves loading and unloading of containers at ports. Upon arrival at a port, the ships remain inactive during the operations of loading and unloading. The terminal operator receives a schedule indicating the dates of loading and unloading of containers and their locations in the storage areas. Once berthing takes place, ships are unloaded by gantry cranes to the handling area, where the containers are then collected for transfer to storage areas or buffer zones. Container terminals are essential inter-modal interfaces for the worldwide transportation network. An optimal location for a container terminal is very important for the operators and companies as it can minimize the number of unnecessary movements within the storage area and the terminal, which can reduce transportation costs. In this work, the authors propose a container placement problem and a solution approach through a model for decision support that can solved and optimized for the storage space available. In other words, a model that minimizes the total number of unnecessary movements, while respecting the dynamic constraints of space and time.
Article Preview
Top

In this section, the authors offer some of the work in this area. Numerous researches has been done to solve the problem of storage containers, for example the work of Kim and Kim (1997) which provides a planning container loading sequences to export from a sea port. The latter was made using an optimal routing algorithm.

Dubreuil (2008) uses an intelligent transport system for treating container transition problem in port.

Gazdar (2008) uses the greedy heuristics under a multi-agent architecture to optimize the storage of containers. Ndeye et al. (2010) proposed a new formulation as a problem of assignments minimal cost. In this work an improvement of a mathematical model eliminates rework by storing in each stack the containers following descending order of their starting dates.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing