ON-LINE SCHEDULING OF EMPTY CONTAINERS

摘要

This paper considers the empty container repositioning problem in an on-line scheduling setting. This optimization problem arising from container transportation management aims to balance empty containers distribution among transportation sites so as to minimize the total operating cost of loaded container shipping, empty container allocation and leasing. In this highly uncertain on-line environment we introduce a heuristic that does not attempt to balance the empty container distribution, and evaluate its competitive performance mathematically and empirically.