Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

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 allocat...

Descripción completa

Detalles Bibliográficos
Autores principales: Lin, Shih-Wei, Ying, Kuo-Ching, Wan, Shu-Yen
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4175388/
https://www.ncbi.nlm.nih.gov/pubmed/25295295
http://dx.doi.org/10.1155/2014/218925

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4175388/
https://www.ncbi.nlm.nih.gov/pubmed/25295295
http://dx.doi.org/10.1155/2014/218925

Ejemplares similares