Study On Berth Allocation Problem With Variable Service Priority In Multi-User Container Terminal

PROCEEDINGS OF THE SIXTEENTH (2006) INTERNATIONAL OFFSHORE AND POLAR ENGINEERING CONFERENCE, VOL 3(2006)

引用 1|浏览25
暂无评分
摘要
A dynamic berth allocation model with variable vessel service priorities is proposed to minimize the total handling vessel time in terminal. The First Comes First Served (FCFS) rule is not considered to improve the objective value in the model. A genetic algorithm is improved for the hard model with a reduced basic search space by considering approximate optimal solution properties. A large amount of computational experiments shows that the formulation and the proposed algorithm are adaptable to practical applications.
更多
查看译文
关键词
container terminal, berth allocation, genetic algorithms, service priority, mathematical programming
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要