Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint

Thesis (Ph.D (Mathematics))

Bibliographic Details
Main Author: Hasan Basri, Azyanzuhaila
Format: Thesis
Language:English
Published: Universiti Teknologi Malaysia 2023
Subjects:
Online Access:http://openscience.utm.my/handle/123456789/142
_version_ 1796848820914487296
author Hasan Basri, Azyanzuhaila
author_facet Hasan Basri, Azyanzuhaila
author_sort Hasan Basri, Azyanzuhaila
collection OpenScience
description Thesis (Ph.D (Mathematics))
first_indexed 2024-03-05T17:33:21Z
format Thesis
id oai:openscience.utm.my:123456789/142
institution Universiti Teknologi Malaysia - OpenScience
language English
last_indexed 2024-03-05T17:33:21Z
publishDate 2023
publisher Universiti Teknologi Malaysia
record_format dspace
spelling oai:openscience.utm.my:123456789/1422023-04-16T09:00:19Z Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint Hasan Basri, Azyanzuhaila Genetic algorithms Mathematics Thesis (Ph.D (Mathematics)) Berth Allocation and Quay Crane Scheduling are the most important part of container terminal operations since berth and quay cranes are an interface of ocean-side and landside in any port container terminal operation. Their operations significantly influence the efficiency of port container terminals and need to be solved simultaneously. Based on the situation, this study focuses on an integrated model of Continuous Berth Allocation Problem and Quay Crane Scheduling Problem. A comprehensive analysis of safety distance for vessel and non-crossing constraint for quay crane is provided. There are two integrated model involved. For the first integrated model, non-crossing constraints are added wherein quay cranes cannot cross over each other since they are on the same track. The second integrated model is focused on the safety distance between vessels while berthing at the terminal and at the same time, quay crane remains not to cross each other. These two constraints were selected to ensure a realistic model based on the real situation at the port. The objective of this model is to minimise the processing time of vessels. A vessel's processing time is measured between arrival and departure including the waiting time to be berthed and servicing time. A new algorithm is developed to obtain the good solution. Genetic Algorithm is chosen as a method based on flexibility and can apply to any problems. There are three layers of algorithm that provide a wider search to the solution space for vessel list, berth list, and hold list developed in this study. The new Genetic Algorithm produced a better solution than the previous research, where the objective function decreases 5 to 12 percent. Numerical experiments were conducted and the results show that both integrated models are able to minimize the processing time of vessels and can solve problem quickly even involving a large number of vessels. Studies have found that the safety distance set as 5 percent of vessel length gives the best solution. By adding safety distance to the integrated model with non-crossing constraint, the result indicates no improvement in the model objective function due to increasing distance between vessels. The objective function increases in the range of 0.4 to 8.6 percent. However, the safety distance constraint is important for safety and realistic model based on the port’s real situation. Faculty of Science 2023-04-16T00:05:13Z 2023-04-16T00:05:13Z 2021 Thesis Dataset http://openscience.utm.my/handle/123456789/142 en application/pdf application/pdf application/pdf application/pdf Universiti Teknologi Malaysia
spellingShingle Genetic algorithms
Mathematics
Hasan Basri, Azyanzuhaila
Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint
title Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint
title_full Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint
title_fullStr Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint
title_full_unstemmed Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint
title_short Genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint
title_sort genetic algorithm for integrated model of berth allocation problem and quay crane scheduling with noncrossing safety and distance constraint
topic Genetic algorithms
Mathematics
url http://openscience.utm.my/handle/123456789/142
work_keys_str_mv AT hasanbasriazyanzuhaila geneticalgorithmforintegratedmodelofberthallocationproblemandquaycraneschedulingwithnoncrossingsafetyanddistanceconstraint