Modeling of yard congestion and optimization of yard template in container ports
Lu Zhen
Transportation Research Part B: Methodological, 2016, vol. 90, issue C, 83-104
Abstract:
As a tactical-level plan, a yard template determines the assignment of spaces in a container port yard for arriving vessels. This paper investigates the concept of yard congestion quantitatively in the context of yard truck interruptions, and develops a combination of probabilistic and physics-based models for truck interruptions. The above work enables us to exactly evaluate the expected link travel time, which then acts as the basis for proposing a mixed-integer programming model that minimizes the total expected travel time of moving containers around the yard. A Squeaky Wheel Optimization based meta-heuristic is developed to solve the model. Experiments are also conducted to validate the effectiveness of the model and the solution method.
Keywords: Traffic congestion in yard; Container ports; Port operation; Maritime logistics (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (30)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191261515302599
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:90:y:2016:i:c:p:83-104
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
DOI: 10.1016/j.trb.2016.04.011
Access Statistics for this article
Transportation Research Part B: Methodological is currently edited by Fred Mannering
More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().