A carregar...

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

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Lin, Shih-Wei, Ying, Kuo-Ching, Wan, Shu-Yen
Formato: Artigo
Idioma:Inglês
Publicado em: Hindawi Publishing Corporation 2014
Assuntos:
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC4175388/
https://ncbi.nlm.nih.gov/pubmed/25295295
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/218925
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!