DocumentCode
2705556
Title
Combining various algorithms to solve the ship berthing problem
Author
Goh, Kai-Song ; Lim, Andrew
Author_Institution
Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore
fYear
2000
fDate
2000
Firstpage
370
Lastpage
375
Abstract
The Ship Berthing Problem (SBP) belongs to the category of NP-complete problems. In this paper we discuss the methods of representing the SBP with the use of a directed acyclic graph and the use of a acyclic list to represent valid solutions for the SBP. We then propose and investigate the performance of several variants of the randomized local search, Tabu search and genetic algorithm for solving the SBP
Keywords
computational complexity; directed graphs; search problems; NP-complete problems; Tabu search; acyclic list; directed acyclic graph; genetic algorithm; performance; randomized local search; ship berthing problem; Computer science; Containers; Costs; Drives; Genetic algorithms; Marine vehicles; NP-complete problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools with Artificial Intelligence, 2000. ICTAI 2000. Proceedings. 12th IEEE International Conference on
Conference_Location
Vancouver, BC
ISSN
1082-3409
Print_ISBN
0-7695-0909-6
Type
conf
DOI
10.1109/TAI.2000.889896
Filename
889896
Link To Document