科学研究
Multi-objective genetic algorithm for berth allocation problem considering daytime preference

Hu, Zhi-Hua(胡志华)

COMPUTERS & INDUSTRIAL ENGINEERING

NOV 2015, Volume 89, Pages 2-14

 

Abstract

Maximization of operational efficiency and minimization of cost are pursued by terminal operators, whereas daytime preference is increasingly emphasized by governments, terminal operators and workers. Daytime preference in berth allocation schedule refers to schedule the workloads in nights as fewer as possible, which improves working comfort, safety, and green and energy-savings degrees, but may decrease the throughput and total operational efficiency. By extending existing dynamic discrete berth allocation model, a bi-objective model considering daytime preference is established to minimize the delayed workloads and the workloads in nights. Based on the well known NSGA-II algorithm, a multi-objective genetic algorithm (moGA) is developed for solving the bi-objective model by using a two-part representation scheme. The sensitivities of the algorithmic parameters and tradeoffs between daytime preference and delayed workloads are analyzed by numerical experiments. The algorithmic aspects of the proposed approach and the effects of daytime preference on solutions are all examined. Finally, the managerial implications are discussed. (C) 2015 Elsevier Ltd. All rights reserved.


 

版权所有:上海海事大学   电话:(021)38282000   地址:上海市浦东新区海港大道1550号