Multiple Equipment Integrated Scheduling and Storage Space Allocation in Rail–Water Intermodal Container Terminals Considering Energy Efficiency

2019 ◽  
Vol 2673 (3) ◽  
pp. 199-209 ◽  
Author(s):  
Yijia Yang ◽  
Xiaoning Zhu ◽  
Ali Haghani
Keyword(s):  
Energy Consumption ◽  
Large Scale ◽  
Operation Time ◽  
Container Terminals ◽  
Optimization Approach ◽  
Storage Space ◽  
Integrated Scheduling ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
And Storage

The rail–water coordinated operation area in a container terminal is the key place to operate the transshipment of intermodal containers between the rail and the sea—the handling efficiency in which can affect the overall transport turnover efficiency. A complicated operational process for various handling equipment exists in this coordinated operation area and can lead to a large amount of energy consumption and environmental pollution. This study proposes an integrated optimization approach to manage the multiple equipment integrated scheduling and storage space allocation problem in an energy-efficient way. A bi-objective optimization model is proposed to minimize the overall operation time and energy consumption, in which the handling operations of imported and exported intermodal containers are considered simultaneously. A genetic algorithm based heuristic algorithm is developed to solve the problem. Results from computational experiments indicate the feasibility and effectiveness of the proposed model and algorithm, verifying that a near-optimum solution can be obtained for large-scale problems efficiently, which contributes to the improvement of operation services in rail–water intermodal container terminals.

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 Storage allocation in a warehouse based on the forklifts fleet availability

2018 ◽  
Vol 12 (2) ◽  
pp. 127-135 ◽  
Author(s):  
Iman Ghalehkhondabi ◽  
Dale T Masel
Keyword(s):  
Operation Time ◽  
Working Hours ◽  
Storage Space ◽  
Storage Allocation ◽  
Efficient Utilization ◽  
Product Allocation ◽  
Allocation Model ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
Proposed Model

Product allocation is one of the most important duties in warehousing operations. Based on the time and the number of products to put away and retrieve, storage allocation can directly affect the efficiency of a warehouse in terms of both response and operation time. Traditionally, the product storage allocation is done based on the less distance of shipment but focusing on distance may decrease the efficiency of a warehouse in terms of efficient utilization of resources such as warehouse inbound shipping fleet. This paper proposes a storage space allocation model that considers the availability of forklift fleet in a warehouse instead of product shipping distance. The numerical example shows that storing the products based on the proposed model can reduce the volume of forklift fleet idle hours on days with fewer volume of receiving and shipping outs. The proposed model also reduces the overtime working hours on days with higher volume of receiving and shipping out products.

scholarly journals Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

2017 ◽  
Vol 2017 ◽  
pp. 1-13
Author(s):  
Ming Zeng ◽  
Wenming Cheng ◽  
Peng Guo
Keyword(s):  
Safety Margin ◽  
Allocation Problem ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Storage Space ◽  
Crane Scheduling ◽  
Operation Conditions ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
And Storage

The gantry crane scheduling and storage space allocation problem in the main containers yard of railway container terminal is studied. A mixed integer programming model which comprehensively considers the handling procedures, noncrossing constraints, the safety margin and traveling time of gantry cranes, and the storage modes in the main area is formulated. A metaheuristic named backtracking search algorithm (BSA) is then improved to solve this intractable problem. A series of computational experiments are carried out to evaluate the performance of the proposed algorithm under some randomly generated cases based on the practical operation conditions. The results show that the proposed algorithm can gain the near-optimal solutions within a reasonable computation time.

Storage space allocation in container terminals

2003 ◽  
Vol 37 (10) ◽  
pp. 883-903 ◽  
Author(s):  
Chuqian Zhang ◽  
Jiyin Liu ◽  
Yat-wah Wan ◽  
Katta G Murty ◽  
Richard J Linn
Keyword(s):  
Container Terminals ◽  
Storage Space ◽  
Space Allocation ◽  
Storage Space Allocation
Sign in / Sign up

Export Citation Format

Share Document