# Stowage Plan Based Slot Optimal Allocation in Rail-Water Container Terminal

Authors: Yanjing Li; Xiaoning Zhu; Li Wang; Xi Chen
Journal: Journal of Control Science and Engineering
 (2017)

---

## Abstract

To obtain an efficient and reasonable solution for slot allocation in rail-water container terminals, this paper develops storage optimal allocation model 1 to improve the yard space utilization, which is solved by a heuristic algorithm based on Tabu search. Model 2 is then built to reduce the relocation movements. A concept of fall-down problem in shunting operation plan is thus proposed to solve model 2. Models 1 and 2 are tested with numerical experiments. The results show that the yard space utilization increases by 50% approximately compared to the strategy of one train piling onto a fixed area called a subblock. Meanwhile the number of container relocation movements is less than five when using the fall-down problem strategy. Accordingly, the models and algorithms developed in this paper are effective to improve the yard space utilization and reduce the number of container relocation movements.


---

## Body

## 1. Introduction

The process of container handling in rail-water container terminal can be divided into two parts. In the first part, containers are piled to a certain area in yard space when arriving at the terminal. Generally, there are three types of containers in the storage yard of container terminals, namely, import, export and transshipment containers. Each type of container has its own particular characteristics (as shown in Figure1), and, what is more, the transshipment containers unloaded from one block container train will be subsequently loaded onto different block container trains, whose operation process is in conformity with export and import containers. Thus, transshipment containers are not considered in this paper.Figure 1
Number of containers for vessel at storage yard.t1: starting time of unloading containers from a certain vessel; t2: starting time of loading containers onto several trains; t3: ending time of loading containers onto several trains; t1′: ending time of unloading containers from several trains; t2′: starting time of loading containers onto a vessel; t3′: ending time of loading containers onto a vessel.In the second part, containers piled at the yard space should be retrieved and loaded onto a vessel in accordance with the stowage plan. Containers with highest retrieval priority should be piled at the top of a stack, where containers are piled vertically. As is shown in Figures2 and 3, container yard in a rail-water container terminal consists of several blocks. The length of each block is comprised of several parallel bays; each bay is composed of a number of stacks. Containers in a certain bay should be unloaded from one train and loaded onto one vessel. But the piling mixed storage solution is meant to pile containers that are to be loaded onto different vessels in a group of bays in different time. Piling separated storage solution means containers from different trains are piled onto different areas. Taking the land scarcity into consideration, piling mixed storage solution is generally preferred with its advantage in improving yard space utilization.Figure 2
The top view of yard space.Figure 3
The schematic diagram of a block.The present research mainly focuses on (1) balancing workloads of containers among blocks when containers are unloaded from a train onto the yard space (as discussed by [1–3]), (2) taking full utilization of single equipment or several equipment (as discussed by [4, 5]) and improving land utilization (as discussed by [6, 7]), and (3) reducing the number of overlapping amounts or relocation movements among the bays (as discussed by [8–13]) and solving the storage space allocation problems (as discussed by [4, 14–18]). Pursuit of improving the utilization of yard space leads to an increase in relocation movement. So in order to reduce the number of relocation movements among bays when taking into account the utilization of yard space, it is essential to consider the slot optimal allocation. Here, we set two stages to process the optimization. The first stage is meant to enlarge the number of containers from different trains in each bay during the planning horizon. The second stage is to minimize the number of relocation movements among bays considering the loading process when the vessel is coming.The two common indexes for evaluating the container relocation problem can be described as overlapping amount and the relocation movement. The overlapping amount is the number of containers placed above a container retrieved earlier among all the stacks. Relocation movement is the number of containers picked up from the top of a stack and put onto another stack in order to retrieve the highest retrieval priority at present. The retrieval priorities of containers are determined by ship stowage plan.There are two aspects of this paper when it comes to originality and novelty, namely, the land utilization improvement strategy and the algorithm of reducing relocation movements by referring to the fall-down problem in shunting operation plan.Firstly, when containers which will be loaded onto one vessel arrive at the terminal, conventional approach is to allocate them onto one fixed area called subblock, and one subblock can only allocate containers belonging to one vessel. Another approach presented in 2012 allocated containers belonging to one vessel onto a subblock consisting of fixed area and shared area. Containers from neighbor subblock can be allocated onto the shared area as long as the shared area is not occupied at the same time. The piling strategy in this paper is to allocate containers belonging to one vessel onto an uncertain area whose size is variable according to the number of containers, and the container occupancy times of the same bays are different; this strategy can be called optimal allocation within the range of space and time.Secondly, the solving algorithm is proposed by referring to the concept of fall-down problem in shunting operation plan to solve model 2. According to the principle of classification of shunting operations of trains, train detaching and attaching fall-down problem is abstracted as a sequencing problem. When the train detaching and attaching is marshalling after arriving at the terminal, the random-ordered wagon groups formed from the train stock should be turned into ordered wagon groups using the method of humping the random-ordered wagon groups into different tracks; this process can avoid remarshalling when arriving at next station.A container can be considered as a minimum unit of a train in this algorithm; containers arriving at the terminal earlier and having a higher retrieval priority can be regarded as the random-ordered containers; the random-ordered containers should also be turned into ordered containers using the method of allocating to different stacks; if the number of containers reached the volume of the stack, the containers should be allocated onto another stack which is different from the fall-down problem in shunting operation plan. This approach is only used in shunting operation plan and is never used in slot optimal allocation problem. Here, we firstly use this approach to solve the slot optimal allocation.


## 2. Problem Statement

In this paper, we consider that containers unloaded from several trains onto yard space are to be loaded onto one vessel directly omitting the front storage yard, and the containers are usually stored adjacent to one another to facilitate the loading process. Conversely, since the yard cranes can assign loading operation simultaneously, containers unloaded from a vessel are usually stored separately. At the beginning, a group of bays are empty, and they are gradually filled by incoming containers from a certain train. After loading all the containers onto the vessel, the bays return empty. As shown in Figure4, the consecutive bays are reserved for a certain vessel, while other containers can be assigned to these bays if only they are occupied in different times.Figure 4
The piling strategy of storage yard.The current space-sharing concept has two strategies, namely, nonsharing strategy and flexible space-sharing strategy. In the former strategy, each subblock is dedicated to one destination vessel, and the container space can be shared by two different vessels as long as their containers do not occupy the space at the same time in the latter one [7]. This paper proposed a completely flexible space-sharing strategy. In this strategy, the number of bays belonging to a certain block varies by the number of containers to be loaded onto a vessel. Each bay can pile any vessels as long as the containers do not occupy the space at the same time.After choosing which bay to allocate containers, the following process is to pile containers to certain stacks. As Figure5 shows, one rectangle represents one container, and the number on it represents its retrieval priority. And a larger number indicates a higher retrieval priority. In order to reduce relocation movements, number 8 in third stack should be loaded firstly but number 6 is over it, so number 6 can be moved from the third stack to first or second or sixth stack. When stacking on sixth stack, the second relocation is evitable.Figure 5
Optimization position of relocation movement.Containers from one vessel are to be unloaded onto several destinations. In each stack, containers retrieval priority varies with the distance of their destination: the farther the destination is, the higher the retrieval priority it has; when it comes to containers with the same destination, heavier containers get the higher retrieval priority according to the stowage plan. Since the destination plays a more important role than the weight in each stack, the level of retrieval is estimated byG=10∗d+w, in which G is represented for the retrieval priority, d is in the name of the grade of destination, and w is the level of container weight.


## 3. Model Formulations

The following assumptions are introduced for the development of mathematical models:(1)
The arriving time of each train and the amount of containers are determined and known.(2)
The departure time of every vessel and the amount of containers are determined and known.(3)
Each slot can accommodate one 20 ft container.Notations which will be used throughout this paper are shown in “Notations.”


### 3.1. Land Utilization Improvement Strategy

(1) Objective (1) m a x  min ⁡ S k k + 1 t + S k + 1 k t ,  ∀ 1 ≤ k ≤ K - 1 ,   1 ≤ t ≤ T .The block can be shared by some vessels or trains as long as their containers do not occupy the space at the same time. In this model, it means if the containers going to the same vessel are to be stored in one block with insufficient bays to be piled, the containers can be piled at adjacent bays. The objective is to maximize the sharing yard space at the neighbor blocks.(2) Constraints (2) S k k + 1 t ≤ C P k - U k t , k = 1 ,   ∀ 1 ≤ t ≤ T , C P k - U k t - S k k - 1 t , ∀ 2 ≤ k ≤ K - 1 ,   ∀ 1 ≤ t ≤ T , S k + 1 k t ≤ C P k - U k + 1 t - S k + 1 k + 2 t , ∀ 1 ≤ k ≤ K - 2 ,   ∀ 1 ≤ t ≤ T , C P k - U k + 1 t , k = K - 1 ,   ∀ 1 ≤ t ≤ T .Each block has two neighbor blocks except the two blocks at the end of the yard space which only have one neighbor, so the number of bays which can accommodate containers in blockk and block k+1 in shift t is described in constraints (2). (3)∑b=1Brkb1+ckb1×ekb1t+∑b=1B∑t′=2tckbt′×ekbt′t=∑b=1BEkbt,1≤t≤T,1≤k≤K,(4)rkb1+ckb1×ekb1t+∑t′=2tckbt′×ekbt′t=Ekbt,1≤t≤T,1≤k≤K,1≤b≤B.The number of containers in each bay (or block) consists of the existing containers piled in each bay (or block) and the arriving containers that will be piled in the bay (or block). Constrains (3) calculate the containers in a block at the end of shift under consideration. Constrains (4) calculate the containers in a bay at the end of shift under consideration. (5)S1,2t+∑k=2K-1Skk+1t+Skk-1t+SKK-1t≤K×CP-∑k=1K∑b=1Bekbt′t,1≤t′≤t-1,1≤t≤T.A bay can accommodate containers only if the bay is empty. Constraints (5) calculate the maximum number of bays.(6)eknt×∑n=1Ngnt≤1,1≤k≤K,1≤b≤B,1≤t≤T,1≤∑k=1K∑b=1Beknt×gnt≤x,Ngntvb+1≤x≤X,1≤n≤N,1≤t≤T.Containers unloaded from a block container train are usually stored in different bays or even different blocks according to the different destination, while a bay can only stack containers from one block container train, as described in constraints (6).(7)ekntt′×∑m=1Mhmt′≤1,1≤k≤K,1≤b≤B,1≤t′≤T,1≤∑k=1K∑b=1Bekntt′×hmt′≤y,Nhmt′vb+1≤y≤Y,1≤m≤M,1≤t′≤T.Conversely, the containers to be loaded on a vessel are usually stored together, and a bay can only stack containers to be loaded on one vessel; see constraints (7). (8)∑b=1BEkbt≤Vk,1≤k≥K,1≤t≤T,(9)Ekbt≤Vb,1≤k≥K,1≤t≤T,1≤b≤B.Constraints (8) calculate the total amount of containers in a certain block. Constraints (9) calculate the total amount of containers in a certain bay.


### 3.2. Relocation Movement Reduction Strategy

(1) Objective (10) m i n  ∑ z = 1 Z W z 0 + ∑ l = 1 L W z l - W z l - 1 .In this section, we assume that the problem of retrieving containers is in a single bay. Retrieving containers is managed according to retrieval priority under the consideration of the stowage plan. That is to say, containers from a certain vessel have different destinations: the farther they travel or the heavier they weigh, the higher they should be piled in a stack. The objective is to minimize the further movements.(2) Constraints (11) W z l = ∑ x = 1 J - j 1 R z j 1 - R z j 1 + x + ∑ x = 1 j n - 1 - j n - 1 R z j n - R z j n + x ,  1 ≤ z ≤ Z .The containers retrieval follows the rule of “first in last out” in the same stack. And a container at the top of a stack can be retrieved and relocated to other stacks among the bay, only if the container under it has a higher retrieval priority. Constraints (11) commit to calculating the relocation movements considering loading and unloading process. The overlapping amounts may change when container is relocated to other stacks, so it should be recalculated.(12)Wzl-Wzl-1≤Welsel-Welsel-1,1≤z≤Z,1≤l≤L.A container can be moved to another stack in the same bay if it is not fully occupied. Since overlapping amounts will probably increase, which stack to pile is a matter of cardinal significance, as constraints (12) describe.(13)dzj≥dzj+1,1≤z≤Z,1≤j≤J-1.Containers are piled vertically in each stack. If there is no container at the bottom of a stack, all containers cannot be placed above it. It means the container has to be piled from bottom to top in a certain stack. Constraints (13) show the rule of piling containers among stack.


## 3.1. Land Utilization Improvement Strategy

(1) Objective (1) m a x  min ⁡ S k k + 1 t + S k + 1 k t ,  ∀ 1 ≤ k ≤ K - 1 ,   1 ≤ t ≤ T .The block can be shared by some vessels or trains as long as their containers do not occupy the space at the same time. In this model, it means if the containers going to the same vessel are to be stored in one block with insufficient bays to be piled, the containers can be piled at adjacent bays. The objective is to maximize the sharing yard space at the neighbor blocks.(2) Constraints (2) S k k + 1 t ≤ C P k - U k t , k = 1 ,   ∀ 1 ≤ t ≤ T , C P k - U k t - S k k - 1 t , ∀ 2 ≤ k ≤ K - 1 ,   ∀ 1 ≤ t ≤ T , S k + 1 k t ≤ C P k - U k + 1 t - S k + 1 k + 2 t , ∀ 1 ≤ k ≤ K - 2 ,   ∀ 1 ≤ t ≤ T , C P k - U k + 1 t , k = K - 1 ,   ∀ 1 ≤ t ≤ T .Each block has two neighbor blocks except the two blocks at the end of the yard space which only have one neighbor, so the number of bays which can accommodate containers in blockk and block k+1 in shift t is described in constraints (2). (3)∑b=1Brkb1+ckb1×ekb1t+∑b=1B∑t′=2tckbt′×ekbt′t=∑b=1BEkbt,1≤t≤T,1≤k≤K,(4)rkb1+ckb1×ekb1t+∑t′=2tckbt′×ekbt′t=Ekbt,1≤t≤T,1≤k≤K,1≤b≤B.The number of containers in each bay (or block) consists of the existing containers piled in each bay (or block) and the arriving containers that will be piled in the bay (or block). Constrains (3) calculate the containers in a block at the end of shift under consideration. Constrains (4) calculate the containers in a bay at the end of shift under consideration. (5)S1,2t+∑k=2K-1Skk+1t+Skk-1t+SKK-1t≤K×CP-∑k=1K∑b=1Bekbt′t,1≤t′≤t-1,1≤t≤T.A bay can accommodate containers only if the bay is empty. Constraints (5) calculate the maximum number of bays.(6)eknt×∑n=1Ngnt≤1,1≤k≤K,1≤b≤B,1≤t≤T,1≤∑k=1K∑b=1Beknt×gnt≤x,Ngntvb+1≤x≤X,1≤n≤N,1≤t≤T.Containers unloaded from a block container train are usually stored in different bays or even different blocks according to the different destination, while a bay can only stack containers from one block container train, as described in constraints (6).(7)ekntt′×∑m=1Mhmt′≤1,1≤k≤K,1≤b≤B,1≤t′≤T,1≤∑k=1K∑b=1Bekntt′×hmt′≤y,Nhmt′vb+1≤y≤Y,1≤m≤M,1≤t′≤T.Conversely, the containers to be loaded on a vessel are usually stored together, and a bay can only stack containers to be loaded on one vessel; see constraints (7). (8)∑b=1BEkbt≤Vk,1≤k≥K,1≤t≤T,(9)Ekbt≤Vb,1≤k≥K,1≤t≤T,1≤b≤B.Constraints (8) calculate the total amount of containers in a certain block. Constraints (9) calculate the total amount of containers in a certain bay.


## 3.2. Relocation Movement Reduction Strategy

(1) Objective (10) m i n  ∑ z = 1 Z W z 0 + ∑ l = 1 L W z l - W z l - 1 .In this section, we assume that the problem of retrieving containers is in a single bay. Retrieving containers is managed according to retrieval priority under the consideration of the stowage plan. That is to say, containers from a certain vessel have different destinations: the farther they travel or the heavier they weigh, the higher they should be piled in a stack. The objective is to minimize the further movements.(2) Constraints (11) W z l = ∑ x = 1 J - j 1 R z j 1 - R z j 1 + x + ∑ x = 1 j n - 1 - j n - 1 R z j n - R z j n + x ,  1 ≤ z ≤ Z .The containers retrieval follows the rule of “first in last out” in the same stack. And a container at the top of a stack can be retrieved and relocated to other stacks among the bay, only if the container under it has a higher retrieval priority. Constraints (11) commit to calculating the relocation movements considering loading and unloading process. The overlapping amounts may change when container is relocated to other stacks, so it should be recalculated.(12)Wzl-Wzl-1≤Welsel-Welsel-1,1≤z≤Z,1≤l≤L.A container can be moved to another stack in the same bay if it is not fully occupied. Since overlapping amounts will probably increase, which stack to pile is a matter of cardinal significance, as constraints (12) describe.(13)dzj≥dzj+1,1≤z≤Z,1≤j≤J-1.Containers are piled vertically in each stack. If there is no container at the bottom of a stack, all containers cannot be placed above it. It means the container has to be piled from bottom to top in a certain stack. Constraints (13) show the rule of piling containers among stack.


## 4. Solution Algorithms

The reason for proposed algorithm is that our study’s problem belongs to the quay crane scheduling problem which was proven to be NP-complete by [19, 20]; the problem cannot be exactly solved in reasonable time. So we propose a heuristic algorithm to obtain the approximate optimal solution. And Tabu search is dramatically changing our ability to solve a host of problems in applied science and engineering. Tabu search has important links to evolutionary and “genetic” methods, often overlooked. The adaptive memory designs of Tabu search have also provided useful alternatives and supplements to the types of memory embodied in neural networks, allowing enhancements of neural network processes in practical settings.So this section presents a Tabu search algorithm for improving the land utilization problem and a solving algorithm designed by referring to the concept of fall-down problem of shunting operation plan for reducing the relocation movements.


### 4.1. Tabu Search Algorithm

The procedures of the Tabu search algorithm are as follows.Step 1.
Initial solutionx∗ is described as the optimal solution; namely, x=x∗; then the objective function value can be calculated as z∗=zx∗; the Tabu list is empty; namely, TaBuList=⌀; turn to Step 2.Step 2.
If the termination criterion is met, turn to Step10; else turn to Step 3.Step 3.
Generate neighborhood spaces ofx as Nx and select a number of solutions as the candidate solution, namely, candidateSolutionx; turn to Step 4.Step 4.
IfcandidateSolutionx=⌀, turn to Step 3; else turn to Step 5.Step 5.
If there is an optimal solution incandidateSolutionx, namely, zy≥zx, turn to Step 6; else turn to Step 2.Step 6.
Ify∈TaBuList, turn to Step 7; else turn to Step 8.Step 7.
c a n d i d a t e S o l u t i o n x = c a n d i d a t e S o l u t i o n x - y, y=⌀; turn to Step 2.Step 8.
Ifzy≥z∗, then z∗=zy; x∗=y; turn to Step 9; else turn to Step 5.Step 9.
Update Tabu list; namely,TaBuList=TaBuList+y; turn to Step 10.Step 10.
Output optimal solutionx∗ and the objective function value z∗=zx∗.The initial solution for Tabu algorithm affects the efficiency of the optimal solution. A group of solutions expressed piling state of containers to be loaded onto each vessel in each shift during planning horizon. The solution is described asst=Tj1,Tj2,…,Tji,…,Tjn; Tji is shown as Tji=Tb1jit1,Tb2jit2,…,Tbxjitx′, which is meant to describe the piling state of containers which are to be loaded onto vessel ji. The match value function is shown as min⁡∑k=1K∑b=1Bekbt.The structure of neighborhood solutions determines the form and number of neighborhood solutions. Rules of generating neighborhood solutions are (1) changing the location of two or several trains and (2) removing the locations from one or several trains to another one or several trains. The rules are shown in Figure6.Figure 6
The rules of neighborhood solutions.Termination criterion of Tabu algorithms contains various methods such as the criterion of frequency control and a certain step of iteration. This paper used the latter one.


### 4.2. The Algorithm of Reducing Relocation Movements

The second algorithm is to reduce the relocation movements referring to fall-down problem in shunting operation plan; the experimental result of this algorithm is the piling state of each bay; it can be the storage plan when accommodating the containers; it turns out that the relocation movements are decreased. The algorithm of reducing relocation movement has three parts, namely, fall column stage, adjustment stage, and delivering stage. The former two stages are used to accommodate the container to slot; the last stage is to calculate the relocation movements. The procedure of the algorithm is as follows.(1) Fall Column StageStep 1.
Traverse the retrieval priority of containersil and record the minimum and maximum ones as Nmin and Nmax, search the container where il=Nmin, and then initialize the matrix row as im=1; turn to Step 2.Step 2.
Locate the retrieval priority of containeril as (im,in)=(im,it) in the matrix; record the arriving time and matrix row of last one LO as T=it and M=im; turn to Step 3.Step 3.
Updateil=il+1; if il≤Nmax, turn to Step 4; else turn to Step 9.Step 4.
If the retrieval priority of containeril also exists among the earlier arriving containers compared to LO, turn to Step 5; else turn to Step 3.Step 5.
IfT<it, (im,in)=(M,it); else (im,in)=(M+1,it); turn to Step 6.Step 6.
If there is container inM+1, turn to Step 7; else turn to Step 8.Step 7.
Update the maximum rowM=M+1 and record the last one’s arriving time T; turn to Step 3.Step 8.
Update the maximum rowM=M and record the last one’s arriving time T; turn to Step 3.Step 9.
The fall column stage ends.(2) Adjustment StageStep 1.
Initializeim=0; turn to Step 2.Step 2.
Updateim=im+1; if im>imax, turn to Step 8; else turn to Step 3.Step 3.
If the number of containers in rowim is larger than volume of each row, namely, N>j, delivering the container to another row, turn to Step 4; else turn to Step 2.Step 4.
Initializeim′=0; turn to Step 5.Step 5.
Updateim′=im′+1; if im′>imax, turn to Step 7; else turn to Step 6.Step 6.
If the number of containers in rowim is smaller than volume of each row, namely, N<j, locating the container to row im′, namely, (im,in)=(im′,in), turn to Step 7; else turn to Step 5.Step 7.
Compare all the locations that piled the retrieved container; choose a location which has the lowest relocation movements to pile; turn to Step1.Step 8.
Ifim>i, turn to Step 9; else turn to Step 14.Step 9.
Select the container of rowNmin and then retrieve the container; turn to Step 10.Step 10.
Initializeim′=0; turn to Step 11.Step 11.
Updateim′=im′+1; if im′>imax, turn to Step 13; else turn to Step 12.Step 12.
If the number of containers for rowim′ is smaller than volume of each row, namely, N<j, locating the container to row im′, namely, (im,in)=(im′,in), turn to Step 3; else turn to Step 11.Step 13.
Compare all the locations that piled the delivering container; choose a location which has the lowest relocation movements to pile; turn to Step8.Step 14.
Adjustment stage ends.(3) Retrieving StageStep 1.
Initializeil=Nmax+1; relocation movements r=0; turn to Step 2.Step 2.
Updateil=il-1; if il=Nmin, turn to Step 5; else turn to Step 3.Step 3.
If there is a container with retrieval priority ofil, turn to Step 4; else turn to Step 2.Step 4.
Search for the container with retrieval priority ofil; calculate the number (n) of containers over it in the same stack; the overlapping amount r=r+n; turn to Step 2.Step 5.
Retrieving stage ends.


## 4.1. Tabu Search Algorithm

The procedures of the Tabu search algorithm are as follows.Step 1.
Initial solutionx∗ is described as the optimal solution; namely, x=x∗; then the objective function value can be calculated as z∗=zx∗; the Tabu list is empty; namely, TaBuList=⌀; turn to Step 2.Step 2.
If the termination criterion is met, turn to Step10; else turn to Step 3.Step 3.
Generate neighborhood spaces ofx as Nx and select a number of solutions as the candidate solution, namely, candidateSolutionx; turn to Step 4.Step 4.
IfcandidateSolutionx=⌀, turn to Step 3; else turn to Step 5.Step 5.
If there is an optimal solution incandidateSolutionx, namely, zy≥zx, turn to Step 6; else turn to Step 2.Step 6.
Ify∈TaBuList, turn to Step 7; else turn to Step 8.Step 7.
c a n d i d a t e S o l u t i o n x = c a n d i d a t e S o l u t i o n x - y, y=⌀; turn to Step 2.Step 8.
Ifzy≥z∗, then z∗=zy; x∗=y; turn to Step 9; else turn to Step 5.Step 9.
Update Tabu list; namely,TaBuList=TaBuList+y; turn to Step 10.Step 10.
Output optimal solutionx∗ and the objective function value z∗=zx∗.The initial solution for Tabu algorithm affects the efficiency of the optimal solution. A group of solutions expressed piling state of containers to be loaded onto each vessel in each shift during planning horizon. The solution is described asst=Tj1,Tj2,…,Tji,…,Tjn; Tji is shown as Tji=Tb1jit1,Tb2jit2,…,Tbxjitx′, which is meant to describe the piling state of containers which are to be loaded onto vessel ji. The match value function is shown as min⁡∑k=1K∑b=1Bekbt.The structure of neighborhood solutions determines the form and number of neighborhood solutions. Rules of generating neighborhood solutions are (1) changing the location of two or several trains and (2) removing the locations from one or several trains to another one or several trains. The rules are shown in Figure6.Figure 6
The rules of neighborhood solutions.Termination criterion of Tabu algorithms contains various methods such as the criterion of frequency control and a certain step of iteration. This paper used the latter one.


## 4.2. The Algorithm of Reducing Relocation Movements

The second algorithm is to reduce the relocation movements referring to fall-down problem in shunting operation plan; the experimental result of this algorithm is the piling state of each bay; it can be the storage plan when accommodating the containers; it turns out that the relocation movements are decreased. The algorithm of reducing relocation movement has three parts, namely, fall column stage, adjustment stage, and delivering stage. The former two stages are used to accommodate the container to slot; the last stage is to calculate the relocation movements. The procedure of the algorithm is as follows.(1) Fall Column StageStep 1.
Traverse the retrieval priority of containersil and record the minimum and maximum ones as Nmin and Nmax, search the container where il=Nmin, and then initialize the matrix row as im=1; turn to Step 2.Step 2.
Locate the retrieval priority of containeril as (im,in)=(im,it) in the matrix; record the arriving time and matrix row of last one LO as T=it and M=im; turn to Step 3.Step 3.
Updateil=il+1; if il≤Nmax, turn to Step 4; else turn to Step 9.Step 4.
If the retrieval priority of containeril also exists among the earlier arriving containers compared to LO, turn to Step 5; else turn to Step 3.Step 5.
IfT<it, (im,in)=(M,it); else (im,in)=(M+1,it); turn to Step 6.Step 6.
If there is container inM+1, turn to Step 7; else turn to Step 8.Step 7.
Update the maximum rowM=M+1 and record the last one’s arriving time T; turn to Step 3.Step 8.
Update the maximum rowM=M and record the last one’s arriving time T; turn to Step 3.Step 9.
The fall column stage ends.(2) Adjustment StageStep 1.
Initializeim=0; turn to Step 2.Step 2.
Updateim=im+1; if im>imax, turn to Step 8; else turn to Step 3.Step 3.
If the number of containers in rowim is larger than volume of each row, namely, N>j, delivering the container to another row, turn to Step 4; else turn to Step 2.Step 4.
Initializeim′=0; turn to Step 5.Step 5.
Updateim′=im′+1; if im′>imax, turn to Step 7; else turn to Step 6.Step 6.
If the number of containers in rowim is smaller than volume of each row, namely, N<j, locating the container to row im′, namely, (im,in)=(im′,in), turn to Step 7; else turn to Step 5.Step 7.
Compare all the locations that piled the retrieved container; choose a location which has the lowest relocation movements to pile; turn to Step1.Step 8.
Ifim>i, turn to Step 9; else turn to Step 14.Step 9.
Select the container of rowNmin and then retrieve the container; turn to Step 10.Step 10.
Initializeim′=0; turn to Step 11.Step 11.
Updateim′=im′+1; if im′>imax, turn to Step 13; else turn to Step 12.Step 12.
If the number of containers for rowim′ is smaller than volume of each row, namely, N<j, locating the container to row im′, namely, (im,in)=(im′,in), turn to Step 3; else turn to Step 11.Step 13.
Compare all the locations that piled the delivering container; choose a location which has the lowest relocation movements to pile; turn to Step8.Step 14.
Adjustment stage ends.(3) Retrieving StageStep 1.
Initializeil=Nmax+1; relocation movements r=0; turn to Step 2.Step 2.
Updateil=il-1; if il=Nmin, turn to Step 5; else turn to Step 3.Step 3.
If there is a container with retrieval priority ofil, turn to Step 4; else turn to Step 2.Step 4.
Search for the container with retrieval priority ofil; calculate the number (n) of containers over it in the same stack; the overlapping amount r=r+n; turn to Step 2.Step 5.
Retrieving stage ends.


## 5. Numerical Experiments

In this section, numerical experiments are carried out to show the performance of land utilization improvement method and the relocation movement reduction method.There are 24 shifts and the block container train arrives at each shift during the operation horizon. The initial data include the number of containers belonging to each train, the weight of containers, and the destination of containers. The number of containers from each train is a random variable between 50 and 80. Containers of several trains belong to one vessel, as Table1 shows. The depth of each block is 6 rows, and the length of it is 30 slots. Piling height is 4 containers high in each stack.Table 1
Volume and arriving time of containers in planning horizon.
Arriving time Number of containers Vessel t = 1 54 6 t = 2 63 2 t = 3 68 4 t = 4 59 7 t = 5 55 3 t = 6 71 4 t = 7 61 4 t = 8 63 3 t = 9 52 7 t = 10 53 7 t = 11 54 3 t = 12 51 1 t = 13 69 3 t = 14 55 5 t = 15 71 5 t = 16 78 6 t = 17 67 2 t = 18 58 2 t = 19 72 1 t = 20 51 6 t = 21 53 1 t = 22 72 2 t = 23 56 5 t = 24 56 1Weight of containers of each train is a variable which approximately obeys normal distribution according to real data.w~N(21.26,3.75). As the weight of containers is shown in Table 2, the grade of container weight can be calculated into nine levels; destination of containers from each train is set as a random integer from 1 to 5 which means there are five terminals in one route. The containers’ details from the first train are shown in Table 2.Table 2
The containers’ details from first train.
Weight Grade of weight Destination 17.85 3 4 21.12 5 3 20.23 5 3 19.91 5 1 14.3 2 2 14.63 2 3 20.07 5 5 27.39 9 4 20.56 5 4 20.07 5 2 19.98 5 2 16.91 3 4 26.61 8 2 17.99 4 4 19.58 4 3 14.57 2 3 15.54 2 4 25.06 7 1 24.02 7 3 23.45 6 4 21.31 5 5 17.96 4 3 26.95 8 4 20.26 5 3 21.2 5 2 26.37 8 3 20.46 5 2 20.07 5 3 23.87 7 5 17.58 3 4 21.25 5 4 25.23 7 1 16.07 3 1 20.21 5 4 18.34 4 5 20.08 5 3 16.99 3 2 25.56 8 4 26.34 8 3 16.68 3 3 21.13 5 3 22.76 6 2 21.36 5 1 22.78 6 3 21.74 6 4 20.07 5 1 24.36 7 4 21.51 5 2 21.48 5 3 22.41 6 5 16.79 3 4 12.29 1 2 24.24 7 3 25.29 7 480 bays are needed to accommodate all the containers to be loaded on 7 vessels using the method of piling the containers onto a subblock consisting of a fixed area, as shown in Figure8; 58 bays are needed using the strategy of piling containers onto a subblock consisting of fixed area and shared area, as shown in Figure 9, while the land utilization improvement strategy in this paper only needs 39 bays, as shown in Figure 7. The results show that the yard space utilization increases by 51.25% compared to the strategy of one train piling onto a fixed area, and the yard space utilization also increases by 32.76% approximately compared to the strategy of one train piling onto a subblock consisting of fixed area and shared area.Figure 7
The piling state of containers belonging to 7 vessels using the presented method.Figure 8
The piling state of containers belonging to 7 vessels when piling onto fixed area.Figure 9
The piling state of containers belonging to 7 vessels when piling onto fixed and shared area.The containers from the first train will be loaded onto the sixth vessel. The piling state in each bay is shown in Figure10. For example, the container 2813 at stack 4 of bay 1 is represented where the container will be unloaded at the second destination and the weight of it is 8; 13 represents the arriving time. The overlapping amounts and relocation movements for three bays from the first train are shown in Table 3. And the overlapping amounts and relocation movements for each train are shown in Table 4.Table 3
Overlapping amounts and relocation movements of three stacks from first train.
Location Overlapping amount Relocation movement Stack 1 2 3 Stack 2 1 1 Stack 3 1 1Table 4
Overlapping amounts and relocation movements for each train.
t Overlapping amounts Relocation movements 1 4 5 2 4 4 3 3 2 4 3 3 5 4 3 6 2 2 7 1 1 8 2 3 9 1 1 10 4 2 11 2 2 12 3 3 13 2 2 14 4 4 15 3 3 16 4 3 17 2 2 18 4 3 19 5 4 20 4 3 21 1 1 22 2 1 23 4 3 24 1 1Figure 10
The piling state from bay 1 to bay 3 from first train.It was found that slot optimal allocation contributes to reducing relocation movements and making the most use of container yard space. When the number of containers belonging to each vessel increased at every shift, the yard space utilization is improved slightly, and the relocation movements are increased as well. The yard space utilization remains stable but the relocation movements are increased rapidly, when the distances to destination (presented as numbers 1 to 5) and the grades of container weight (presented as numbers from 1 to 9) rise gradually. When it comes to the delaying time, we examine the variations of the utilization of yard space and the relocation caused by the increase of the delaying time. The results indicate that the delaying time contributes to the former one as it rises, while it makes no sense to the latter one.


## 6. Conclusions

The process for a reasonable container allocation solution consists of two aspects. First, a storage optimal allocation model (model 1) is proposed to share yard space and thus to improve land utilization. Containers from different vessels can be placed at the same area only if their occupancy times of the same bays are different. Second, model 2 minimizes the relocation movements and is solved by a new algorithm referring to the concept of fall column of shunting operation plan. This strategy considers the retrieval priority determined by stowage plan in each stack.According to the experimental results, the proposed approaches not only improve the yard space utilization but also reduce the relocation movements. That is, they increase the volume of container handling for a fixed amount of storage allocated and decrease the relocation movements that occur during the loading operations of the vessel. In order to simplify the models, we only considered the containers from trains which will be loaded onto a vessel in this study. To make it more comprehensive and pragmatic, the opposite direction (from vessel to trains) should be estimated in further discussion.



---

*Source: 5489597-2017-02-13.xml*