Novel wharf-based genetic algorithm for berth allocation planning

Commercial ports require an efficient means of scheduling vessels for public berths. In this study, a wharf-based genetic algorithm is proposed for the scheduling of public berths with the aim of reducing reliance on communications and shortening the waiting time of vessels. Schedules are initially encoded as chromosomes, based on wharf characteristics and the need from the generated wharf matching lists to avoid assigning vessels to inappropriate wharves. The proposed algorithm uses a special wharf-based sequential type of chromosome that keeps all of the generated schedules as feasible solutions. Following the selection process, crossover, and mutation, the proposed algorithm adjusts the usage of wharves in order to increase the speed of convergence. The proposed algorithm is able to handle a greater number of vessels when combined with the map-reduce technique. Experimental results demonstrate the effectiveness of the proposed algorithm at assigning vessels to appropriate berths as soon as they arrive. Compared to three other existing algorithms, it performs nine times faster in terms of convergence speed and produces better quality of the solutions.