Optimization of Ship’s Route Scheduling Using Genetic Algorithm

Abstract

Route scheduling is a quite complicated process because it involves some determinant factors. Several methods have been used to help resolve the NP-hard problems. This research uses genetic algorithm to assist in optimizing ship scheduling, that where there are several ports to be visited by some ships. The goal is to divide the ship to go to a specific port so that each port is only visited by one ship to minimize the total distance of all ships. The computational experiment produces optimal parameters such as the number of popsize is 30, the number of generations is 100, crossover rate value is 0.3 and mutation rate values is 0.7. The final results is an optimal ship route by minimizing the distance of each ship.