Cuckoo Search for the Resolution of the Container Storage Problem

Cuckoo Search for the Resolution of the Container Storage Problem

Khadidja Yachba, Larbi Roufaida, Bounab Fatima El Batoul
Copyright: © 2022 |Pages: 14
DOI: 10.4018/IJOCI.301560
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This article addresses the problem of storing containers in a seaport. The authors introduce a technique for solving this problem based on a bio inspired optimization method (Cuckoo search), this method results in an assignment that identifies for each container an optimal location in the storage area. For better management of this area, the proposed approch opt for minimizing the number of unnecessary movements during the loading or unloading of containers. In this article, the authors take into consideration three containts : the departure date of container, the cost of storage and the number of movements.
Article Preview
Top

Introduction

Containerization is the use of containers in the transport of goods in maritime transport. This process began in the 1960s and became global in the 1980s. It aims to reduce shipping costs by minimizing handling costs. Containerization consists of storing goods in containers of different standardized sizes. The purpose of this process is to facilitate storage and improve the efficiency and speed of transport by reducing packaging and handling requirements at all points of transfer between the port, rail and road tracks. Containerization has played an important role in the increase in global maritime traffic.

Nowadays, all Port managers in the world are facing a serious challenge such as the best management of the container storage area.

In this article, the authors focus on the problem of storing containers in a seaport. As a result, several questions arise:

  • -

    How can we ensure better movement of the containers in the storage area?

  • -

    How to determine the correct location for the containers in the storage area arriving at a terminal? And who are staying temporarily?

  • -

    How to minimize the waiting time for ships?

  • -

    How should we proceed to reduce storage costs?

  • -

    How should we proceed in order to increase the storage capacities?

All these questions arise at the level of the various activities carried out in a container port, and constitute objectives of concern to theorists and practitioners.

The objective of this work is to minimize the cost and increase the efficiency of transport companies by minimizing the time occupied by a container or a ship in a port. This amounts to revising the placement of containers in the storage area (taking into account the arrival of ships or import containers) by minimizing the number of unnecessary movements by taking into account constraints such as: the departure date of of the container, the torage cost sand the number of movements.

In this work, the main objective is to find a solution for the container storage problem in the seaport by developing a bio inspired optimization method that decreases the cost and increases the efficiency of the transport companies by minimizing the time occupied by a container or ship in a port.

This article is structured as follows: the authors start with a state of the art on the container storage problem explaining recent research in this area followed by the proposed approach. In section 3, the authors detail a case study of the experimentation part of this work followed by a comparative study. The authors end with a conclusion on the proposed work and some futurs research directions .

Top

Literature Review

The management of the storage area has attracted the attention of researchers and a significant effort has been made in this area. The container storage problem is one of NP difficult problems

In this section the authors present recent works related to the container storage problem, and make an analysis of the literature related to this work. These works are presented in chronological order.

Yachba et al (2016): the authors of this work, dealed with the container storage problem using the genetic algorithm and taking into account the constraints such as: the distance and the type of containers, a particular type of containers has been treated in this work (hazardous containers) (Yachba et al, 16).

Gang et al (2016) Proposed the linear programming algorithm and the heuristic approach, the authors of this work concluded that the heuristic approach is more efficient than CPLEX which produces solutions in a few minutes and allows to reduce costs (Gang et al, 2016).

Huang et al (2017) studied the problem of stowage of container ships, They presented GRASP (Greedy Randomized Adaptive Search Procedure) which is an evolutionary heuristic algorithm to solve the problem of stowage planning. The approaches were able to find high quality planning solutions in two seconds (Huang et al.,17).

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022)
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing