MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal

Kai Yu and Jingcheng Yang

Mathematical Problems in Engineering, 2019, vol. 2019, 1-16

Abstract:

This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges for the yard crane scheduling. To formulate this problem, we propose a mixed integer linear programming (MILP) model, which jointly optimizes trucks’ waiting costs and penalty costs caused by exceeding waiting time thresholds. Considering the NP-completeness of this scheduling problem, we develop an efficient rolling horizon algorithm based on some heuristics to reduce the computation time. Finally, computational studies are carried out to evaluate the performance of our method and the solutions obtained by CPLEX solver are used for benchmarking purposes.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/4739376.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/4739376.xml (text/xml)

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:hin:jnlmpe:4739376

DOI: 10.1155/2019/4739376

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().