**Vol:** 2016 **Issue:** 1

**Published In: January 2018**

**Article No: **6 **Page:** 1-12 doi: 10.13052/jiems2446-1822.2016.006

**Simultaneous Integrated Model with Multiobjective for Continuous Berth Allocation and Quay Crane Scheduling Problem**

Nurhidayu Idris^{1} and Zaitul Marlizawati Zainuddin^{2}

^{1}*Department of Mathematical Sciences, Faculty of Science,*

Universiti Teknologi Malaysia, Johor, Malaysia^{2}*Department of Mathematical Sciences, Faculty of Science*

and Universiti Teknologi Malaysia -- Centre of Industrial

and Applied Mathematics, Universiti Teknologi Malaysia,

Johor, Malaysia

*E-mail: nurhidayu5@live.utm.my; zmarlizawati@utm.my*

Received 23 October 2016; Accepted 24 November 2016;

Publication 19 December 2016

This paper presents the simultaneous integration model of berth allocation and quay crane scheduling. Berths and quay cranes are both critical resources in port container terminals. The mathematical model uses a mixed integer linear programming with multiple objectives generated by considering various practical constraints. Small data instances have been taken to validate the integrated model. A numerical experiment was conducted by using LINGO programming software to evaluate the performance and to obtain the exact solution of the suggested model.

- Berth allocation
- Quay crane scheduling
- Multi objectives
- Integration

In today’s global economy, shipping, port and logistics activities are well-known and indispensable. They have an important role to play in facilitating the global trade nowadays. As we can observe, most of the businesses around the world involve shipping from one destination to other destination. Since the water transportation becomes an essential need for human daily activities especially in business field, it has caused a great demand for port container terminals. A great demand for seaport container terminals recently in business, there exist the systematic operation competition between ports. Regarding to the fierce competition among container terminals, high performance with an efficient processing in a container terminal is vital as mentioned in [1]. Previously, Daganzo [2] and Park and Kim [3] were both first presented the integrated approaches. Both papers highlighted applying monolithic model for crane assignment and crane scheduling as in [2] and berth allocation with crane assignment as in [3]. Generally, the handling time of the ship is affected by the crane schedule. The integration concept of Berth Allocation Problem (BAP) and Quay Crane Scheduling Problem (QCSP) was proposed by Park and Kim [3] with continuous berth model. The problem is formulated using the mixed integer programming (MIP) model whereby both time and space were discretized and a two phased procedure was designed to solve the problem. In the first phase, berth allocation and rough quay crane allocation was determined while in the second phase by using the solution found from the first phase, a detailed individual crane scheduling was generated. Next, this study has been extended as in [4] by restricting the moving range of each crane individually at the quay. The differences exist between these two papers are they allocate the two resources which are berths and quay cranes simultaneously, not sequentially like in [3].

In addition, the simultaneous concept has been studied as in [5] on the integration of berth allocation and quay crane scheduling problem. This problem was designed simultaneously between scheduling of cranes for all vessels and assigning of vessels to the berths. Continuous layout of berth was chosen in order to be more practical and less time consumed by vessels at port. Aykagan [5] proposed to solve the integration problem by applying a Tabu search heuristic with the objectives to minimize the serving time and weighted tardiness of vessels. Besides that, the same simultaneous concept was proposed in [6] for the integration model of BAP and QCSP. The integrated optimization model on berth allocation and quay crane scheduling was built with the objective to reduce the operating costs of quay crane and vessels. Wang, Cao, Wang and Li [6] as well developed a new genetic and ant colony algorithm whereby the partial allocation plan is solved using genetic algorithm, then adjusted against berth through ant colony algorithm to find an optimal solution. Compared to Aykagan [5], Wang, Cao, Wang and Li [6] focused on a discrete berth layout rather than continuous berth. However, both papers focused on a dynamic concept for the arrival of ships. The integration of BAP and QCSP also has been studied as in [1] on a simultaneous process. The study is solved in a simultaneous way with uncertainties on arrival time of vessel and container handling time. The spatial and temporal constraint applied in [1] is similar to [6] whereby discrete layout of berths with dynamic arrival of vessels. A simulation based on Genetic Algorithm (GA) search procedure is built in order to generate robust berth and QC schedule proactively.

Mainly, the focus in this research is to develop a simultaneous Integration Continuous Berth Allocation Problem and Quay Crane Scheduling Problem (IBAPCQCSP) while considering multiple objectives. This paper involves two processes namely, berth allocation and quay crane scheduling which are vital operations in container terminal. Thus, the flow of the operations has been presented in the mathematical model throughout this paper. The handling time of vessel depends on the resources utilization efficiency which may result an early departure of vessel. This research focuses on continuous berth layout whereby the vessels can be served wherever empty spaces are available along the quay. Next, to formulate the multi objectives model of simultaneous IBAPCQCSP, below assumptions need to be followed:

- The length of each vessel represents through number of holds of 2, 3 or 4 holds whereby only one crane can work on a hold at one time.
- Numbers of vessels can berth along the quay and being served immediately.
- During the planning horizon, vessels can arrive at port and cannot be served before its arrival.
- Once all holds on a vessel is processed by quay cranes, a vessel is completed.
- Once the cranes start to work on a hold, the work has to be continued until the hold completely being served.
- Quay cranes cannot cross each other while on the same tracks.
- After the process of loading and unloading container is completed on all holds, only then a vessel can leave the port.
- Handling time of vessel depends on the number of quay cranes assigned to the vessel.
- Quay cranes can move from hold to hold either in the same or different vessel without crossing one another.

In this section, a multiple objectives mathematical model is formulated with the simultaneous integrated berth allocation and quay crane scheduling. The study focuses on the dynamic arrival of vessels where a set *V* of vessels with known arrival times, whereby *n = * For each vessel

$\begin{array}{l}{x}_{ij}=\{\begin{array}{ll}1\hfill & \text{if}\text{\hspace{0.17em}}\text{vessel}\text{\hspace{0.17em}}i\text{\hspace{0.17em}}\text{berth}\text{\hspace{0.17em}}\text{after}\text{\hspace{0.17em}}\text{vessel}\text{\hspace{0.17em}}j\text{\hspace{0.17em}}\text{departs},\hfill \\ 0\hfill & \text{otherwise};\hfill \end{array}\\ {y}_{ij}=\{\begin{array}{ll}1\hfill & \text{if}\text{\hspace{0.17em}}\text{vessel}\text{\hspace{0.17em}}i\text{\hspace{0.17em}}\text{berth}\text{\hspace{0.17em}}\text{completely}\text{\hspace{0.17em}}\text{above}\text{\hspace{0.17em}}\text{vessel}\text{\hspace{0.17em}}j\text{\hspace{0.17em}}\text{on}\text{\hspace{0.17em}}\text{the}\hfill \\ \hfill & \text{time-space}\text{\hspace{0.17em}}\text{diagram},\hfill \\ 0\hfill & \text{otherwise};\hfill \end{array}\end{array}$ $\begin{array}{l}{r}_{iqk}^{t}=\{\begin{array}{ll}1\hfill & \text{if}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.17em}}\text{least}\text{\hspace{0.17em}}\text{one}\text{\hspace{0.17em}}\text{quay}\text{\hspace{0.17em}}\text{crane}\text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{assigned}\text{\hspace{0.17em}}\text{on}\text{\hspace{0.17em}}\text{hold}\text{\hspace{0.17em}}k\text{\hspace{0.17em}}\text{of}\text{\hspace{0.17em}}\text{vessel}\text{\hspace{0.17em}}\hfill \\ \hfill & i\text{\hspace{0.17em}}\text{at}\text{\hspace{0.17em}}\text{time}\text{\hspace{0.17em}}t,\hfill \\ 0\hfill & \text{otherwise};\hfill \end{array}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\\ {w}_{i}^{t}=\{\begin{array}{ll}1\hfill & \text{if}\text{\hspace{0.17em}}\text{at}\text{\hspace{0.17em}}\text{least}\text{\hspace{0.17em}}\text{one}\text{\hspace{0.17em}}\text{quay}\text{\hspace{0.17em}}\text{crane}\text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{assigned}\text{\hspace{0.17em}}\text{to}\text{\hspace{0.17em}}\text{vessel}\text{\hspace{0.17em}}i\text{\hspace{0.17em}}\text{at}\text{\hspace{0.17em}}\text{time}\text{\hspace{0.17em}}t,\hfill \\ 0\hfill & \text{otherwise};\hfill \end{array}\end{array}$

L: set of berths along the quayQ: a set of non-identical quay cranes working on a single set of rails.n: travel time of quay crane_{q}q,T: time period of vesselsV: a set of vesselsM: a large scalar numberh: number of holds of vessel_{i}i,pr: processing time of hold_{i}^{k}kof vesseli,pr: maximum hold processing time for vessel_{i}^{max}i$p{r}_{i}^{\mathrm{max}}:{\mathrm{max}}_{i}\left\{p{r}_{i}^{k}\right\}$ f: lateness penalty time of vessel_{i}i,d: due time of vessel_{i}i(whered,_{i}a)_{i}+ pr_{i}^{∗}a: arrival time of vessel_{i}i,bp: berthing position of vessel_{i}i,bt: berthing time of vessel_{i}i,e: the earliest time that vessel_{i}ican depart.

The simultaneous concept of IBAPCQCSP model with multiple objectives and dynamic arrival of vessels is formulated as follow:

$Min{\displaystyle \sum _{i=1}^{n}\left({e}_{i}-{a}_{i}\right)}+{\displaystyle \sum _{i=1}^{n}{f}_{i}}\left({e}_{i}-{d}_{i}\right)+{\displaystyle \sum _{i=1}^{n}{\displaystyle \sum _{t\in T}{\displaystyle \sum _{q\in Q}{\displaystyle \sum _{k=1}^{{h}_{i}}{n}_{q}}}}}{r}_{iqk}^{t}$ | $\left(1\right)$ |

subject to

${x}_{ij}+{x}_{ji}+{y}_{ij}+{y}_{ji}\ge 1$ | $\text{\hspace{1em}}\forall i,j\in V\text{and}i<j$ | $\left(2\right)$ |

${x}_{ij}+{x}_{ji}\le 1$ | $\text{\hspace{1em}}\forall i,j\in V\text{and}i<j$ | $\left(3\right)$ |

${y}_{ij}+{y}_{ji}\le 1$ | $\text{\hspace{1em}}\forall i,j\in V\text{and}i<j$ | $\left(4\right)$ |

$b{t}_{j}\ge {e}_{i}+({x}_{ij}-1)M$ | $\text{\hspace{1em}}\forall i,j\in V\text{and}i<j$ | $\left(5\right)$ |

$b{p}_{j}\ge b{p}_{i}+{h}_{i}+({y}_{ij}-1)M$ | $\text{\hspace{1em}}\forall i,j\in V\text{and}i<j$ | $\left(6\right)$ |

$b{t}_{i}\ge {a}_{i}$ | $\text{\hspace{1em}}\forall i\in V$ | $\left(7\right)$ |

$b{t}_{i}\ge t{r}_{iqk}^{t}+(1-{r}_{iqk}^{t})T$ | $\text{\hspace{1em}}\forall i\in V,\forall k\in \left\{1,\dots \mathrm{..},{h}_{i}\right\}\text{},\text{\hspace{1em}}$ | $\left(8\right)$ |

$\forall t\in T{e}_{i}\ge t{r}_{iqk}^{t}+p{r}_{i}^{k}$ | $\text{\hspace{1em}}\forall i\in V,\forall k\in \left\{1,\dots \mathrm{..},{h}_{i}\right\}\text{},$ | $\left(9\right)$ |

$\forall t\in T,\forall q\in Q{e}_{i}\ge b{t}_{i}+p{r}_{i}^{max}\text{}$ | $\text{\hspace{1em}}\forall i\in V$ | $\left(10\right)$ |

$w{i}_{\mathrm{min}}^{}\le {\displaystyle \sum _{i\in V}{r}_{iqk}^{t}}\le {w}_{i}^{\mathrm{max}}$ | $\text{\hspace{1em}}\forall q\in Q,\forall k\in \left\{1,\dots \mathrm{..},{h}_{i}\right\}\text{},$ | $\left(11\right)$ |

$\forall t\in T{\displaystyle \sum _{i\in V}{\displaystyle \sum _{q\in Q}{\displaystyle \sum _{k=1}^{{h}_{i}}{r}_{iqk}^{t}}}}\le Q$ | $\text{\hspace{1em}}\forall t\in T$ | $\left(12\right)$ |

$\sum _{q\in Q}{r}_{iqk}^{t}}={w}_{i}^{t$ | $\text{\hspace{1em}}\forall i\in V,\forall k\in \left\{1,...,{h}_{i}\right\}\text{},$ | $\left(13\right)$ |

$\text{\hspace{1em}}\forall t\in T$ | ||

$\underset{}{\sum _{t\in T}}{w}_{i}^{t}={e}_{i}-b{t}_{i}$ | $\text{\hspace{1em}}\forall i\in V$ | $\left(14\right)$ |

$1\le b{p}_{i}\le L-{h}_{i}+1$ | $\text{\hspace{1em}}\forall i\in V$ | $\left(15\right)$ |

${x}_{ij}\in \left\{0,1\right\}\text{},{y}_{ij}\in \left\{0,1\right\}$ | $\text{\hspace{1em}}\forall i,j\in V\text{and}i\ne j$ | $\left(16\right)$ |

${r}_{iqk}^{t}\in \left\{0,1\right\}\text{},{w}_{i}^{t}\in \left\{0,1\right\}$ | $\text{\hspace{1em}}\forall i\in V,\forall k\in \left\{1,...,{h}_{i}\right\}\text{},\text{\hspace{1em}}$ | $\left(17\right)$ |

$\text{\hspace{1em}}\forall t\in T,\forall q\in Q$ |

Referring to mathematical formulation above, the first objective that needs to be achieved is to minimize the duration of vessels at port and second objective is to reduce the waiting time of vessels to be served. The last objective is to lessen the travelling time of quay cranes. Constraints (2) through (4) are applied to prevent the overlapping rectangle of vessels. Constraints (5) and (6) ensure that the chosen berthing times and berthing positions are consistent with the definitions of *x _{ij}* and

The model formulation presented previously was validated by using commercial programming software, LINGO 15.0 for small problem which can be seen in Table 1 with the length of berth, *L* = 7 and quay cranes, *Q* = 4.

i |
1 | 2 | 3 | 4 | 5 |

a_{i} |
2 | 1 | 3 | 1 | 4 |

d_{i} |
8 | 4 | 9 | 5 | 11 |

f_{i} |
3 | 4 | 3 | 3 | 4 |

h_{i} |
2 | 3 | 3 | 4 | 4 |

pr_{i}^{1} |
3 | 2 | 2 | 3 | 3 |

pr_{i}^{2} |
4 | 2 | 4 | 1 | 2 |

pr_{i}^{3} |
– | 2 | 1 | 0 | 2 |

pr_{i}^{4} |
– | – | – | 1 | 4 |

q |
1 | 2 | 3 | 4 |

n_{q} |
0.10 | 0.20 | 0.15 | 0.25 |

In this study, the length of vessel is represented through the different number of holds for each vessel which are 2, 3 or 4 holds. The vessels can moor at the berth along the quay and obtain service by quay cranes simultaneously with only one crane can assign and works on a hold. The processing time of each hold has been assigned for every vessel to be served by quay cranes. The quay crane is allowed to shift form one hold of a vessel to another only if a quay crane finished processing initially assigned hold. Each vessel is considered completed once the quay cranes finished processing all holds in a vessel. After all the vessels are finished servicing, the exact solution is obtained and presented through a time-space diagram or Gantt chart which is the best way to represent a vessel who is queuing to be served and in the middle of servicing.

From the simple numerical data assigned, the exact solutions by using three different rules are compared. Table 3 and Figure 1 shows the exact solution of using First Come First Serve (FCFS) rule while Table 4 and Figure 2 shows the result obtained by applying Large Vessel First (LVF) rule. For the last result, Shortest Processing Time First (SPTF) rule is applied and the exact solution can be seen in Table 5 and Figure 3 as followed. The moving path of the quay cranes also will be presented in the time space diagram.

i |
1 | 2 | 3 | 4 | 5 |

bp_{i} |
1 | 1 | 5 | 4 | 1 |

bt_{i} |
3 | 1 | 6 | 1 | 7 |

e_{i} |
7 | 3 | 11 | 6 | 12 |

r_{iq}^{1} |
3 | 1 | 6 | 1 | 7 |

r_{iq}^{2} |
3 | 1 | 6 | 4 | 7 |

r_{iq}^{3} |
– | 1 | 10 | – | 9 |

r_{iq}^{4} |
– | – | – | 5 | 8 |

i |
1 | 2 | 3 | 4 | 5 |

bp_{i} |
1 | 5 | 5 | 1 | 1 |

bt_{i} |
8 | 2 | 4 | 1 | 4 |

e_{i} |
12 | 4 | 10 | 4 | 8 |

r_{iq}^{1} |
8 | 2 | 8 | 1 | 4 |

r_{iq}^{2} |
8 | 2 | 4 | 1 | 4 |

r_{iq}^{3} |
– | 2 | 8 | – | 6 |

r_{iq}^{4} |
– | – | – | 1 | 4 |

i |
1 | 2 | 3 | 4 | 5 |

bp_{i} |
5 | 1 | 1 | 4 | 1 |

bt_{i} |
5 | 1 | 3 | 1 | 7 |

e_{i} |
9 | 3 | 7 | 5 | 12 |

r_{iq}^{1} |
5 | 1 | 3 | 1 | 7 |

r_{iq}^{2} |
5 | 1 | 3 | 4 | 7 |

r_{iq}^{3} |
– | 1 | 3 | – | 9 |

r_{iq}^{4} |
– | – | – | 4 | 8 |

Based on the three exact solutions diagrams above, the total objective function value obtained by applying FCFS rule was 40.4 hours with the idle cranes of 8 while LVF rule with total optimal objective function value of 33.2 hours and 8 idle cranes. For SPTF rule, the total objective function value obtained was 28.35 hours with 8 idle cranes too. It shows that the performance of the integrated operation regarding BAP and QCSP by using the SPTF rule is smaller compared to FCFS and LVF rules. Therefore, the SPTF rule is more applicable and effective for the model to be used in further research. From the results, SPTF rule gives the lowest results since the berth was fully occupied with vessels from time to time and there was lessen delay completion time of vessels.

The highlight of this paper is the integration on operating both resources which are berths and quay cranes at the port terminal simultaneously. There exist two processes namely, BAPC and QCSP which increase the operations efficiency at container terminal. This paper proposed a mathematical formulation for the simultaneous IBAPCQCSP with multiple objectives. This study also performed simple numerical experiment to evaluate the performance and validate the simultaneous integrated model with multiple objectives added using LINGO 15.0. For future studies, metaheuristic approach will be considered for the simultaneous integrated model with real life data.

The authors would like to thank the Malaysian Ministry of Higher Education for their financial funding through Fundamental Research Grant Scheme (FRGS) vote number R.J130000.7809.4F470. This support is gratefully acknowledged. The author would also like to thank UTM Centre for Industrial and Applied Mathematics and Department of Mathematical Sciences, Faculty of Science, UTM for the support in conducting this research work.

[1] Han, X. L., Lu, Z. Q., and Xi, L. F. (2010). A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. *Eur. J. Operat. Res*. 207.3, 1327–1340.

[2] Daganzo, C. F. (1989). The crane scheduling problem. Transport. Res B Methodol. 23.3, 159–175.

[3] Park,Y. M., and Kim, K. H. (2005). “A scheduling method for berth and quay cranes.” in *Container Terminals and Automated Transport Systems*. Berlin: Springer, 159–181.

[4] Zhang, C., Zheng, L., Zhang, Z., Shi, L., and Amstrong A. J. (2010). The allocation of berths and quay cranes by using a sub-gradient optimization technique. *Comput Ind. Eng*. 58.1, 40–50.

[5] Aykagan, A. (2008). *Berth and quay crane scheduling: problems, models and solution methods*. ProQuest, Georgia Institute of Technology, Georgia.

[6] Wang, R. D., Cao, J. X., Wang, Y., and Li, X. X. (2014). An integration optimization for berth allocation and quay crane scheduling method based on the genetic and ant colony algorithm. *Appl. Mech. Mater*. 505–506, 940–944.

**N. B. Idris** is a master student at the Universiti Teknologi Malaysia at Skudai, Johor, Malaysia since 2014. She attended the Universiti Teknologi Malaysia, Johor where she received her B. Sc. in Industrial Mathematics in 2014. Nurhidayu is currently completing a master’ degree in Applied Mathematics specialized in Operational Research field at the Universiti Teknologi Malaysia at Skudai, Johor, Malaysia. Her master work discusses on minimizing the operation at port which involving Berth Allocation and Quay Crane Scheduling Problem.

**Z. M. Zainuddin** is a Senior Lecturer at Universiti Teknologi Malaysia, Malaysia. She received his B.Sc. degree in Mathematics from University of Southampton, United Kingdom in 1996, M.Sc. degree in Operational Research and Applied Statistics, from Salford University, United Kingdom, in 1999, and his PhD. degree in Mathematics and Statistics from University of Birmingham, United Kingdom, in 2004. Her research interest includes modeling and solving real life problem using Operational Research, Optimization and Heuristic techniques. She is a member of the OR Society, Management Science/OR Society of Malaysia (MSORSM) and Malaysian Mathematical Sciences Society (PERSAMA).

*Journal of Industrial Engineering and Management Science, Vol. 1,* 1–12.

doi: 10.13052/jiems2446-1822.2016.006

© 2016 *River Publishers. All rights reserved.*