A Bi-Level Programming Model and Its Algorithm for Operation Scheduling in Container Terminals

This article reports on the development of a a bi-level programming model that can be used for container terminal scheduling to improve the integration efficiency of container terminals. The model consists of two sub-models: the upper-level model is quay crane scheduling problem, and the lower-level one is dynamic trailer routing problem. The feedback and reciprocity between the two sub-models form the optimal scheme for container terminal scheduling. The authors use a genetic based algorithm to solve the model and numerical tests are provided to illustrate the validity of the model and the algorithm. The results indicate that the bi-level programming model can not only greatly decrease the empty driving distance and the needed trailers at the cost of slight increment of the quay crane operation time, but also decrease the road traffic congestion and the probability of operation delay at container terminal. Using this model, container terminal operation systems are improved because the bi-level model considers the quay crane scheduling and the trailer routing simultaneously.

  • Availability:
  • Authors:
    • Qing-cheng, Zeng
    • Zhong-zhen, Yang
  • Publication Date: 2007-3

Language

  • English

Media Info

  • Media Type: Print
  • Features: References;
  • Pagination: pp 277-281
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 01079782
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Oct 22 2007 2:56PM