A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension

This paper studies a yard allocation problem at a container terminal, namely the 3D yard allocation problem with time dimension (3DYAPT), that determines the container storage locations in a given storage block to satisfy requirements from batches of arrived containers. The objective is to minimize...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 2022-02, Vol.138, p.105585, Article 105585
Hauptverfasser:	Wang, Tiantian, Ma, Hong, Xu, Zhou, Xia, Jun
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Container terminals Containers Dynamic programming Heuristic Integer programming Linear programming Operations research Placement Simulated annealing Storage Time dimension Transport buildings, stations and terminals Yard allocation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!