DocumentCode
2511332
Title
The computational complexity of ship shifting and berthing operation at dockyard
Author
Chen, Jianping ; Ye, Jiawei
Author_Institution
South China Univ. of Technol., Guangzhou, China
fYear
2011
fDate
23-25 May 2011
Firstpage
383
Lastpage
387
Abstract
This paper exploits the complexities of the ship shifting and berthing operation at dockyard. Firstly establishes a shifting job problem graph model, and analyzes the solution of the model with the Bellman algebra theory. Finally it is proved that the ship shifting and berthing operation problem (SSOP) is a NPC problem and its approximate solution is also a NPC solution.
Keywords
computational complexity; graph theory; sea ports; ships; Bellman algebra theory; NPC problem; computational complexity; dockyard; shifting job problem graph model; ship shifting and berthing operation problem; Analytical models; Approximation algorithms; Computational modeling; Decision making; Heuristic algorithms; Marine vehicles; Mathematical model; Graph model Computational complexity; NPC problem; Ship shifting and berthing;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (CCDC), 2011 Chinese
Conference_Location
Mianyang
Print_ISBN
978-1-4244-8737-0
Type
conf
DOI
10.1109/CCDC.2011.5968207
Filename
5968207
Link To Document