The integrated yard truck and yard crane scheduling problem: Benders' decomposition-based methods

Jin Xin Cao, Der Horng Lee*, Jiang Hang Chen, Qixin Shi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

125 Citations (Scopus)

Abstract

This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders' decomposition, are developed for problem solution; namely, the general Benders' cut-based method and the combinatorial Benders' cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods.

Original languageEnglish
Pages (from-to)344-353
Number of pages10
JournalTransportation Research Part E: Logistics and Transportation Review
Volume46
Issue number3
DOIs
Publication statusPublished - May 2010
Externally publishedYes

Keywords

  • Benders' decomposition
  • Combinatorial optimization
  • Container terminal operations
  • Mixed-integer programming
  • Scheduling

Cite this