Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy...
Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
About this item
Full title
Author / Creator
Publisher
Cairo, Egypt: Hindawi Publishing Corporation
Journal title
Language
English
Formats
Publication information
Publisher
Cairo, Egypt: Hindawi Publishing Corporation
Subjects
More information
Scope and Contents
Contents
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimiz...
Alternative Titles
Full title
Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_eaf14816ed0e4ef79c4fdb154e1b35ff
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_eaf14816ed0e4ef79c4fdb154e1b35ff
Other Identifiers
ISSN
2356-6140,1537-744X
E-ISSN
1537-744X
DOI
10.1155/2014/218925
