Study on the Continuous Berth Allocation Problem

DOI

10.2991/iceemt-18.2018.76How to use a DOI?

Keywords

Continuous berth allocation; total time in port; prediction; Genetic Algorithm

Abstract

Rationally making berthing plan and reducing waiting time of ship in port have great practical significance to improve wharf service quality and competitive strength. On the basis of studying and summarizing the research theories and model algorithms of domestic and foreign scholars in recent years, this paper studies the continuous berth allocation problem. Suppose that ship types, ETA time, loading time are known, the pier depth is enough to satisfy all types of ships berthing and the ship has no preference position. The integer programming model is established with the shortest total time as the objective function and the genetic algorithm is designed to solve the model. Finally, an example is given to verify the validity of the proposed model. Compared with the first come first served principle, it can optimize the allocation of berth.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xinxin Yan
AU  - Hanping Hou
AU  - Jianliang Yang
AU  - Chenyang Zhao
AU  - Xuehui Wang
AU  - Xue Li
PY  - 2018/12
DA  - 2018/12
TI  - Study on the Continuous Berth Allocation Problem
BT  - Proceedings of the 2018 3rd International Conference on Education, E-learning and Management Technology (EEMT 2018)
PB  - Atlantis Press
SP  - 393
EP  - 397
SN  - 2352-5398
UR  - https://doi.org/10.2991/iceemt-18.2018.76
DO  - 10.2991/iceemt-18.2018.76
ID  - Yan2018/12
ER  -