BI-OBJECTIVE BERTH–CRANE ALLOCATION PROBLEM IN CONTAINER TERMINALS DEN I Z OZ DE M IR AND EV RIMUR SAVA S

2014 ◽  
pp. 106-127
Keyword(s):  
Allocation Problem ◽  
Container Terminals

Optimal berth allocation under regular and emergent vessel arrivals

2020 ◽  
pp. 147509022093788
Author(s):  
Abbas Al-Refaie ◽  
Hala Abedalqader
Keyword(s):  
Waiting Time ◽  
Container Terminal ◽  
Allocation Problem ◽  
Container Terminals ◽  
Future Research ◽  
Satisfaction Level ◽  
Berth Allocation ◽  
Scheduling Problems ◽  
Berth Allocation Problem ◽  
Quay Crane Assignment

This research proposes two optimization models to deal with the berth allocation problem. The first model considers the berth allocation problem under regular vessel arrivals to minimize the flow time of vessels in the marine container terminal, minimize the tardiness penalty costs, and maximize the satisfaction level of vessels’ operators on preferred times of departure. The second model optimizes the berth allocation problem under emergency conditions by maximizing the number of assigned vessels, minimizing the vessel’s waiting time, and maximizing the satisfaction level on the served ships. Two real examples are provided for model illustration under regular and emergent vessel arrivals. Results show that the proposed models effectively provide optimal vessel scheduling in the terminal, reduce costs at an acceptable satisfaction level of vessels’ operators, decrease the waiting time of vessels, and shorten the delay in departures under both regular and emergent vessel arrivals. In conclusion, the proposed models may provide valuable assistance to decision-makers in marine container terminals on determining optimal berth allocation under daily and emergency vessel arrivals. Future research considers quay crane assignment and scheduling problems.

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 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.

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 The outbound container slot allocation based on the stowage plan in rail–water intermodal container terminals

2019 ◽  
Vol 52 (5-6) ◽  
pp. 509-525 ◽  
Author(s):  
Yimei Chang ◽  
Xiaoning Zhu ◽  
Ali Haghani
Keyword(s):  
Influence Factor ◽  
Planning Horizon ◽  
Allocation Problem ◽  
Container Terminals ◽  
Slot Allocation ◽  
Allocation Model ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
Proposed Model ◽  
Stowage Plan

In the past, most researchers focused on the storage space allocation problem or container block allocation problem in maritime container terminals, while few studied the container slot allocation problem in rail–water intermodal container terminals. Container slot allocation problem is proposed to reduce relocation operations of containers in railway container yards and improve the efficiency of rail–water intermodal container terminals. In this paper, a novel outbound container slot allocation model is introduced to reduce the rehandling operations, considering stowage plan, containers left from earlier planning periods and container departure time. A novel heuristic algorithm based on the rolling planning horizon approach is developed to solve the proposed problem effectively. Computational experiments are carried out to validate that the proposed model and algorithm are feasible and effective to enhance the storage effect. Meanwhile, some other experiments are conducted to verify that our approach is better than the regular allocation approach, which is a common method in marine and railway container terminals, and container weight is the most important influence factor when storing containers.

Research on Space Allocation Problem of Export Yard in Container Terminals

2014 ◽  
Vol 543-547 ◽  
pp. 4202-4207
Author(s):  
Hong Tao Xu ◽  
Yan Yang ◽  
Kai Yin ◽  
Jiang Wang
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Allocation Problem ◽  
Container Terminals ◽  
Space Allocation ◽  
Workload Imbalance ◽  
Objective Model ◽  
Efficacy Coefficient Method ◽  
Coefficient Method ◽  
Single Objective

A multi-objective model is proposed, for export yard space allocation problem in container terminals, with the objectives to minimize the total distance to transport containers and the workload imbalance between blocks. An improved linear efficacy coefficient method is proposed to deal with both objectives in order to formulate the problem as a single-objective integer programming model.

Sign in / Sign up

Export Citation Format

Share Document