scholarly journals Weighted Goal Programming model for Storage Space Allocation problem in a container terminal : A

2020 ◽  
Vol 5 (2) ◽  
pp. 6-21
Author(s):  
Maryam Dhahri ◽  
Mouna Mezghani ◽  
Ines Rekik
Keyword(s):  
Goal Programming ◽  
Programming Model ◽  
Container Terminal ◽  
Allocation Problem ◽  
Storage Space ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
Weighted Goal Programming ◽  
Goal Programming Model

Optimizing Solution for Storage Space Allocation Problem in Container Terminal Using Genetic Algorithm

2016 ◽  
pp. 159-184
Author(s):  
Gamal Abd El-Nasser A. Said ◽  
El-Sayed M. El-Horbaty
Keyword(s):  
Genetic Algorithm ◽  
Service Time ◽  
Container Terminal ◽  
Study Data ◽  
Allocation Problem ◽  
Container Terminals ◽  
Storage Space ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
Np Hard Problem

Seaport container terminals are essential nodes in sea cargo transportation networks. In container terminal, one of the most important performance measures in container terminals is the service time. Storage space allocation operations contribute to minimizing the vessel service time. Storage space allocation problem at container terminals is a combinatorial optimization NP-hard problem. This chapter proposes a methodology based on Genetic Algorithm (GA) to optimize the solution for storage space allocation problem. A new mathematical model that reflects reality and takes into account the workload balance among different types of storage blocks to avoid bottlenecks in container yard operations is proposed. Also the travelling distance between vessels berthing positions and storage blocks at container yard is considered in this research. The proposed methodology is applied on a real case study data of container terminal in Egypt. The computational results show the effectiveness of the proposed methodology.

scholarly journals Storage Space Allocation of Inbound Container in Railway Container Terminal

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Li Wang ◽  
Xiaoning Zhu ◽  
Zhengyu Xie
Keyword(s):  
Container Terminal ◽  
Solution Algorithm ◽  
Allocation Problem ◽  
Container Terminals ◽  
Optimization Models ◽  
Rolling Horizon ◽  
Storage Space ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
Efficient Storage

Efficient storage strategy of railway container terminals is important in balancing resource utilization, reducing waiting time, and improving handling efficiency. In this paper, we consider the formulation and solution algorithm for storage space allocation problem of inbound containers in railway container terminal. The problem is formulated as two-stage optimization models, whose objectives are balancing the workload of inbound containers and reducing the overlapping amounts. An algorithm implement process based on rolling horizon approach is designed to solve the proposed models. Computational experiments on an actual railway container terminal show that the proposed approach is effective to solve space allocation problem of inbound container and is significant for the operation and organization of railway container terminals.

scholarly journals A Novel Two-Stage Heuristic for Solving Storage Space Allocation Problems in Rail–Water Intermodal Container Terminals

Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1229 ◽  
Author(s):  
Chang ◽  
Zhu
Keyword(s):  
Simulated Annealing Algorithm ◽  
Allocation Problem ◽  
Container Terminals ◽  
Storage Space ◽  
Two Stage ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
Annealing Algorithm ◽  
Stage 1 ◽  
Railway Operation

In the past, most researchers have paid attention to the storage space allocation problem in maritime container terminals, while few have studied this problem in rail–water intermodal container terminals. Therefore, this paper proposes a storage space allocation problem to look for a symmetry point between the efficiency and effectivity of rail–water intermodal container terminals and the unbalanced allocations and reallocation operations of inbound containers in the railway operation area, which are two interactive aspects. In this paper, a two-stage model on the storage space allocation problem is formulated, whose objective is to balance inbound container distribution and minimize overlapping amounts, considering both stacking principles, such as container departure time, weight and stacking height, and containers left in railway container yards from earlier planning periods. In Stage 1, a novel simulated annealing algorithm based on heuristics is introduced and a new heuristic algorithm based on a rolling horizon approach is developed in Stage 2. Computational experiments are implemented to verify that the model and algorithm we introduce can enhance the storage effect feasibly and effectively. Additionally, two comparison experiments are carried out: the results show that the approach in the paper performs better than the regular allocation approach and weight constraint is the most important influence on container storage.

Sign in / Sign up

Export Citation Format

Share Document