# Multi Objective Optimization of Coordinated Scheduling of Cranes and Vehicles at Container Terminals

Authors: Seyed Mahdi Homayouni; Sai Hong Tang
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

According to previous researches, automated guided vehicles and quay cranes in container terminals have a high potential synergy. In this paper, a mixed integer programming model is formulated to optimize the coordinated scheduling of cranes and vehicles in container terminals. Objectives of the model are to minimize total traveling time of the vehicles and delays in tasks of cranes. A genetic algorithm is developed to solve the problem in reasonable computational time. The most appropriate control parameters for the proposed genetic algorithm are investigated in a medium size numerical test case. It is shown that balanced crossover and mutation rates have the best performance in finding a near optimal solution for the problem. Then, ten small size test cases are solved to evaluate the performance of the proposed optimization methods. The results show the applicability of the genetic algorithm since it can find near optimal solutions, precisely and accurately.


---

## Body

## 1. Introduction

The containers have revolutionized the seaborne transportation industry. In the past decade, massive containerships and ever increasing demand for containerization had forced the seaport container terminals (CTs) to expand their capacity in loading and unloading the containerships. Imai et al. [1] emphasized that mega containerships have started to handle more than ten thousand of containers since 2007. Commonly, a predetermined time schedule is set for any visiting containership being loaded/unloaded, where violating this schedule is too costly for the container terminals. Therefore, most of the CT authorities seek to improve their performance, by either implementing modern handling equipment or improving their management, planning, and scheduling skills.CT authorities all over the world are trying to use more enhanced equipment, such as automated guided vehicles (AGVs) and automated stacking cranes (ASCs) which serve the quay cranes (QCs). For example, more than 250 AGVs and 140 ASCs are in service within Europe container terminal (Delta terminal) [2]. Key factors for a CT are efficiency of the stacking and transport of a huge number of containers to (from) the quayside. Kim and Park [3] stated that one direction to improve productivity of the CTs is to enhance the degree of automation of their handling equipment.In most of the cases both hardware and software improvements are necessary to decrease waiting times in container terminals. Stahlbock and Voß [4] declared that existing infrastructures and equipment of the CTs can be used more efficiently, for example, by means of powerful information technology and logistics control software systems including optimization methods. According to the literature, coordinated scheduling is a method to improve the performance of existing equipment [5–7]. Lau and Zhao [6] emphasized that the main loss of performance at ACTs is the schedules of various equipment, which are uncoordinated.Optimization of the coordinated scheduling of cranes and vehicles in CTs is the main concern of this paper. The remainder of the paper is organized as follows, to pursue this aim. A brief literature review of the most related researches is presented in Section2. A mixed integer programming (MIP) model for this problem is described in Section 3. Next, a genetic algorithm (GA) is proposed and detailed in Section 4 to solve the problem. To compare the results and show the applicability of the proposed GA method, results of numerical test cases are reported in Section 5. Finally, Section 6 provides the concluding remarks of the research.


## 2. The Literature Review

Various scheduling problems for handling equipment in CTs have been widely considered in the past decade. For example, the goal of QC scheduling problem is to determine the sequence of unloading/loading tasks, assigned to a crane so that the completion time of a containership tasks is minimized. Kim and Park [3] proposed an MIP model to schedule the cranes. They stated that integrating decision-making process at various levels in CTs improve the efficiency of its scheduling. Liu et al. [8] studied the scheduling of cranes at CTs where incoming containerships have different ready times. They tried to minimize the maximum tardiness of containership departure. The scheduling of cranes is highly affected by availability of the vehicles. The researchers stated that coordinated scheduling of cranes and vehicles might improve the efficiency of CTs [6].The scheduling of vehicles in CTs and flexible manufacturing systems is similar. Researchers proposed to schedule machines and AGVs simultaneously [9, 10], though vehicle scheduling in container terminals has gained more attention in recent years [6, 11, 12]. In CTs, automated guided vehicles operate in single-load carrier mode. The particular difficulty of AGV dispatching in a CT is that AGV pickup and drop-off times for each container have to coincide with scheduling of the quay and stacking cranes to avoid idle times of these equipment and to guarantee short berthing time of the containerships [13]. According to Lau and Zhao [6], AGVs deliver their loads to buffers once they reached the assigned destination in manufacturing systems. Nevertheless, the AGVs are not able to pick up/drop off containers by themselves. Therefore, there is no buffer between QCs and AGVs in container terminals. This causes a tight and precise schedule for AGVs and QCs. Moreover, in contrast to the manufacturing areas, the large number of AGVs is implemented at container terminals, and outdoor transport systems make it more difficult to schedule, efficiently.Coordinated scheduling of cranes and vehicles in CTs has been studied in the literature. Lee et al. [7] considered integrated scheduling of cranes and yard trucks. They formulated an MIP model for this problem similar to the two-stage flexible flow shop with sequence-dependent setup time. The objective function includes minimizing the makespan of all the cranes’ tasks in the scheduling period. They proposed a GA to obtain near optimal solutions of the problem. They only considered scheduling of unloading tasks; however, they stated that the procedure can be applied to loading tasks, as well. Moreover, Nguyen and Kim [14] proposed coordinated scheduling for cranes and automated lifting vehicles in container terminals. They developed an MIP model in addition to a heuristic algorithm to solve the problem. The objective function is to minimize total travel time of vehicles and total delays in tasks of cranes. As the automated lifting vehicles are able to pick up the containers by themselves, Nguyen and Kim [14] demonstrated that buffer capacity highly influences performance of this integrated scheduling method.Cao et al. [15] have formulated an MIP model for the integrated crane and yard truck scheduling, which has been solved by using a GA. In a recent research, Zhao and Tang [16] considered the integrated scheduling of trucks and cranes. They developed a particle swarm optimization algorithm to solve the problem. Their objective was to minimize makespan of unloading tasks for a specific containership. Assuming empty travels of the trucks when they come back from the yard to the quay area is the main drawback of their work. The same objective function has been minimized by Homayouni et al. [17]. They developed a simulated annealing algorithm to find near optimal solutions for the integrated scheduling of vehicles and cranes in container terminals.Moreover, Skinner et al. [18] presented a GA to improve container handling operations at a container terminal in Australia. Jobs related to QCs, straddle carriers, and trucks (for importing or exporting containers to the land side of the terminal) have been scheduled. They have formulated the problem as a mixed integer linear programming model. They have applied this approach in a trial basis live scheduling in the aforementioned container terminal. Chen et al. [19] have considered the simultaneous scheduling of QCs and vehicles. They formulated problem as a constraint programming model. They also have developed a heuristic three-stage solution method to find high-quality solutions and can efficiently solve large problems.Most of the literature reviewed in this section has assumed that unloading tasks for any of the containerships should precede the loading tasks (e.g., [7, 16, 19]). However, this process may increase empty travelling time of the vehicles while they come back to the docking area after an unloading task. According to Lau and Zhao [6], the loading and unloading tasks can be mixed to overcome this main limitation of the problems. On the other hand, these literatures have developed mathematical formulations which are not able to calculate the exact real completion time of the tasks. These two main limitations are considered while formulating the problem in this research.


## 3. Mathematical Modeling of the Problem

The coordinated scheduling of the cranes and the vehicles is formulated as a mixed integer programming model in this section. The general scenario for the containership operations consists of unloading and loading tasks. The scheduling horizon is usually divided to some predetermined scheduling periods. In each period, based on the precedence relations, a list of tasks is planned for each crane.In unloading tasks, the vehicle starts a journey from its dwell point (where the last task of the vehicle finished) to the assigned crane. Similarly, after its previous task, the crane handles the container from its location in the containership to the pickup/delivery (P/D) point in the quayside of the CT. Once the vehicle reaches P/D point, and if the crane reached there too, the container will be loaded on the vehicle. Afterward, the vehicle starts a journey to the assigned load/unload (L/U) station in the storage yard. The vehicle delivers the container to L/U station and waits for next assigned operation.Likewise, in the loading tasks, the vehicle moves from its dwell point to the assignedL/U station, receives the container, and moves to P/D point at the crane. If the crane is free, the container is loaded to the containership. In case that crane is not free, the vehicle has to wait for it. The AGVs are not able to pick up the containers by themselves. Therefore, they directly should be loaded or unloaded by either the crane or the L/U station. It is why there is no buffer space between the crane or L/U stations and the AGVs in container terminals.It is assumed that handling time between various equipment of the CT is deterministic and predetermined. Congestions of the vehicles in the guide path are not considered in this scenario. Moreover, it is assumed that the vehicles start their tasks from a predeterminedL/U stations and return there once finishing all their assignments. There is no acceleration for the vehicles and the velocity of loaded and empty vehicles are equal; therefore, their travelling time is the same.In the proposed scenario for the coordinated scheduling of cranes and vehicles,Tki represents ith task of the kth crane (Ck). If Tki and Tlj are performed consecutively, by using the same vehicle, tkilj denotes the travelling time of the vehicle from Ck, in Tki, to the Cl in Tlj. Table 1 presents formulas to calculate tkilj based on the specifications of both Tki and Tlj. The initial and final events of the ith vehicle are shown by TSi and TFi, in which “S” and “F” represent the set of initial and final events of the vehicles. In Table 1, L/Uki shows the dedicated L/U station for Tki. Moreover, “L” and “U” represent the sets of loading and unloading tasks, respectively. As an example, if Tki is an unloading task and Tlj is a loading one, tkilj is the travelling time for the vehicle, which starts the journey form Ck and delivers the container to L/Uki, which is the destination of Tki. Next, the vehicle moves from L/Uki to L/Ulj, which is the starting point of Tlj, receives the container, and moves to Cl, which is the destination of Tlj.Table 1
Calculations for travelling time of the vehicles.
T
k
i
T
l
j
t
k
i
l
j
T
k
i
T
l
j
t
k
i
l
j
L
L
=Ck→L/Ulj+L/Ulj→Cl
S
L
=L/USi→L/Ulj+L/Ulj→Cl
L
U
=Ck→Cl
S
U
=L/USi→Cl
U
L
=Ck→L/Uki+L/Uki→L/Ulj+L/Ulj→Cl
L
F
=Ck→L/UFj
U
U
=Ck→L/Uki+L/Uki→Cl
U
F
=Ck→L/Uki+L/Uki→L/UFjIn the proposed model, the set of cranes is denoted byK, the number of tasks assigned to Ck is shown by mk, and the set of the vehicles is shown by V. ϕkilj is a binary decision variable, which becomes one if Tlj is successively performed after Tki by using the same vehicle, and zero, otherwise. ϕSilj denotes a journey started by Vi from its initial position, where i∈{1,…,V} to the starting point of Tlj. Similarly, ϕkiFj denotes a journey ended by Vj from destination of Tki to the final position of Vj, j∈{1,…,V}. Moreover, yki is the real time in which Ck finishes its operation in Tki (place the container in its predefined location in the containership in loading tasks, and drop the container into the assigned vehicle in unloading tasks). The earliest possible completion time for operations of Ck in Tki is represented as Ski. To calculate Ski it is assumed that vehicles are ready to deliver or receive the container to the crane. The proposed mixed integer programming model for the coordinated scheduling of cranes and vehicles is presented in the following
(1)MinimizeMini=mizZ=α(∑k∈{S∪K}∑i=1mk∑l∈{K∪F}∑j=1mltkiljϕkilj)Mini=mizevZ+β(∑k=1K(ykmk-Skmk)),(2)SubjecttobSubjectto:b∑l∈{K∪F}∑j=1mlϕkilj=1for∀k∈S∪K,00000000000000000000000000000i=1,…,mk,(3)∑k∈{S∪K}∑i=1mkϕkilj=1for∀l∈K∪F,j=1,…,ml,(4)ylj≥yl(j-1)+2TC+OCfor∀l∈K∪F,0000000j=2,…,ml,if(Tlj,Tl(j-1)∈L)0000000000or(Tlj,Tl(j-1)∈U),(5)ylj≥yl(j-1)+TC+OCfor∀l∈K∪F,000000j=2,…,ml,if(Tlj∈L,Tl(j-1)∈U)00000000or(Tlj∈U,Tl(j-1)∈L),(6)ylj-(yki+tkilj)≥M(ϕkilj-1)for∀k∈K∪S,l∈K∪F,i=1,…,mk,j=1,…,ml,if(Tlj,Tki∈L)or(Tlj,Tki∈U),(7)ylj-(yki+tkilj+TC+OC)≥M(ϕkilj-1)000for∀k∈K∪S,l∈K∪F,i=1,…,mk,0000000j=1,…,ml,Tlj∈L,Tki∈U,(8)ylj-(yki+tkilj-TC-OC)≥M(ϕkilj-1)000for∀k∈K∪S,l∈K∪F,i=1,…,mk,000000j=1,…,ml,Tlj∈U,Tki∈L,(9)yki-yk(i-1)≥Ski-Sk(i-1)for∀k∈K,i=2,…,mk,(10)yki≥Skifor∀k∈K,i=1,…,mk(11)ϕkilj=0or1for∀k∈S∪K,∀l∈K∪F,i=1,…,mk,j=1,…,ml.The objective function (1) considers minimizing total travelling time for all the vehicles, in addition to minimizing total delays of the tasks of cranes compared to their earliest possible completion time. α is a constant which shows the cost of travelling time of the vehicles, and β is the cost for delays in crane operations, and α and β are set to 0.1 and 0.8, respectively, according to the assumptions of Lau and Zhao [6]. Moreover, Nguyen and Kim [14] emphasized that objective of minimizing delays of tasks of cranes is more important than decreasing total travel time of vehicles.In the constraints section, (2) states that only one task should be started directly after any task by using the same vehicle, while (3) states that any task is preceded by one task by using the same vehicle. Constraints (4) to (8) calculate the real completion time of Tlj on Cl (i.e., ylj). If both consecutive tasks of a crane are loading ones, the crane should travel to the quayside after placing the container on the containership in previous tasks of crane or Tlj-1 (takes TC time units). After receiving the container from the vehicle, the crane moves to the containership (takes TC time units) and places the container on the containership (takes OC time units). Therefore, ylj should be greater than ylj-1 by “2TC+OC.” The same occasion happens when both consecutive tasks of a crane are unloading ones. This is represented in constraint (4). Unevenly, if two consecutive tasks of a crane are not of the same type, the crane can start next task immediately. Thus, ylj is greater than ylj-1 by “TC+OC,” which is shown in constraint (5).On the other hand,ylj is related to the arrival time of the vehicle after performing Tki (takes tkilj). If both Tki and Tlj are of the same type, the vehicle can start its journey only after receiving/delivering the container from/to the Ck. Thus, ylj is greater than yki by “tkilj,” which is presented in constraint (6). If Tki is an unloading task and Tlj is a loading one, the vehicle can start its new journey after receiving the container. The vehicle finishes its operation in Tki and moves to Cl (takes tkilj). Once, the vehicle reached Cl, it can starts loading operations of the container (taking TC+OC) Accordingly, ylj is greater than yki by “tkilj+TC+OC,” which is stated in constraint (7). In loading tasks, Ck continues its operations on Tki (takes TC+OC) after receiving the container from the vehicle. Hence, the starting time for the new journey of the vehicle equals to “Tki-TC-OC.” If Tki is a loading task and Tlj is an unloading one, ylj is greater than yki by “tkilj-TC-OC.” This is presented in constraint (8). From (6) to (8), M is a relatively large positive number. Thus, it is obvious that constraints from (6) to (8) are activated only if ϕkilj becomes one.Constraint (9) states that the real completion time of Tki should be greater than real completion time of Tk(i-1) by at least the differences of their earliest possible completion time. Constraint (10) expresses that the real completion time of Tki should be greater than its earliest possible completion time. Finally, (11) declares that ϕkilj is a binary decision variable.


## 4. The Proposed Genetic Algorithm

The coordinated scheduling of vehicles and cranes in CTs have been proved as an NP-hard problem [5]. Genetic algorithms are able to search very large spaces effectively and efficiently. Thus, GAs have been suggested by researchers to optimize scheduling problems. GAs operate on a population of potential solutions, applying the principle of survival of the fittest. Due to this selection, poorly performing individuals have less chance to survive. Consequently, in every generation of the GA, a better performing set of offspring is reproduced [20].In this paper, a GA was developed to optimize the sequence of tasks for the cranes, and a heuristic rule assigns the vehicles to the sequence of tasks. In the proposed GA, a chromosome is a feasible sequence of the cranes’ tasks; each task is located in a gene. A permutation encoding system [20] is selected to represent the tasks of cranes. Figure 1 illustrates the permutation encoding for k number of cranes, in which mk is the number of tasks for each crane. In this method, a chromosome is a combination of integer numbers in range of 1 to N=∑i=1Kmi. The chromosome is feasible for the GA operators if and only if the precedence relations of the cranes’ tasks are observed.Figure 1
Permutation encoding of QC tasks.To create the initial population for the proposed GA, a random string of numbers in range of one toN is produced, in first step. Then, the tasks belonging to each crane are found and highlighted. In the third and last step, the tasks for each crane are sorted. Therefore, the precedence relations of the tasks of cranes are observed here in initial population of the proposed GA. This suggested procedure is repeated to create the required number of chromosomes as the population size. Since in the next iterations of the proposed GA, new offsprings are produced considering the precedence constraints of the tasks; all the produced solutions will be feasible.Once the initial population is created, the vehicles are assigned to the tasks based on the “nearest available vehicle” heuristic rule. The objective of the heuristic algorithm is to decrease waiting time for both the vehicles and the cranes. Consequently, the utilization and throughput of the cranes and vehicles are improved. Next, the objective function for each chromosome is calculated; which is the same as the objective function of the proposed MIP model (presented in (1)).In next step of the GA, chromosomes of the current population are sorted based on the objective function in ascending mode. Then, the proposed crossover and mutation operators reproduce a new population that hopefully contains better solutions to the problem. A number of worst chromosomes in the current population are replaced by the reproduced offspring. The proposed operators of the GA are designed to check and to ignore the chromosomes that violate the precedence constraints of the tasks of cranes.A tournament selection scheme is applied to select the parents for crossover operator. Based on Alvarenga and Mateus [21] to select the parents, tournament selection scheme chooses three chromosomes of the current population, randomly. The fittest chromosome is selected as the first parent. The procedure is repeated to select the other parent.The number of required parents is determined by the crossover rate. The crossover operator reproduces the offspring for new generations. Task-based crossover operator proposed by Reddy and Rao [10] never offends the precedence constraints. Figure 2 illustrates an example for the modified task-based crossover proposed for this research. In this example, there are four cranes, each one performing five tasks. The third crane has been selected for the crossover operator. For this operator, tasks of the selected crane in the first parent are copied to the same positions in the second offspring. On the other hand, the tasks of the selected crane in the second parent are copied into the same positions in the first offspring. In the next step, the remaining tasks of first parent are copied in the unfulfilled positions of the first offspring, and the remaining tasks of the second parent are copied in the unfulfilled positions of the second offspring.Figure 2
An illustrative example for task-based crossover operator.In next step, the mutation operator is used to ensure that all diversities in the feasible solution space are subject to search. While the solution space of the scheduling problems is too rough, the mutation operator is very important to avoid converging to local optima. In most of the literature in the area of scheduling, usually a swap mutation operator is used, where the infeasibilities arisen from are fixed by using a repair operator. In the proposed task-based mutation operator, the swap operation is performed if it does not violate the precedence constraints. A chromosome is chosen for mutation, in which two random genes are selected for a swap operation. The random genes are sorted ascending; hence, the first selected gene is always located prior to the second one. The mutation operator is performed if and only if both genes are qualified for swap operation. The following conditions are used to qualify the selected genes.(i)
If the first gene contains the last task of a crane or the subsequent task of the first gene is located after the second gene, it can be substituted to the second gene.(ii)
If the second gene contains the first task of a crane or the precedent task of the second gene is located prior to the first gene, it can be substituted to the first gene.In order to keep the fittest chromosomes in current population, for next population, the elitism operator avoids them to be mutated. By using this operator, some of the fittest chromosomes in the current population are directly copied to the next population. Elitism operator assures that GA would never lead to a worse solution. Finally, after a predefined number of iterations, the algorithm stops, and the best found solution is introduced as the near optimal solution for the coordinated scheduling of the cranes and vehicles at container terminals.


## 5. Evaluation of the Proposed Genetic Algorithm

In order to evaluate the performance of the proposed GA and MIP model in optimization of coordinated scheduling of cranes and vehicles at container terminals, ten small size test cases were designed. These test cases have been solved using branch and bound (B&B) method of a regular solver software.The sample layout of the CT for the test cases consists of six cranes to load/unload containers of the containerships. The containers are stored in storage yard using sixL/U stations. Travel time between any of the cranes and L/U stations followed the data presented by Lau and Zhao [6]. The operational time for the cranes is assumed the same for all the loading/unloading tasks and is equal to 20 seconds. The operational time is the average time required for loading (unloading) operations of the cranes to (from) the containership including the required reshuffling operations. Moreover, travelling time of the cranes between the containership and the P/D point is set to 10 seconds. The specifications of ten numerical test cases are presented in Table 2, including the cranes and L/U stations, the initial positions of the vehicles, type of tasks (L for loading, and U for unloading tasks), and the earliest possible completion time for the cranes tasks. For more analytical results, a medium size test case is designed, where six tasks are assigned randomly to each crane. The specifications of this test case are presented in Table 3. It is noteworthy to say that the specification of the small size and the medium size test cases has been selected randomly by the authors, following the method introduced by Lau and Zhao [6].Table 2
Specifications of ten numerical small size test cases.
No.
Task-crane-L/U-vehicle
Crane no.
L
/
U station
Vehicle initial position
Task type
Earliest possible completion time (s)
1
8-2-2-4
1, 2
7, 9, 9, 79, 7, 9, 7
12, 11, 12, 7
U, U, U, L U, L, U, U
40, 80, 120, 15040, 70, 100, 140
2
10-2-2-4
3, 4
8, 9, 8, 9, 98, 8, 9, 8, 9
7, 12, 11, 11
U, U, U, U, L L, L, U, U, U
40, 80, 120, 160, 19030, 70, 100, 140, 180
3
10-2-2-5
4, 5
10, 11, 10, 10, 1110, 10, 10, 11, 10
7, 12, 10, 9, 11
U, U, L, L, L L, U, L, U, L
40, 80, 110, 150, 19030, 60, 90, 120, 150
4
12-2-2-4
2, 3
9, 9, 12, 9, 12, 912, 12, 9, 12, 12, 12
10, 9, 7, 8
L, U, L, L, U, L U, L, U, U, U, L
30, 50, 80, 120, 150, 18040, 70, 100, 140, 180, 210
5
12-2-2-5
1, 2
10, 9, 10, 9, 9, 1010, 9, 9, 9, 10, 10
11, 11, 10, 7, 10
L, U, L, U, U, U L, U, L, L, L, U
30, 60, 90, 120, 160, 20030, 60, 90, 130, 170, 200
6
12-2-3-5
5, 6
7, 9, 11, 9, 11, 911, 7, 7, 11, 9, 7
12, 8, 10, 9, 10
U, U, L, L, U, L U, L, L, U, U, U
40, 80, 110, 150, 180, 21040, 70, 110, 140, 180, 220
7
14-2-2-4
2, 3
8, 10, 8, 8, 10, 8, 108, 8, 8, 8, 10, 8, 10
8, 8, 7, 8
L, L, U, L, L, L, U U, U, L, L, U, U, L
30, 70, 100, 130, 170, 210, 24040, 80, 110, 150, 180, 220, 250
8
14-2-2-5
4, 5
9, 12, 9, 12, 9, 12, 99, 12, 12, 12, 9, 12, 9
12, 7, 12, 8, 11
L, L, L, U, L, U, U U, L, U, L, U, U, U
30, 70, 110, 140, 170, 200, 24040, 70, 110, 140, 170, 210, 250
9
14-2-3-5
5, 6
7, 8, 10, 10, 8, 8, 710, 8, 7, 10, 8, 8, 10
12, 7, 8, 7, 11
L, L, U, U, U, L, U U, U, U, L, L, U, L
30, 70, 100, 140, 180, 210, 24040, 80, 120, 150, 180, 210, 240
10
16-2-2-4
3, 4
7, 9, 7, 9, 7, 9, 7, 79, 7, 7, 9, 7, 9, 7, 7
9, 7, 10, 7
U, U, L, U, U, L, L, U U, U, U, U, U, U, L, L
40, 80, 110, 140, 180, 210, 250, 28040, 80, 120, 160, 200, 240, 270, 310Table 3
Specifications of the medium size test case (task type,L/U station, and earliest completion time).
QCs
Tasks
1
2
3
4
5
6
1
L, 9, 30
U, 10, 60
L, 8, 90
L, 12, 130
U, 11, 160
L, 8, 190
2
L, 7, 30
L, 8, 70
U, 10,100
L, 11, 130
L, 7, 170
U, 12, 200
3
U, 12, 40
U, 11, 80
L, 10, 110
L, 10, 150
U, 9, 180
L, 8, 210
4
U, 10, 40
U, 7, 80
U, 8, 120
L, 12, 150
L, 11, 190
U, 9, 220
5
L, 11, 30
L, 7, 70
U, 8, 100
U, 12, 140
U, 11, 180
U, 10, 220
6
L, 12, 30
L, 11, 70
U, 9, 100
U, 7, 140
U, 8, 180
L, 10, 210In the first test, the effects of crossover and mutation rates on the obtained solutions by the proposed GA are presented in Table4. This test was executed on the medium size test case using six vehicles. The vehicles are in the L/U stations number 1 to 6, as their initial positions. Every combination of crossover and mutation rate was run for ten replications and the mean of obtained objective values is reported in Table 4. The results show that if both the crossover and mutation rates are equal to 0.5, the best results are obtained. However, the best solution for the medium size test case is obtained by the crossover and mutation rates of 0.6. The best objective value for this test case is equal to 3830. Based on this test, the best scheduling string for this test case is presented in Table 5, in which the assigned vehicle to the tasks is indicated. Moreover, a schematic view of the best scheduling found by the GA is shown in Figure 3. This schematic view shows the first 20 tasks scheduled by using the proposed GA.Table 4
Mean of obtained solutions under various crossover and mutation rates in medium size test case.
Crossover rates
Mutation rates
0.5
0.6
0.7
0.8
0.9
0.5
3984.4
4104.8
4104.2
4206
4158
0.6
4032.6
4006
4046
4018.6
4140
0.7
4000.2
4082.8
4118.6
4061.8
4179.8Table 5
The best scheduling string, based on the proposed GA method in medium size test case.
Scheduling string
Task no.
T
21
T
31
T
22
T
32
T
33
T
51
T
23
T
41
T
34
T
42
T
43
T
44
T
52
T
24
T
45
T
35
T
53
T
25
Vehicle no.
V
1
V
1
V
2
V
2
V
4
V
5
V
3
V
4
V
6
V
6
V
5
V
1
V
3
V
2
V
4
V
2
V
3
V
6
Task no.
T
11
T
26
T
46
T
36
T
54
T
55
T
61
T
56
T
12
T
62
T
13
T
63
T
14
T
15
T
16
T
64
T
65
T
66
Vehicle no.
V
2
V
6
V
1
V
5
V
4
V
5
V
6
V
2
V
3
V
5
V
1
V
1
V
4
V
4
V
2
V
6
V
5
V
3Figure 3
A schematic view for the best scheduling of the medium size test case found by the proposed GA.The second test was conducted to compare the solutions found by the proposed GA and the MIP model. For the GA method, the crossover and mutation rates were set to 0.5 and 0.5, respectively. Moreover, the population size of the GA and its number of iterations was set to 40 and 1000, respectively. Preliminary tests on the small size test cases indicated that while decreasing the number of iterations would cause worse solutions for the GA method, increasing the number of iterations more than 1000 does not lead to better solutions in these test cases.Table6 presents the comparative results for the small size test cases. The number of decision variables, the optimal value, and CPU time required for the solver software are reported for the MIP model. In other columns, the mean and the best solutions found by the GA method are presented, where every test case was solved for 10 replications. Moreover, the CPU time for GA and the deviation between the best solution of the GA method and the optimal solution of the MIP model are shown in Table 6. The deviation is defined in the following:
(12)%Deviation=Best-OptimalOptimal×100.Table 6
Comparative results for ten small size test cases solved by the MIP model and the GA method.
No.
MIP model
Proposed GA
Deviation %
Decision variables
Optimal
CPU time
Mean
Best
CPU time
1
132
471
180 S
471
471
7.4 S
0
2
176
775
1440 S
775
775
9.6 S
0
3
205
806
4200 S
818
818
9.8 S
1.49
4
226
1055
5100 S
1065
1061
12.3 S
0.57
5
259
675
7500 S
689.2
687
12.4 S
1.77
6
259
923
9000 S
1033.5
1016
12.6 S
10.07
7
282
872
11880 S
921.3
916
14.8 S
5.04
8
319
1064
12300 S
1110.5
1089
16.8 S
2.35
9
319
1154
15120 S
1186.2
1162
15.3 S
0.69
10*
344
1137
27000 S
1165.3
1159
20.3 S
1.93
*The best obtained result in a limited CPU time.Since the number of integer decision variables for the proposed MIP model increases exponentially by increasing the number of tasks, it is too time consuming to solve and find the optimal solutions for the real applications of the coordinated scheduling problem. In some cases, even the solver software cannot obtain the global optimal value in a reasonable time. Therefore, it was decided to record the best obtained result in a limited CPU time for this test case, and it is marked with an asterisk sign in Table6.In test cases numbers 1 and 2, the GA method shows a significant performance, while it found the best solution for each test case in all 10 replications. In other test cases, the mean of 10 replications of the GA method and its best results are near to each other (the mean objective value is 0.75% greater than the best objective value, on average). Therefore, the proposed GA method is able to find a near optimal solution with high precision. On the other hand, in all the small size test cases, the GA found a near optimal solution close to the optimal solution found by the MIP model which shows the accuracy of the proposed GA method (2.17% greater than the global optima). Overall, it is demonstrated that the GA can be used for real applications, and its results are near to the global optima of the problem. Moreover, the results of 10 test cases illustrate that the required CPU time for the proposed GA method is reasonable for real application.The results shown in Table6 illustrate that assigning a predetermined number of vehicles for a specific number of tasks would not guarantee to decrease the objective function. In other words, in addition to the number of tasks per vehicle, the sequence of tasks and their specifications are so important to decrease the objective function. To demonstrate this, look at results of test case 2 and compare it with results of test case 3; the same occasion occurs for test cases 7 and 8. Therefore, for any specific application of the proposed scheduling method, one needs to determine the number of vehicles based on the results of the GA method. Nonetheless, in a specific sequence of tasks, increasing the number of vehicles would result in decreasing the objective function.The sensitivity of the problem is analyzed with various numbers of working vehicles in medium size test case. The GA is run for five replications under crossover and mutation rates of 0.5. Figure4 illustrates the mean and the best solutions for this test case under various numbers of vehicles. The results illustrate that employing more numbers of vehicles in a specific scheduling horizon decreases the objective function obtained by the proposed GA. However, it is obvious that in a certain number of vehicles, for example, 9 in this case, there is no significant reduction in the objective value of the coordinated scheduling problem. A cost-benefit analysis is required in such cases to determine the optimal number of vehicles in a specific scheduling horizon. On the other hand, it is obvious that as the number of vehicles increases the mean of replications converge to the best solutions, which means that GA has more chances to find the best solution in each replication.Figure 4
Mean and the best objective values for various numbers of vehicles in medium size test case obtained by the proposed GA method.


## 6. Conclusions

The optimization of coordinated scheduling of cranes and vehicles at container terminals was presented in this paper. Considering scheduling constraints related to both vehicles and cranes improve the performance of container terminals. The problem was formulated as an MIP model solved using B&B method of regular solver software. To decrease the potential empty travels of vehicles, in this paper, a mixture of loading and unloading tasks of vessels are performed in the scheduling horizon. Moreover, the exact finishing time of the tasks of cranes and vehicle travels is calculated in this model. However the mathematical model is able to find optimum of small size cases, the computational time to find the optimal is too high to be implemented in real applications. Therefore, a genetic algorithm was proposed to find near optimal solutions for the problem in a reasonable computational time. The GA modifies the rules in a way that all of its generated chromosomes are feasible according to the precedence relations required for tasks of cranes.The algorithm searches for tasks of cranes to find a near optimal sequence of tasks. Next, the nearest available vehicle to the starting point of the tasks is assigned to perform the tasks. The objective function of the problem is to minimize total travelling time of the vehicles and delays in tasks of cranes. The performance of the GA and the MIP model was compared in ten small size test cases. The results show that GA can find near optimal solutions, in relatively low computational time. A medium size test case has been solved by using the GA, showing that the GA can be applied in real world instances. On the other hand, more tests on medium size test case shows that increasing the number of vehicles in a specific case decrease the objective function value. Nevertheless, reduction in objective function is not significant when the number of vehicles exceeds a specific level. Therefore, more analysis is required to decide about the number of vehicles according to their operational costs, in practice.For further researches, it is highly recommended to include uncertainties in travelling time of the vehicles, their failure, and times for their batteries to be recharged in the coordinated scheduling method. Moreover, application of other metaheuristic optimization methods in the coordinated scheduling problem is an interesting field for future researches.



---

*Source: 746781-2013-06-25.xml*